DIMACS - Series in Discrete Mathematics and Theoretical Computer Science
Volume: 29; 1997; 403 pp; Hardcover
MSC: Primary 68;
Print ISBN: 978-0-8218-0579-4
Product Code: DIMACS/29
List Price: $109.00
Individual Member Price: $87.20
Partial Order Methods in VerificationShare this page
Edited by Doron A. Peled; Vaughan R. Pratt; Gerard J. Holzmann
A co-publication of the AMS and DIMACS
This book presents surveys on the theory and practice of
modeling, specifying, and validating concurrent systems. It contains
surveys of techniques used in tools developed for automatic validation
of systems. Other papers present recent developments in concurrency
theory, logics of programs, model-checking, automata and formal
The volume contains the proceedings from the workshop, Partial Order Methods in Verification, which was held in Princeton, NJ, in July 1996. The workshop focused on both the practical and the theoretical aspects of using partial order models, including automata and formal languages, category theory, concurrency theory, logic, process algebra, program semantics, specification and verification, topology, and trace theory. The book also includes a lively e-mail debate that took place about the importance of the partial order dichotomy in modeling concurrency.
Co-published with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 1–7 were co-published with the Association for Computer Machinery (ACM).
Table of Contents
Table of Contents
Partial Order Methods in Verification
Graduate students, computer scientists, theoreticians and practicians in formal methods, formal validation of software, program semantics, models of computation, logics of programs, formal languages and automata theory.