Handbook of Process Algebra
Handbook of Process Algebra.
Jan A. Bergstra, Alban Ponse, and Scott A. Smolka, Editors.
Elsevier, ISBN: 0-444-82830-3, 2001.
Description
Process Algebra is a formal description technique for complex computer systems, especially those involving communicating, concurrently executing components. It is a subject that 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.
Table of Contents
Preface.
J.A. Bergstra, A. Ponse, S.A. Smolka, pp. v-ix
Part 1: Basic Theory
1. The linear time - branching time spectrum I
R.J. van Glabbeek, pp. 3-99
2. Trace-oriented models of concurrency
M. Broy, E.-R. Olderog, pp. 101-195
3. Structural operational semantics
L. Aceto, W.J. Fokkink, C. Verhoef, pp. 197-292
4. Modal logics and mu-calculi: an introduction
J.C. Bradfield, C. Stirling, pp. 293-330
Part 2: Finite-State Processes
5. Process algebra with recursive operations
J.A. Bergstra, W.J. Fokkink, A. Ponse, pp. 333-389
6. Equivalence and preorder checking for finite-state systems
R. Cleaveland, O. Sokolsky, pp. 391-424
Part 3: Infinite-State Processes
7. A symbolic approach to value-passing processes
A. Ingolfsdottir, H. Lin, pp. 427-478
8. An introduction to the pi-calculus
J. Parrow, pp. 479-543
9. Verification on infinite structures
O. Burkart, D. Caucal, F. Moller, B. Steffen, pp. 545-623
Part 4: Extensions
10. Process algebra with timing: real time and discrete time
J.C.M. Baeten, C.A. Middelburg, pp. 627-684
11. Probabilistic extensions of process algebras
B. Jonsson, K.G. Larsen, Wang Yi, pp. 685-710
12. Priority in process algebra
R. Cleaveland, G. Luettgen, V. Natarajan, pp. 711-765
Part 5: Non-Interleaving Process Algebra
13. Partial-order process algebra (and its relation to Petri nets)
J.C.M. Baeten, T. Basten, pp. 769-872
14. A unified model for nets and process algebras
E. Best, R. Devillers, M. Koutny, pp. 873-944
15. Process algebras with localities
I. Castellani, pp. 945-1045
16. Action refinement
R. Gorrieri, A. Rensink, pp. 1047-1147
Part 6: Tools and Applications
17. Algebraic process verification
J.F. Groote, M.A. Reniers, pp. 1151-1208
18. Discrete time process algebra and the semantics of SDL
J.A. Bergstra, C.A. Middelburg, Y.S. Usenko, pp. 1209-1268
19. A process algebra for Interworkings
S. Mauw, M.A. Reniers, pp. 1269-1327
Author Index, pp. 1329-1342
Further information
http://www.elsevier.com/wps/find/bookdescription.cws_home/621352/description#description
