Item Successfully Added to Cart
An error was encountered while trying to add the item to the cart. Please try again.
OK
Please make all selections above before adding to cart
OK
The following link can be shared to navigate to this page. You can select the link to copy or click the 'Copy To Clipboard' button below.
Copy To Clipboard
Successfully Copied!
Partial Order Methods in Verification
 
Edited by: Doron A. Peled Lucent Technologies, Murray Hill, NJ
Vaughan R. Pratt Stanford University, Stanford, CA
Gerard J. Holzmann Lucent Technologies, Murray Hill, NJ
A co-publication of the AMS and DIMACS
Front Cover for Partial Order Methods in Verification
Available Formats:
Hardcover ISBN: 978-0-8218-0579-4
Product Code: DIMACS/29
List Price: $116.00
MAA Member Price: $104.40
AMS Member Price: $92.80
Electronic ISBN: 978-1-4704-3987-3
Product Code: DIMACS/29.E
List Price: $109.00
MAA Member Price: $98.10
AMS Member Price: $87.20
Bundle Print and Electronic Formats and Save!
This product is available for purchase as a bundle. Purchasing as a bundle enables you to save on the electronic version.
List Price: $174.00
MAA Member Price: $156.60
AMS Member Price: $139.20
Front Cover for Partial Order Methods in Verification
Click above image for expanded view
  • Front Cover for Partial Order Methods in Verification
  • Back Cover for Partial Order Methods in Verification
Partial Order Methods in Verification
Edited by: Doron A. Peled Lucent Technologies, Murray Hill, NJ
Vaughan R. Pratt Stanford University, Stanford, CA
Gerard J. Holzmann Lucent Technologies, Murray Hill, NJ
A co-publication of the AMS and DIMACS
Available Formats:
Hardcover ISBN:  978-0-8218-0579-4
Product Code:  DIMACS/29
List Price: $116.00
MAA Member Price: $104.40
AMS Member Price: $92.80
Electronic ISBN:  978-1-4704-3987-3
Product Code:  DIMACS/29.E
List Price: $109.00
MAA Member Price: $98.10
AMS Member Price: $87.20
Bundle Print and Electronic Formats and Save!
This product is available for purchase as a bundle. Purchasing as a bundle enables you to save on the electronic version.
List Price: $174.00
MAA Member Price: $156.60
AMS Member Price: $139.20
  • Book Details
     
     
    DIMACS - Series in Discrete Mathematics and Theoretical Computer Science
    Volume: 291997; 403 pp
    MSC: Primary 68;

    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.

    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
     
     
    • 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
  • Request Review Copy
Volume: 291997; 403 pp
MSC: Primary 68;

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.

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.

  • 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
Please select which format for which you are requesting permissions.