Applications of process algebra
By: edited by J.C.M. Baeten.
Contributors: Baeten, J. C. M.
Edition: 1st pbk. ed.
Series: Cambridge tracts in theoretical computer science ;; 17
Publisher: Cambridge University Press
Published: 2004
Place of publication: Cambridge; New York
Language: eng
Number of pages: 317
Subjects: Machine theory.; Parallel processing (Electronic computers); Computer science -- Mathematics.; Computer network protocols.; Axiomatic set theory.
Notes: Includes bibliographical references and indexes.
First published 1990.
Table of contents: title: An introduction to process algebra / J.A. Bergstra, J.W. Klop; title: Two simple protocols / F.W. Vaandrager; title: Proving mutual exclusion with process algebra / E.R. Nieuwland; title: Process algebra as a tool for the specification and verification of CIM-architectures / S. Mauw; title: A process creation mechanism in process algebra / J.A. Bergstra; title: Correctness proofs for systolic algorithms : palindromes and sorting / L. Kossen, W.P. Weijland; title: Verification of an algorithm for log-time sorting by square comparison / J.C. Mulder, W.P. Weijland; title: On the Amoeba protocol / J.C. Mulder; title: Process algebra semantics of POOL ; Some observations on redundancy in a context / F.W. Vaandrager; title: A modular approach to protocol verification using process algebra / C.P.J. Koymans, J.C. Mulder.