AMS eBook CollectionsOne of the world's most respected mathematical collections, available in digital format for your library or institution
Partial Order Methods in Verification
About this Title
Doron Peled, Vaughan R. Pratt and Gerard Holzmann, Editors
Publication: DIMACS Series in Discrete Mathematics and Theoretical Computer Science
Publication Year:
1997; Volume 29
ISBNs: 978-0-8218-0579-4 (print); 978-1-4704-3987-3 (online)
DOI: https://doi.org/10.1090/dimacs/029
MathSciNet review: MR1440885
MSC: Primary 68-06; Secondary 68Q10, 68Q45, 68Q60
ReadershipTable of Contents
Front/Back Matter
Chapters
- Prefix function view of states and events
- Elements of an automata theory over partial orders
- Algebraic manipulations and vector languages
- Refinement with global equivalence proofs in temporal logic
- A complete axiomatization of a first-order temporal logic over trace systems
- Interleaved progress, concurrent progress, and local progress
- Teams can see pomsets
- Presheaves as transition systems
- On topological hierarchies of temporal properties
- Linear time temporal logics over Mazurkiewicz traces
- A solution of an interleaving decision problem by a partial order technique
- Stubborn set methods for process algebras
- Partial order reduction: Linear and branching temporal logics and process algebras
- History dependent verification for partial order systems
- Transition systems with independence and multi-arcs
- On the costs and benefits of using partial-order methods for the verification of concurrent systems
- Partial order verification with PEP
- Rapide: A language and toolset for simulation of distributed systems by partial orderings of events
- Debate ’90: An electronic discussion on true concurrency
- Report documentation page