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 an introduction to the basics of the method and detail an unfolding-based algorithm for model checking concurrent systems against properties specified as formulas of linear temporal logic (LTL). The book will be of value to researchers and graduate students engaged in automatic verification and concurrency theory.
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) "The authors are leading experts in the field and provide an excellent account of the most important results in unfoldings within a coherent framework, which is accompanied by many examples. ... Overall, this monograph is a success and highly recommended reading for everyone interested in concurrency and automatic verification." (Gerald Luttgen, Mathematical Reviews, Issue 2011 k)
Series: Monographs in Theoretical Computer Science : an Eatcs Series
Number Of Pages: 184
Published: 25th November 2010
Dimensions (cm): 23.4 x 15.6 x 0.9
Weight (kg): 0.29