Concurrent Automata vs. Asynchronous Systems
نویسنده
چکیده
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.
منابع مشابه
Automata and Logics for Concurrent Systems: Five Models in Five Pages
We survey various automata models of concurrent systems and their connection with monadic second-order logic: finite automata, class memory automata, nested-word automata, asynchronous automata, and message-passing automata.
متن کاملUsing asynchronous Büchi automata for efficient automatic verification of concurrent systems
An Asynchronous Büchi Automaton is a collection of concurrently executing automata, able to perform operations that are shared between one or more of their concurrent components. These automata can be used to specify properties of distributed protocols. In this paper, an efficient method for verifying that a protocol satisfies its Asynchronous Büchi Automaton specification is presented. In orde...
متن کاملCubical Sets are Generalized Transition Systems
We show in this article that \labelled" cubical sets (or Higher-Dimensional Automata) are a natural generalization of transition systems and asynchronous transition systems. This generalizes an older result of 14] which was only holding with precubical sets and subcat-egories of the classical (see 29]) categories of transition systems and asynchronous transition systems. This opens up new promi...
متن کاملEvent-based modelling of ecological systems with asynchronous cellular automata
In this article, we give an example for the modelling of ecological systems with cellular automata based on the description of cell's behaviour by Petri nets. Petri nets ooer a formal modelling technique with event{based, concurrent, asynchronous state changes where graphical symbols are used for the description of states resp. state changes. This allows the formal description of cellular autom...
متن کاملGossiping, Asynchronous Automata and Zielonka's Theorem
In this paper, we rst tackle a natural problem from distributed computing, involving time-stamps. We then show that our solution to this problem can be applied to provide a simpliied proof of Zielonka's theorem|a fundamental result in the theory of concurrent systems. Let P = fp 1 ; p 2 ; : : : ; p N g be a set of computing agents or processes which synchronize with each other from time to time...
متن کامل