Logical Data Structure Definition

Return to L Terms

Discussion

A Logical Data Structure Definition describes the structure, meaning, and constraints of an information class at the platform-independent logical level.

A Logical Data Structure Definition identifies the fields, relationships, permitted values, constraints, semantic references, lifecycle values, provenance references, identity requirements, and validation expectations that govern Logical Data Structure Instances.

The Logical Architecture / PIM uses Logical Data Structure Definitions to define information consistently across Logical Nodes, Logical Communication Endpoints, Runtime Planes, interaction patterns, governance relationships, and traceability relationships.

Definition

Platform-independent description of the structure, meaning, and constraints of an information class.

Source

Specialization of Data Structure Definition from Part 1, Section 7.7; generalised from data structure framework material in the original FX Demo Reference Architecture.

Note

A Logical Data Structure Definition is not an IDL structure, Protocol Buffers message, JSON Schema definition, XML Schema definition, Avro schema, OpenAPI schema, database table, ontology class, generated type, file, or message. Implementation profiles use those mechanisms to realize Logical Data Structure Definitions.

Example

A logical Node Status definition identifies the information needed to describe a Logical Node’s identity, lifecycle state, timestamp, status reason, Runtime Plane, and provenance reference.

Return to Top