Abstract
AbstractWe introduce languages of higher-dimensional automata (HDAs) and develop some of their properties. To this end, we define a new category of precubical sets, uniquely naturally isomorphic to the standard one, and introduce a notion of event consistency. HDAs are then finite, labeled, event-consistent precubical sets with distinguished subsets of initial and accepting cells. Their languages are sets of interval orders closed under subsumption; as a major technical step, we expose a bijection between interval orders and a subclass of HDAs. We show that any finite subsumption-closed set of interval orders is the language of an HDA, that languages of HDAs are closed under binary unions and parallel composition, and that bisimilarity implies language equivalence.
Publisher
Cambridge University Press (CUP)
Subject
Computer Science Applications,Mathematics (miscellaneous)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Closure and Decision Properties for Higher-Dimensional Automata;Theoretical Aspects of Computing – ICTAC 2023;2023
2. A Myhill-Nerode Theorem for Higher-Dimensional Automata;Application and Theory of Petri Nets and Concurrency;2023
3. Posets with interfaces as a model for concurrency;Information and Computation;2022-05
4. Convolution and concurrency;Mathematical Structures in Computer Science;2021-09
5. Abstract Strategies and Coherence;Relational and Algebraic Methods in Computer Science;2021