A Myhill-Nerode theorem for higher-dimensional automata
From MaRDI portal
Publication:6535191
DOI10.1007/978-3-031-33620-1_9zbMATH Open1541.68193MaRDI QIDQ6535191FDOQ6535191
Authors: Uli Fahrenberg, Krzysztof Ziemiański 
Publication date: 16 November 2023
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Learning regular sets from queries and counterexamples
- Petri nets, event structures and domains. I
- On the expressiveness of higher dimensional automata
- Concurrent Machines
- ST-structures
- Refinement of actions and equivalence notions for concurrent systems
- Configuration structures, event structures and Petri nets
- The Theory of Stabilisation Monoids and Regular Cost Functions
- Title not available (Why is that?)
- Transition and cancellation in concurrency and branching time
- Title not available (Why is that?)
- Title not available (Why is that?)
- Modular construction and partial order semantics of Petri nets
- Solving Games Without Determinization
- Erratum to ``On the expressiveness of higher dimensional automata
- Structure of concurrency
- Trees in partial higher dimensional automata
- Operational Semantics, Interval Orders and Sequences of Antichains
- Languages of higher-dimensional automata
- Title not available (Why is that?)
- Learning pomset automata
- Coalgebra learning via duality
- Relating word and tree automata
- Posets with interfaces as a model for concurrency
- Pomset Languages of Finite Step Transition Systems
- Active automata learning as black-box search and lazy partition refinement
Cited In (4)
This page was built for publication: A Myhill-Nerode theorem for higher-dimensional automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535191)
