Context
One row appends a labelled node whose ports are missing, point to the fresh node, or follow bounded port words from the preceding top. The same row history can be observed at several resolutions, and preserving a coarser resolution does not imply preserving a finer one.
Definitions
- The physical history records every created node and port endpoint.
- The figure at a prefix is the minimal rooted labelled port graph with the same unfolding behavior.
- The strong trace is , while the final observation is only .
- Acceptance is a finite readout of the final observed neighborhood and is coarser still.
Hypotheses and scope
- Finite scaffold degree, finite observation distance, and finite working alphabet.
- Histories compared by strong or final equivalence have equal length.
Proof or evidence
The publication gives the row semantics, minimal-figure construction, strong and final congruences, and an explicit three-row example with equal final figures but different strong traces.
Verification notes
The definition was checked against the governed claim ledger, the paper, and its implication-oriented proof audit. No theorem is asserted by this entry.
Limitations
- Strong equivalence is finer than final equivalence; neither is physical equality.
- The ambient history space is not identified with the runs of one particular automaton.
- A result about acceptance alone must not be promoted to a result about figures or histories.
Notes
Strong equivalence retains the figure after every prefix; final equivalence forgets those intermediate figures. Physical endpoint equality is finer than behavioral equality. The definition makes no completeness or novelty claim and does not identify the ambient history algebra with the generated orbit of one particular automaton.