**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: $116.00

AMS Member Price: $92.80

MAA Member Price: $104.40

**Electronic ISBN: 978-1-4704-3987-3
Product Code: DIMACS/29.E**

List Price: $109.00

AMS Member Price: $87.20

MAA Member Price: $98.10

# Partial Order Methods in Verification

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

#### Readership

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.

# Table of Contents

## Partial Order Methods in Verification

- Cover Cover11
- Title page v6
- Contents vii8
- Foreword ix10
- Preface xi12
- Prefix function view of states and events 116
- Elements of an automata theory over partial orders 2540
- Algebraic manipulations and vector languages 4156
- Refinement with global equivalence proofs in temporal logic 5974
- A complete axiomatization of a first-order temporal logic over trace systems 7994
- Interleaved progress, concurrent progress, and local progress 99114
- Teams can see pomsets 117132
- Presheaves as transition systems 129144
- On topological hierarchies of temporal properties 141156
- Linear time temporal logics over Mazurkiewicz traces 171186
- A solution of an interleaving decision problem by a partial order technique 203218
- Stubborn set methods for process algebras 213228
- Partial order reduction: Linear and branching temporal logics and process algebras 233248
- History dependent verification for partial order systems 259274
- Transition systems with independence and multi-arcs 273288
- On the costs and benefits of using partial-order methods for the verification of concurrent systems 289304
- Partial order verification with PEP 305320
- Rapide: A language and toolset for simulation of distributed systems by partial orderings of events 329344
- Debate ’90: An electronic discussion on true concurrency 359374
- Report documentation page 405420
- Back Cover Back Cover1421