Partial-Order Methods for the Verification of Concurrent Systems

Partial-Order Methods for the Verification of Concurrent Systems

1996 | Patrice Godefroid
Partial-order methods for the verification of concurrent systems: an approach to the state-explosion problem by Patrice Godefroid is a book that presents algorithms for verifying concurrent systems, focusing on the state-explosion problem. The book discusses the use of partial-order semantics to reduce the state space in the verification of concurrent systems. It introduces a family of algorithms that avoid the state-explosion problem by exploring only a reduced part of the global state-space that is sufficient for checking the given property. The book also discusses the implementation of these algorithms in an add-on package for the protocol verification system SPIN. The techniques and algorithms described have been tested on numerous examples, including several industrial-size communication protocols. The book is a revised version of the author's PhD thesis, submitted in 1994 to the University of Liège. The author thanks his thesis advisor, Pierre Wolper, and other members of his reading committee for their support and guidance. The book is organized into nine chapters, covering topics such as concurrent systems and semantics, using partial orders to tackle state explosion, persistent sets, sleep sets, verification of safety properties, model checking, experiments, and conclusions. The book includes a list of figures and a bibliography. The author also thanks various colleagues and institutions for their support and acknowledges the financial support from the European Community ESPRIT projects and the Belgian Incentive Program. The book concludes with a summary and future work.Partial-order methods for the verification of concurrent systems: an approach to the state-explosion problem by Patrice Godefroid is a book that presents algorithms for verifying concurrent systems, focusing on the state-explosion problem. The book discusses the use of partial-order semantics to reduce the state space in the verification of concurrent systems. It introduces a family of algorithms that avoid the state-explosion problem by exploring only a reduced part of the global state-space that is sufficient for checking the given property. The book also discusses the implementation of these algorithms in an add-on package for the protocol verification system SPIN. The techniques and algorithms described have been tested on numerous examples, including several industrial-size communication protocols. The book is a revised version of the author's PhD thesis, submitted in 1994 to the University of Liège. The author thanks his thesis advisor, Pierre Wolper, and other members of his reading committee for their support and guidance. The book is organized into nine chapters, covering topics such as concurrent systems and semantics, using partial orders to tackle state explosion, persistent sets, sleep sets, verification of safety properties, model checking, experiments, and conclusions. The book includes a list of figures and a bibliography. The author also thanks various colleagues and institutions for their support and acknowledges the financial support from the European Community ESPRIT projects and the Belgian Incentive Program. The book concludes with a summary and future work.
Reach us at info@study.space
[slides] Partial-Order Methods for the Verification of Concurrent Systems | StudySpace