Languages of higher-dimensional automata
DOI10.1017/S0960129521000293zbMath1495.68119arXiv2103.07557OpenAlexW3205026340MaRDI QIDQ5076390
Georg Struth, Uli Fahrenberg, Krzysztof Ziemiański, Christian Johansen
Publication date: 17 May 2022
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2103.07557
Formal languages and automata (68Q45) Linearly ordered topological spaces, generalized ordered spaces, and partially ordered spaces (54F05) Algebraic theory of languages and automata (68Q70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Simplicial sets, simplicial objects (18N50)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- ST-structures
- Modular construction and partial order semantics of Petri nets
- Modeling concurrency with interval traces
- Models for concurrency: Towards a classification
- Spaces of directed paths on pre-cubical sets
- Structure of concurrency
- Failures semantics based on interval semiwords is a congruence for refinement
- Configuration structures, event structures and Petri nets
- Erratum to ``On the expressiveness of higher dimensional automata
- On interprocess communication. I: Basic formalism
- Modeling concurrency with partial orders
- The equational theory of pomsets
- Petri nets, event structures and domains. I
- An algebraic characterization of the behaviour of non-sequential systems
- A cubical model of homotopy type theory
- Computer science today. Recent trends and developments
- Bisimulation from open maps
- Spaces of directed paths on pre-cubical sets II
- The univalence axiom in cubical sets
- On the expressiveness of higher dimensional automata
- Algebraic topology and concurrency
- Directed algebraic topology and concurrency. With a foreword by Maurice Herlihy and a preface by Samuel Mimram
- Intransitive indifference with unequal indifference intervals
- Dipaths and dihomotopies in a cubical complex
- Homologie singulière des espaces fibrés. Applications
- Concurrent Machines
- Transition and cancellation in concurrency and branching time
- Higher dimensional automata revisited
- Generating Posets Beyond N
- Foundations of Software Science and Computational Structures
- The mutual exclusion problem
- Refinement of actions and equivalence notions for concurrent systems
This page was built for publication: Languages of higher-dimensional automata
