Formal Models of Communicating Systems.
β Benedikt Bollig
π Library
π
2006
π Springer
π English
β¦ LIBER β¦
π
Formal Models of Communicating Systems: Languages, Automata, and Monadic Second-Order Logic (Texts in Theoretical Computer Science. an Eatcs Series)
β Scribed by Benedikt Bollig
- Publisher
- Springer
- Year
- 2006
- Tongue
- English
- Leaves
- 183
- Category
- Library
β¬ Acquire This Volume
No coin nor oath required. For personal study only.
β¦ Synopsis
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.
π SIMILAR VOLUMES
Elements of Finite Model Theory (Texts i
β Leonid Libkin
π Library
π
2004
π Springer
π English
<span>Finite model theory is an area of mathematical logic that grew out of computer science applications. The main sources of motivational examples for finite model theory are found in database theory, computational complexity, and formal languages, although in recent years connections with other a
Formal Methods for Software Engineering:
β Markus Roggenbach, Antonio Cerone, Bernd-Holger Schlingloff, Gerardo Schneider,
π Library
π
2022
π Springer
π English
<p><span>Software programs are formal entities with precise meanings independent of their programmers, so the transition from ideas to programs necessarily involves a formalisation at some point.</span></p><p><span>The first part of this graduate-level introduction to formal methods develops an unde
Finite Model Theory and Its Applications
β Erich GrΓ€del, Phokion G. Kolaitis, Leonid Libkin, Maarten Marx, Joel Spencer, Mo
π Library
π
2007
π Springer
π English
<span>Finite model theory,as understoodhere, is an areaof mathematicallogic that has developed in close connection with applications to computer science, in particular the theory of computational complexity and database theory. One of the fundamental insights of mathematical logic is that our unders
DNA Computing: New Computing Paradigms (
π
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
β Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa
π Library
π
2010
π Springer
π English
Parameterized Complexity Theory (Texts i
β J. Flum, M. Grohe
π Library
π
2006
π Springer
π English
<p><span>Parameterized complexity theory is a recent branch of computational complexity theory that provides a framework for a refined analysis of hard algorithmic problems. The central notion of the theory, fixed-parameter tractability, has led to the development of various new algorithmic techniqu