Javier Esparza, Keijo Heljanko

Unfoldings

A Partial-Order Approach to Model Checking

• Gebundenes Buch

Produktbeschreibung

Model checking is a prominent technique used in the hardware and software industries for automatic verification. While it is very successful in finding subtle bugs in distributed systems, it faces the state explosion problem - the number of reachable states grows exponentially in the number of concurrent components.

In this book the authors introduce unfoldings, an approach to model checking which alleviates the state explosion problem by means of concurrency theory. They offer a gentle introduction to the basics of the method, and in particular they detail an unfolding-based algorithm for model checking concurrent systems against properties specified as formulas of linear temporal logic (LTL). Self-contained chapters cover transition systems and their products; unfolding products; search procedures for basic verification problems, such as reachability and livelocks; and model checking LTL. The final chapter summarizes the results of the book, and points the reader totools and case studies.

The book will be of value to researchers and graduate students engaged in automatic verification and concurrency theory.

Produktdetails

• Monographs in Theoretical Computer Science
• Verlag: Springer / Springer Berlin Heidelberg / Springer, Berlin
• Artikelnr. des Verlages: 12118885, 978-3-540-77425-9
• 2008
• Seitenzahl: 188
• Erscheinungstermin: 27. März 2008
• Englisch
• Abmessung: 241mm x 160mm x 15mm
• Gewicht: 442g
• ISBN-13: 9783540774259
• ISBN-10: 3540774254
• Artikelnr.: 23323100

Inhaltsangabe

Transition Systems and Products.- Unfolding Products.- Search Procedures for the Executability Problem.- More on the Executability Problem.- Search Procedures for the Repeated Executability Problem.- Search Procedures for the Livelock Problem.- Model Checking LTL.- Summary, Applications, Extensions, and Tools.

Rezensionen

From the reviews: "In this book the authors show that the study of 'unfoldings', a mathematical formalism for the description and analysis of concurrent systems, alleviates the state explosion problem. ... Most of the chapters are self-contained in order to increase the readability of the content. ... The book provides a good overview on unfoldings techniques to researchers and graduate students engaged in model checking and concurrency theory. It can also be of interest to other people, outside computer science, since concurrency occurs everywere." (Viorel Mihai Gontineac, Zentrablatt MATH, Vol. 1153, 2009)