Mixed product and asynchronous automata
Theoretical Computer Science
Connections between a concrete and an abstract model of concurrent systems
Proceedings of the fifth international conference on Mathematical foundations of programming semantics
Representation of computations in concurrent automata by dependence orders
Theoretical Computer Science
Stable trace automata vs. full trace automata
Theoretical Computer Science
The Book of Traces
Deterministic Behavioural Models for Concurrency
MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
Concurrency, Automata and Domains
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Proceedings of an Advanced Course on Petri Nets: Central Models and Their Properties, Advances in Petri Nets 1986-Part II
Regular Event Structures and Finite Petri Nets: The Conflict-Free Case
ICATPN '02 Proceedings of the 23rd International Conference on Applications and Theory of Petri Nets
Nondeterministic Automata with Concurrency Relations and Domains
CAAP '94 Proceedings of the 19th International Colloquium on Trees in Algebra and Programming
Proceedings of an Advanced Course on Petri Nets: Central Models and Their Properties, Advances in Petri Nets 1986-Part II
Regular Event Structures and Finite Petri Nets: A Conjecture
Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
Categories of asynchronous systems
Categories of asynchronous systems
Semantics of Deterministic Shared-Memory Systems
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
MSO Logic for Unambiguous Shared-Memory Systems
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Distributed Asynchronous Automata
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Compositional synthesis of asynchronous automata
Theoretical Computer Science
Unfolding synthesis of asynchronous automata
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
A Geometric View of Partial Order Reduction
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
We compare the expressive power of two automata-based finite-state models of concurrency. We show that Droste's and Kuske's coherent stably concurrent automata and Bednarczyk's forward-stable asynchronous systems describe the same class of regular event structures. This connection subsumes a previous study by Schmitt which relates Stark's trace automata to asynchronous systems. This work relies on Zielonka's theorem and some unrecognized result due to Arnold.