Name
Abstract | ||
|---|---|---|
We 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. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1017/S0960129521000293 | Math. Struct. Comput. Sci. |
DocType | Volume | Issue |
Journal | 31 | 5 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Uli Fahrenberg | 1 | 0 | 1.35 |
| Christian Johansen | 2 | 1 | 3.40 |
| Georg Struth | 3 | 641 | 53.76 |
| Krzysztof Ziemiański | 4 | 0 | 1.35 |