基本説明
Studies the relationship between automata and monadic second-order logic, focusing on classes of automata that describe the concurrent behavior of distributed systems.
Full Description
This book studies the relationship between automata and monadic second-order logic, focusing on classes of automata that describe the concurrent behavior of distributed systems. It provides a unifying theory of communicating automata and their logical properties. Based on Hanf's Theorem and Thomas' graph acceptors, it develops a result that allows characterization of many popular models of distributed computation in terms of the existential fragment of monadic second-order logic.
Contents
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.
