New Titles  |  FAQ  |  Keep Informed  |  Review Cart  |  Contact Us Quick Search (Advanced Search ) Browse by Subject General Interest Logic & Foundations Number Theory Algebra & Algebraic Geometry Discrete Math & Combinatorics Analysis Differential Equations Geometry & Topology Probability & Statistics Applications Mathematical Physics Math Education

Partial Order Methods in Verification
Edited by: Doron A. Peled, Lucent Technologies, Murray Hill, NJ, Vaughan R. Pratt, Stanford University, CA, and Gerard J. Holzmann, Lucent Technologies, Murray Hill, NJ
A co-publication of the AMS and DIMACS.
 SEARCH THIS BOOK:
DIMACS: Series in Discrete Mathematics and Theoretical Computer Science
1997; 403 pp; hardcover
Volume: 29
ISBN-10: 0-8218-0579-7
ISBN-13: 978-0-8218-0579-4
List Price: US$103 Member Price: US$82.40
Order Code: DIMACS/29

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 languages theory.

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).

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.

• A. Mazurkiewicz -- Prefix function view of states and events
• W. Thomas -- Elements of an automata theory over partial orders
• M. W. Shields -- Algebraic manipulations and vector languages
• S. Katz -- Refinement with global equivalence proofs in temporal logic
• W. Penczek and M. Srebrny -- A complete axiomatization of a first-order temporal logic over trace systems
• W. Reisig -- Interleaved progress, concurrent progress, and local progress
• G. Plotkin and V. Pratt -- Teams can see pomsets
• G. Winskel and M. Nielsen -- Presheaves as transition systems
• C. Baier and M. Kwiatkowska -- On topological hierarchies of temporal properties
• M. Mukund and P. S. Thiagarajan -- Linear time temporal logics over Mazurkiewicz traces
• A. R. Meyer and A. Rabinovich -- A solution of an interleaving decision problem by a partial order technique
• A. Valmari -- Stubborn set methods for process algebras
• D. Peled -- Partial order reduction: Linear and branching temporal logics and process algebras
• U. Montanari and M. Pistore -- History dependent verification for partial order systems
• T. T. Hildebrandt and V. Sassone -- Transition systems with independence and multi-arcs
• P. Godefroid -- On the costs and benefits of using partial-order methods for the verification of concurrent systems
• E. Best -- Partial order verification with PEP
• D. C. Luckham -- Rapide: A language and toolset for simulation of distributed systems by partial orderings of events