We are delighted to announce that a new book on Unfoldings is now available.
Esparza, J. and Heljanko, K.: Unfoldings A Partial-Order Approach to Model Checking. EATCS Monographs in Theoretical Computer Science, Springer-Verlag, ISBN 978-3-540-77425-9, 172 p, 2008. For more information, see: http://www.springer.com/978-3-540-77425-9 Cover text: 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 to tools and case studies. The book will be of value to researchers and graduate students engaged in automatic verification and concurrency theory. Written for: Researchers, postgraduates Keywords: - Computer-aided verification - Concurrency - Model checking - Petri nets - Unfoldings Table of Contents: Introduction Transition Systems and Products - Transition Systems - Products of Transition Systems - Petri Net Representation of Products - Interleaving Representation of Products Unfolding Products - Branching Processes and Unfoldings - Some Properties of Branching Processes - Verification Using Unfoldings - Constructing the Unfolding of a Product - Search Procedures - Goals and Milestones for Next Chapters Search Procedures for the Executability Problem - Search Strategies for Transition Systems - Search Scheme for Transition Systems - Search Strategies for Products - Search Scheme for Products - Adequate Search Strategies - Complete Search Scheme for Arbitrary Strategies More on the Executability Problem - Complete Prefixes - Least Representatives - Breadth-First and Depth-First Strategies - Strategies Preserved by Extensions Are Well-Founded Search Procedures for the Repeated Executability Problem - Search Scheme for Transition Systems - Search Scheme for Products Search Procedures for the Livelock Problem - Search Scheme for Transition Systems - Search Scheme for Products Model Checking LTL - Linear Temporal Logic - Interpreting LTL on Products - Testers for LTL Properties - Model Checking with Testers: A First Attempt - Stuttering Synchronization Summary, Applications, Extensions, and Tools - Looking Back: A Two-Page Summary of This Book - Some Experiments - Some Applications - Some Extensions - Some Tools References Index With kind regards, Javier Esparza and Keijo Heljanko -- [EMAIL PROTECTED] ---- [[ Petri Nets World: ]] [[ http://www.informatik.uni-hamburg.de/TGI/PetriNets/ ]] [[ Mailing list FAQ: ]] [[ http://www.informatik.uni-hamburg.de/TGI/PetriNets/pnml/faq.html ]] [[ Post messages/summary of replies: ]] [[ [email protected] ]]
