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.
Handbook of Process Algebra, 1st Edition
Preface (J.A. Bergstra, A. Ponse, S.A. Smolka). Part 1: Basic Theory.
The linear time - brancing time spectrum I (R.J. van Glabbeek). Trace-oriented models of concurrency (M. Broy, E.-R. Olderog). Structural operational semantics (L. Aceto, W.J. Fokkink, C. Verhoef). Modal logics and mu-calculi: an introduction (J.C. Bradfield, C. Stirling). Part 2: Finite-State Processes.
Process algebra with recursive operations (J.A. Bergstra, W.J. Fokkink, A. Ponse). Equivalence and preorder checking for finite-state systems (R. Cleaveland, O. Sokolsky). Part 3: Infinite-State Processes.
A symbolic approach to value-passing processes (A. Ingólfsdóttir, H. Lin). An introduction to the pi-calculus (P. Parrow). Verification on infinite structures (O. Burkart, D. Caucal, F. Moller, B. Steffen). Part 4: Extensions.
Process algebra with timing: real time and discrete time (J.C.M. Baeten, C.A. Middelburg). Probabilistic extensions of process algebras (B. Jonsson, K.G. Larsen, Wang Yi). Priority in process algebra (R. Cleaveland, G. Lüettgen, V. Natarajan). Part 5: Non-Interleaving Process Algebra.
Partial-order process algebra (J.C.M. Baeten, T. Basten). A unified model for nets and process algebras (E. Best, R. Devillers, M. Koutny). Process algebras with localities (I. Castellani). Action refinement (R. Gorrieri, A. Rensink). Part 6: Tools and Applications.
Algebraic process verification (J.F. Groote, M.A. Reniers). Discrete time process algebra and the semantics of SDL (J.A. Bergstra, C.A. Middelburg, Y.S. Usenko). A process algebra for Interworkings (S. Mauw, M.A. Reniers).
Quotes and reviews
@qu:For the computer scientist interested in fundamental theory or in design, the Handbook is a treasure house of insights and information......the editors must be congratulated in having created a major landmark in this exciting area of science....
@source:The Computer Journal