3.1 Architecture Principles
The RUML data model defines the structure for machine-readable regulations and decision logic. The architecture is based on a hierarchical parent-to-child relationship, where each node exclusively stores information about its direct children.
3.1 Fundamental Architecture Principles
The RUML architecture MUST follow these fundamental principles:
- Unidirectional relationships: Nodes MUST NOT know any nodes other than their direct
children. Nodes MUST NOT store information about their parent nodes (
Rule NODE-03NODE-03 A node MUST NOT have fields other than those of 3.5; in particular it MUST NOT store its LexID (lexId), its parent or its type.). - One operator per node: Each parent node MUST have exactly ONE operator type that applies to ALL its direct children.
- Ordered hierarchy: The order of children in the children array of parent nodes MUST be
significant and MUST be considered in execution logic (
Rule NODE-04NODE-04 A tool that writes a file MUST keep the order of everychildrenarray.). - LexID as primary identifier: Nodes MUST be identified within the RUML via numeric LexIDs
(
Rule FMT-11FMT-11 Every key ofrulemap.nodesand every entry ofchildrenMUST be a LexID, a string matching^[1-9][0-9]*$.). - Flat map structure: All nodes MUST be defined in a central
nodesobject (Rule NODE-02NODE-02rulemapMUST havenodes, an object whose values are node objects.). Parent-child relationships MUST be established via LexID references in thechildrenarray, NOT through embedded objects (Rule FMT-11FMT-11 Every key ofrulemap.nodesand every entry ofchildrenMUST be a LexID, a string matching^[1-9][0-9]*$.). This enables multiple referencing of the same LexID for modular nodes (see Chapter 6).