Languages of Higher-Dimensional Automata

  title={Languages of Higher-Dimensional Automata},
  author={Ulrich Fahrenberg and Christian Johansen and Georg Struth and Krzysztof Ziemia'nski},
  journal={Math. Struct. Comput. Sci.},
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… 
6 Citations

A Kleene Theorem for Higher-Dimensional Automata

We prove a Kleene theorem for higher-dimensional automata (HDAs). It states that the languages they recognise are precisely the rational subsumption-closed sets of interval pomsets. The rational

Regular Monoidal Languages

By investigating the morphisms in monoidal categories from the perspective of language theory, this work contributes to research into the computational manipulation of string diagrams, and so their usage in industrial strength applications.

Posets with Interfaces for Concurrent Kleene Algebra

It is shown that iposets under gluing composition form a category, extending the monoid of posets under serial composition, and a 2-category when enriched with a subsumption order and a suitable parallel composition as a lax tensor, which generalises the interchange monoids used in concurrent Kleene algebra.

Generating Posets with Interfaces

A new class of iposet with full interfaces is introduced and a new incomplete isomorphism invariant is defined which may be computed in polynomial time yet identifies only very few pairs of nonisomorphic iposets.

A Kleene Theorem for Higher-Dimensional Automata ACM Classification Theory of computation → Automata extensions

We prove a Kleene theorem for higher-dimensional automata (HDAs). It states that the languages they recognise are precisely the rational subsumption-closed sets of interval pomsets. The rational



On the expressiveness of higher dimensional automata

Bisimulation for Higher-Dimensional Automata. A Geometric Interpretation

It is shown how parallel composition of higher-dimensional automata (HDA) can be expressed categorically in the spirit of Winskel & Nielsen and a new notion of bisimulation of HDA is defined using open maps.

The Equational Theory of Pomsets

Higher dimensional automata revisited

  • V. Pratt
  • Mathematics
    Mathematical Structures in Computer Science
  • 2000
The dual of a true concurrency schedule appears to be a false concurrency automaton, a paradox we resolved in a previous paper by extending the latter to higher dimensions. This extension may be

Regular Sets of Pomsets with Autoconcurrency

This work identifies regular sets of pomsets as recognizable subsets in the monoid of multiset sequences and establishes some interesting closure properties that allow this approach to relate to SP-recognizability in the particular case of series-parallel pomets.


Modeling concurrency with partial orders

  • V. Pratt
  • Computer Science
    International Journal of Parallel Programming
  • 2005
This paper extracts a single hybrid approach having a rich language that mixes algebra and logic and having a natural class of models of concurrent processes, a notion of partial string derived from the view of a string as a linearly ordered multiset by relaxing the linearity constraint, thereby permitting partially ordering multisets or pomsets.

Higher Dimensional Automata

It is provided the basics of a 2-dimensional theory of automata on series-parallel biposets and relates these classes to languages of series-Parallel bipOSets definable in monadic second-order logic.

Sculptures in Concurrency

It is shown that there are sculptures whose unfoldings cannot besculpted, and that sculptures are the same as Euclidean cubical complexes, which exposes a close connection between geometric and combinatorial models for concurrency which may be of use for both areas.