Title:
Applications of process algebra
Series:
Cambridge tracts in theoretical computer science ; 17
Publication Information:
Cambridge : Cambridge University Press, 2004
ISBN:
9780521607506
Added Author:
Available:*
Library | Item Barcode | Call Number | Material Type | Item Category 1 | Status |
---|---|---|---|---|---|
Searching... | 30000010170644 | QA267 A66 2004 | Open Access Book | Book | Searching... |
On Order
Summary
Summary
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.
Table of Contents
1 An introduction to process algebraJ. 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-architecturesS. Maauw |
5 A process creation mechanism in process algebraJ. A. Bergstra |
6 Correctness proofs for systolic algorithms: palindromes and sortingL. Kossen and W. P. Weijland |
7 Verification of an algorithm for log-time sorting by square comparisonJ. C. Mulder and W. P. Weijland |
8 On the Amoeba protocolJ. C. Mulder |
9 Process algebra semantics of PoplF. W. Vaandrager |
10 Some observations of redundancy in a contextF. W. Vaandrager |
11 A modular approach to protocol verification using process algebraC. P. J. Koymans and J. C. Mulder |