Handbook of Process Algebra by J.A. BergstraHandbook of Process Algebra by J.A. Bergstra

Handbook of Process Algebra

byJ.A. Bergstra, J.a. Bergstra, A. Ponse...EditorA. Ponse

Other | March 16, 2001

Pricing and Purchase Info

$300.79 online 
$376.00 list price save 20%
Earn 1,504 plum® points

Prices and offers may vary in store


In stock online

Ships free on orders over $25

Not available in stores


Process Algebra is a formal description technique for complex computer systems, especially those involving communicating, concurrently executing components. It is a subject that concurrently touches many topic areas of computer science and discrete math, including system design notations, logic, concurrency theory, specification and verification, operational semantics, algorithms, complexity theory, and, of course, algebra.
This Handbook documents the fate of process algebra since its inception in the late 1970's to the present. It is intended to serve as a reference source for researchers, students, and system designers and engineers interested in either the theory of process algebra or in learning what process algebra brings to the table as a formal system description and verification technique. The Handbook is divided into six parts spanning a total of 19 self-contained Chapters.
The organization is as follows. Part 1, consisting of four chapters, covers a broad swath of the basic theory of process algebra. Part 2 contains two chapters devoted to the sub-specialization of process algebra known as finite-state processes, while the three chapters of Part 3 look at infinite-state processes, value-passing processes and mobile processes in particular. Part 4, also three chapters in length, explores several extensions to process algebra including real-time, probability and priority. The four chapters of Part 5 examine non-interleaving process algebras, while Part 6's three chapters address process-algebra tools and applications.

Title:Handbook of Process AlgebraFormat:OtherDimensions:1356 pages, 1 × 1 × 1 inPublished:March 16, 2001Publisher:Elsevier ScienceLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:0080533671

ISBN - 13:9780080533674


Table of Contents

Preface (Bergstra, Ponse, Smolka).Part 1: Basic Theory.The linear time - brancing time spectrum I (Van Glabbeek). Trace-oriented models of concurrency (Broy, Olderog). Structural operational semantics (Aceto, Fokkink, Verhoef). Modal logics and mu-calculi: an intorduction (Bradfield, Stirling).Part 2: Finite-State Processes.Process algebra with recursive operations (Bergstra, Fokkink, Ponse). Equivalence and preorder checking for finite-state systems (Cleaveland, Sokolsky).Part 3: Infinite-State Processes.A symbolic approach to value-passing processes (Ingolfsdottir, Lin). An introduction to the pi-calculus (Parrow). Verification on infinite structures (Bukart, Caucal, Moller, Steffen).Part 4: Extensions.Process algebra with timing: real time and discrete time (Baeten, Middelburg). Probabilistic extensions of process algebras (Jonsson, Larsen, Yi). Priority in process algebra (Cleaveland, Luettgen, Natarajan).Part 5: Non-Interleaving Process Algebra.Partial-order process algebra (Baeten, Basten). A unified model for nets and process algebras (Best, Devillers, Koutny). Process algebras with localities (Castellani). Action refinement (Gorrieri, Rensink).Part 6: Tools and Applications.Algebraic process vertification (Groote, Reniers). Discrete time process algebra and the semantics of SDL (Bergstra, Middelburg, Usenko). A process algebra for Interworkings (Mauw, Reniers).