2-Asynchronous automata

W. Zielonka has recently introduced a family of finite automata with a specific behavior, and called them asynchronous automata. They can be considered as a good model to describe concurrent processes exchanging data by means of some common storage. Hereafter, we restrict the family of asynchronous automata by defining the subclass of what we will call 2-asynchronous automata. We illustrate this subclass by a communication problem involving mailboxes, and prove that 2-asynchronous automata are as powerful as asynchronous ones.

Authors

• Robert Cori
• Eric Sopena
• Michel Latteux
• Yves Roos

Keywords

No keywords are indexed for this paper.