Hardcover ISBN:  9780821805794 
Product Code:  DIMACS/29 
List Price:  $116.00 
MAA Member Price:  $104.40 
AMS Member Price:  $92.80 
Electronic ISBN:  9781470439873 
Product Code:  DIMACS/29.E 
List Price:  $109.00 
MAA Member Price:  $98.10 
AMS Member Price:  $87.20 

Book DetailsDIMACS  Series in Discrete Mathematics and Theoretical Computer ScienceVolume: 29; 1997; 403 ppMSC: 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, modelchecking, 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 email debate that took place about the importance of the partial order dichotomy in modeling concurrency.ReadershipGraduate 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 firstorder 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 multiarcs

On the costs and benefits of using partialorder 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


RequestsReview Copy – for reviewers who would like to review an AMS bookAccessibility – to request an alternate format of an AMS title
 Book Details
 Table of Contents
 Requests
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, modelchecking, 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 email debate that took place about the importance of the partial order dichotomy in modeling concurrency.
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 firstorder 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 multiarcs

On the costs and benefits of using partialorder 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