This note will be permanently deleted and cannot be recovered. Are you sure?
Are you sure you wish to share this note?
Sorry, you can only share notes on selected books with the reading experience feature.
Please choose the Show Notes option before creating a new note.
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
Book DOI: http://dx.doi.org/10.1017/CBO9780511608841
Subjects: Programming Languages and Applied Logic , Distributed, Networked and Mobile Computing
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:
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
No references available.