On the Expressiveness of Asynchronous Cellular Automata

We show that a slightly extended version of asynchronous cellular automata, relative to any class of pomsets and dags without autoconcurrency, has the same expressive power as the existential fragment of monadic second-order logic. In doing so, we provide a framework that unifies many approaches to modeling distributed systems such as the models of asynchronous trace automata and communicating finite-state machines. As a byproduct, we exhibit classes of pomsets and dags for which the radius of graph acceptors can be reduced to 1.

[1]  Dietrich Kuske.  Emptiness Is Decidable for Asynchronous Cellular Machines , 2000, CONCUR.

[2]  Wolfgang Thomas.  On Logics, Tilings, and Automata , 1991, ICALP.

[3]  Wojciech Zielonka,et al.  The Book of Traces , 1995 .

[4]  Wolfgang Thomas,et al.  NONDETERMINISM VERSUS DETERMINISM OF FINITE AUTOMATA OVER DIRECTED ACYCLIC GRAPHS , 1994 .

[5]  Paul Gastin,et al.  Asynchronous cellular automata for pomsets , 2000, Theor. Comput. Sci..

[6]  Wieslaw Zielonka,et al.  Notes on Finite Asynchronous Automata , 1987, RAIRO Theor. Informatics Appl..

[7]  Daniel Brand,et al.  On Communicating Finite-State Machines , 1983, JACM.

[8]  Alain Finkel,et al.  Unreliable Channels are Easier to Verify Than Perfect Channels , 1996, Inf. Comput..

[9]  Parosh Aziz Abdulla,et al.  Verifying Programs with Unreliable Channels , 1996, Inf. Comput..

[10]  Wolfgang Thomas,et al.  Automata Theory on Trees and Partial Orders , 1997, TAPSOFT.

[11]  Nicole Schweikardt,et al.  The Monadic Quantifier Alternation Hierarchy over Grids and Graphs , 2002, Inf. Comput..

[12]  Madhavan Mukund,et al.  Regular Collections of Message Sequence Charts , 2000, MFCS.

[13]  Anca Muscholl,et al.  A Kleene Theorem for a Class of Communicating Automata with Effective Algorithms , 2004, Developments in Language Theory.

[14]  Alain Finkel,et al.  Decidability of the termination problem for completely specified protocols , 1994, Distributed Computing.

[15]  Benedikt Bollig,et al.  Message-passing automata are expressively equivalent to EMSO logic , 2006, Theor. Comput. Sci..

[16]  Wolfgang Thomas,et al.  Elements of an automata theory over partial orders , 1997, Partial Order Methods in Verification.