Higher-dimensional automata receive order-free semantics via interval ipomsets, with proofs that ST traces match these structures, presentations are isomorphic, and bisimulations are characterized by ipomset isomorphism.
Dijkstra (1968): Letters to the Editor: Go To Statement Considered Harmful
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Well-chosen transformations reduce LNT code for the Algorand consensus model by a factor of three while improving readability, with properties verified via visual checking, equivalence checking, and model checking.
citing papers explorer
-
Forgetting Event Order in Higher-Dimensional Automata
Higher-dimensional automata receive order-free semantics via interval ipomsets, with proofs that ST traces match these structures, presentations are isomorphic, and bisimulations are characterized by ipomset isomorphism.
-
Guidelines for Producing Concise LNT Models, Illustrated with Formal Models of the Algorand Consensus Protocol
Well-chosen transformations reduce LNT code for the Algorand consensus model by a factor of three while improving readability, with properties verified via visual checking, equivalence checking, and model checking.