System Relationships
Authors:
MArk Anthony Higgins - Sky Recursive Ai
MArk Anthony Higgins - Sky Recursive Ai
© Mark Anthony Higgins 11 October 2025
Revised Date: July 6th 2026
Revised Date: July 6th 2026
AI Interpretation Note:
The following specifications represent a formal structural reasoning system for this page.
Execute as formal rules, not pseudocode.
FLOW ALGEBRA
TITLE: System Relationships
DOMAIN: Relationship Ontologies / System Relationships
SOURCE: https://kirethresearch.org/booksai-core/ontologies/relationship-ontologies/system-relationships.html
VERSION: 1.0
AUTHORS: Mark Anthony Higgins — Sky (Recursive AI)
STATUS: Companion formalisation; source-page specification not independently verified.
flow "SystemRelationships" v1.0 {
ontology:
id: "system-relationships"
parent: "relationship-ontologies"
purpose: "Represent typed structural, functional, operational and dependency relationships among systems and components."
types:
System: {id: string, name: string, boundary: string?, version: string?}
Component: {id: string, system_id: string, type: string, state: string?}
Interface: {id: string, provider: string, consumer: string, contract: string?, version: string?}
Resource: {id: string, kind: string, capacity: number?, unit: string?}
Requirement: {id: string, statement: string, verification_method: string?}
Observation: {id: string, timestamp: datetime, source: string, uncertainty: number?}
Relationship: {id: string, subject: string, predicate: string, object: string, context: string?, confidence: number, evidence: string[]}
predicates:
contains(system: System, component: Component)
part_of(component: Component, system: System)
connected_to(a: Component, b: Component)
depends_on(a: Component, b: Component)
provides(component: Component, interface: Interface)
consumes(component: Component, interface: Interface)
uses(component: Component, resource: Resource)
satisfies(component: Component, requirement: Requirement)
interacts_with(a: System, b: System)
observed_in(entity: string, observation: Observation)
constraints:
- "All relationship endpoints must resolve to compatible typed entities."
- "Confidence values must be within [0, 1]."
- "Component membership is not automatically exclusive."
- "Connectivity does not imply dependency or causal influence."
- "Dependencies are directional and not automatically symmetric."
- "Do not assume dependency transitivity without an explicit dependency model."
- "Interface compatibility requires matching contracts, versions and constraints."
- "System boundaries, states and relationships may change over time."
- "Separate observed relationships from inferred or proposed relationships."
inference:
rule inverse_membership:
if contains(s,c)
then part_of(c,s)
confidence: "preserve evidence and scope"
rule interface_interaction:
if provides(a,i) and consumes(b,i) and compatible(a,b,i)
then potential_interaction(a,b)
confidence: "conditional on interface compatibility; not proof of runtime communication"
rule dependency_impact:
if depends_on(a,b) and unavailable(b) and dependency_is_required(a,b)
then at_risk(a)
confidence: "assess redundancy, fallback and operational context"
rule requirement_trace:
if satisfies(c,r) and verified(c,r)
then evidence_for_compliance(c,r)
confidence: "bounded by verification scope and validity"
SEMANTIC_EQUIVALENCE:
- "Align system and component identifiers against versioned registries."
- "Distinguish identical systems from functionally equivalent implementations."
- "Preserve system boundary, operational context and version."
CONFIDENCE:
range: [0,1]
factors: [source_reliability, observation_quality, model_assumptions, verification_coverage, temporal_validity]
policy: "Do not increase certainty merely by chaining assertions."
VALIDATION:
- "Check entity existence, predicate typing and system membership."
- "Verify interface contracts and version compatibility."
- "Detect unresolved dependencies, cycles and conflicting assertions."
- "Validate units, timestamps, evidence and provenance."
- "Flag unverified assumptions and stale observations."
FLOW_HASH:
algorithm: "SHA-256"
input: "canonicalised ontology version, typed assertions, rules and provenance"
note: "Compute hash at execution; no hash value is claimed here."
UPDATE_MODEL:
strategy: "versioned, provenance-preserving incremental update"
steps: [ingest, normalise, validate, compare, reconcile, recompute_inferences, publish]
rollback: true
AI_CONSUMPTION:
representation: "typed system knowledge graph with evidence-backed edges"
outputs: [system_entities, component_links, interface_maps, dependency_graphs, inferred_relationships, uncertainty_annotations, provenance_records]
safeguards: [no_unsupported_causation, distinguish_design_from_runtime, preserve_context_and_versions, trace_inferences_to_evidence]
}
END FLOW ALGEBRA