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. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Morin, R. (2005). Concurrent automata vs. asynchronous systems. In Lecture Notes in Computer Science (Vol. 3618, pp. 686–698). Springer Verlag. https://doi.org/10.1007/11549345_59
Mendeley helps you to discover research relevant for your work.