Introduction; Preliminaries; Graphs, Logics, and Graph Acceptors; Words and Finite Automata; Dags and Asynchronous Cellular Automata; Mazurkiewicz Traces and Asynchronous Automata; Message Sequence Charts; Communicating Finite-State Machines; Beyond Implementability
Summary
Studies the relationship between automata and monadic second-order logic, focusing on classes of automata that describe the concurrent behavior of distributed systems. This book provides a unifying theory of communicating automata and their logical properties. It covers finite automata, asynchronous (cellular) automata and lossy channel systems
Bibliography
Includes bibliographical references (pages 165-171) and index