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's 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.
Format: Hardback
CONTRIBUTORS: Benedikt Bollig
EAN: 9783540329220
COUNTRY: Germany
PAGES:
WEIGHT: 459 g
HEIGHT: 235 cm
PUBLISHED BY: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
DATE PUBLISHED: 2006-07-24
CITY:
GENRE: COMPUTERS / Computer Science, COMPUTERS / Machine Theory, COMPUTERS / Software Development & Engineering / General, COMPUTERS / Programming / Algorithms, MATHEMATICS / Logic
WIDTH: 155 cm
SPINE:
Book Themes:
Network hardware, Algorithms and data structures, Software Engineering, Mathematical theory of computation
From the reviews:
"The book deals with one essential problem of communication systems, namely formal description of protocols and systems and verification of correctness of their operation. … The book, due to clear definitions, well proved theorems and a number of illustrative examples, can be advised as a valuable source of knowledge for graduate mathematics and computer science students." (Jozef Wozniak, Zentralblatt MATH, Vol. 1107 (9), 2007)
