Applications of Process Algebra
Published on 20. September 1990
Book
Hardback
326 pages
978-0-521-40028-2 (ISBN)
Description
This book gives applications of the theory of process algebra, or Algebra of Communicating Processes (ACP), that is the study of concurrent or communicating processes studied using an algebraic framework. The approach is axiomatic; the authors consider structures that are some set of mostly equational axioms, which are equipped with several operators. Thus the term 'algebra' is used in the model-theoretic sense. The axiomatic approach enables one to organize the field of process theories. The theory is applied systematically to a number of situations, including systolic algorithms, semantics of an object-oriented language, and protocols. It will be welcomed by computer scientists working in parallel programming.
Reviews / Votes
'A useful and interesting addition to a computer science library.' International Mathematical NewsMore details
Series
Language
English
Place of publication
Cambridge
United Kingdom
Target group
Professional and scholarly
Illustrations
30 Tables, unspecified; 50 Line drawings, unspecified
Dimensions
Height: 255 mm
Width: 178 mm
Thickness: 21 mm
Weight
742 gr
ISBN-13
978-0-521-40028-2 (9780521400282)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
New editions
J. C. M. Baeten
Applications of Process Algebra
Book
02/2005
Cambridge University Press
€122.20
Shipment within 15-20 days
Additional editions
J. C. M. Baeten
Applications of Process Algebra
Book
02/2005
Cambridge University Press
€122.20
Shipment within 15-20 days
Content
1. An introduction to process algebra J. A. Bergstra and J. W. Klop; 2. Two simple protocols F. W. Vaandrager; 3. Proving mutual exclusion with process algebra E. R. Nieuwland; 4. Process algebra as a tool for the specification and verification of CIM-architectures S. Maauw; 5. A process creation mechanism in process algebra J. A. Bergstra; 6. Correctness proofs for systolic algorithms: palindromes and sorting L. Kossen and W. P. Weijland; 7. Verification of an algorithm for log-time sorting by square comparison J. C. Mulder and W. P. Weijland; 8. On the Amoeba protocol J. C. Mulder; 9. Process algebra semantics of Popl F. W. Vaandrager; 10. Some observations of redundancy in a context F. W. Vaandrager; 11. A modular approach to protocol verification using process algebra C. P. J. Koymans and J. C. Mulder.