Edited by J. C. M. Baeten
Publisher: Cambridge University Press
Print Publication Year: 1990
Online Publication Date:December 2009
Online ISBN:9780511608841
Hardback ISBN:9780521400282
Paperback ISBN:9780521607506
Chapter DOI: http://dx.doi.org/10.1017/CBO9780511608841.001
Subjects: Programming Languages and Applied Logic, Distributed, Networked and Mobile Computing
Image View Extract Fullview: Text View | Enlarge Image ‹ Previous Chapter ›Next Chapter
In this book, we give applications of the theory of process algebra, known by the acronym ACP (Algebra of Communicating Processes), as it has been developed since 1982 at the Centre for Mathematics and Computer Science, Amsterdam (see), since 1985 in cooperation with the University of Amsterdam and the University of Utrecht. An important stimulus for this book was given by the ESPRIT contract no. 432, An Integrated Formal Approach to Industrial Software Development (Meteor). The theory itself is treated in, which will be revised, translated and published in this series. The theory is briefly reviewed in the first article in this book, An introduction to process algebra, by J.A. Bergstra and J.W. Klop.
This book gives applications of the theory of process algebra. By the term process algebra we mean the study of concurrent or communicating processes in an algebraic framework. We endeavour to treat communicating processes in an axiomatic way, just as for instance the study of mathematical objects as groups or fields starts with an axiomatization of the intended objects. The axiomatic method which will concern us, is algebraic in the sense that we consider structures which are models of some set of (mostly) equational axioms; these structures are equipped with several operators. Thus we use the term ‘algebra’ in the sense of model theory.
pp. i-iv
pp. v-x
pp. xi-xii
An introduction to process algebra : Read PDF
pp. 1-22
Two simple protocols : Read PDF
pp. 23-44
Proving mutual exclusion with process algebra : Read PDF
pp. 45-52
Process algebra as a tool for the specification and verification of CIM-architectures : Read PDF
pp. 53-80
A process creation mechanism in process algebra : Read PDF
pp. 81-88
Correctness proofs for systolic algorithms: palindromes and sorting : Read PDF
pp. 89-126
Verification of an algorithm for log-time sorting by square comparison : Read PDF
pp. 127-146
On the Amoeba protocol : Read PDF
pp. 147-172
Process algebra semantics of POOL : Read PDF
pp. 173-236
Some observations on redundancy in a context : Read PDF
pp. 237-260
A modular approach to protocol verification using process algebra : Read PDF
pp. 261-306
pp. 307-312
pp. 313-316
Index of symbols and notation : Read PDF
pp. 317-317