Decidability of Parameterized Verification

Decidability of Parameterized Verification


Choose Expedited Shipping at checkout for guaranteed delivery by Friday, August 23


While the classic model checking problem is to decide whether a finite system satisfies a specification, the goal of parameterized model checking is to decide, given finite systems M(n) parameterized by n ∈ N, whether, for all n ∈ N, the system M(n) satisfies a specification. In this book we consider the important case of M(n) concurrent system, where the number of replicated processes depends on the parameter n but each process is independent of n. Examples are cache coherence protocols, networks of finite-state agents, and systems that solve mutual exclusion or scheduling problems. Further examples are abstractions of systems, where the processes of the original systems actually depend on the parameter.

Product Details

ISBN-13: 9781627057431
Publisher: Morgan and Claypool Publishers
Publication date: 09/30/2015
Series: Synthesis Lectures on Distributed Computing Theory
Pages: 170
Product dimensions: 7.50(w) x 9.30(h) x 0.00(d)

About the Author

Roderick Bloem is a professor at Graz University of Technology. He received an M.Sc. in computer science from Leiden University in the Netherlands (1996) and a Ph.D. from the University of Colorado at Boulder (2001). His thesis work, under the supervision of Fabio Somenzi, was on formal verification using Linear Temporal Logic.

Since 2002, he has been an assistant professor at Graz University of Technology and a full professor since 2008. His research interests are in formal methods for the design and verification of digital systems, including hardware, software, and combinations such as embedded systems. He studies applications of game theory to the automatic synthesis of systems from their specifications, connections between temporal logics and omega-automata, model checking, and automatic fault localization and repair.

Swen Jacobs is a postdoc at Saarland University. He received his Ph.D. (Dr. Ing.) from Saarland University for his work on decision procedures for the verification of complex systems at the Max-Planck-Institute for Informatics.

He worked at École Polytechnique Fédérale de Lausanne (EPFL), at Technical University Graz, and has been a visiting professor at the University of Ljubljana. His current work focuses on the automated verification and synthesis of distributed systems, based on a combination of logical and game-theoretic methods.

Ayrat Khalimov is a Ph.D. student at Technical University of Graz, Austria. He received his master's degree in applied physics and Mathematics at Moscow Insitute of Physics and Technology (MIPT), with the thesis focusing on a method of calculation of current leakages in hardware circuits. Later, he joined Dependable Systems Lab at École Polytechnique Fédérale de Lausanne (EPFL) for an internship where he researched symbolic execution techniques for software verification. His current area of research is parameterized synthesis and verification.

Igor Konnov is a postdoc (Universitätsassistent) at the Formal Methods in Systems Engineering Group, Institute of Information Systems of TU Wien (Vienna University of Technology). His research interests include model checking, parameterized model checking, and verification of distributed algorithms.

He received his Specialist (comparable to M.Sc.) and Ph.D. degrees in applied mathematics and computer science from Lomonosov Moscow State University. In his Ph.D. thesis, he introduced new techniques for parameterized model checking.

Table of Contents

Table of Contents: Acknowledgments / Introduction / System Model and Specification Languages / Standard Proof Machinery / Token-passing Systems / Rendezvous and Broadcast / Guarded Protocols / Ad Hoc Networks / Related Work / Parameterized Model Checking Tools / Conclusions / Bibliography / Authors' Biographies

Customer Reviews

Most Helpful Customer Reviews

See All Customer Reviews