Unreliable channels are easier to verify than perfect channels
Information and Computation
Elements of an automata theory over partial orders
POMIV '96 Proceedings of the DIMACS workshop on Partial order methods in verification
On Communicating Finite-State Machines
Journal of the ACM (JACM)
Asynchronous cellular automata for promsets
Theoretical Computer Science
The Book of Traces
Regular Collections of Message Sequence Charts
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
On Logics, Tilings, and Automata
ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
Automata Theory on Trees and Partial Orders
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Emptiness Is Decidable for Asynchronous Cellular Machines
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
The monadic quantifier alternation hierarchy over grids and graphs
Information and Computation - Special issue: LICS'97
Decidability of the termination problem for completely specified protocols
Distributed Computing
A kleene theorem for a class of communicating automata with effective algorithms
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Weighted Distributed Systems and Their Logics
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Causal Message Sequence Charts
Theoretical Computer Science
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
| Hi-index | 0.00 |
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.