Summary
A restricted notation is suggested for the description of communicating sequential processes. The notation is defined by algebraic equations, which permit proof of further equations describing relevant properties of the operators. Equations are also used to specify and define the behaviour of particular processes, and to prove that they meet their specifications.
The examples cover a range of simple one-way communications devices between a single sender and a single receiver. A simple theory is used at first; this is extended when its inadequacies become too obvious.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hoare, C.A.R. (1987). Algebraic Specifications and Proofs for Communicating Sequential Processes. In: Broy, M. (eds) Logic of Programming and Calculi of Discrete Design. NATO ASI Series, vol 36. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-87374-4_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-87374-4_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-87376-8
Online ISBN: 978-3-642-87374-4
eBook Packages: Springer Book Archive