Skip to main content
Log in

A state-based approach to communicating processes

  • Published:
Distributed Computing Aims and scope Submit manuscript

Abstract

Communicating processes, which may exhibit nondeterministic behaviour, are specified as state-transition systems. Equivalence and refinement relations are defined in terms of the failures model of processes. Downward and upward simulation are considered as proof methods for refinement. Various operators on processes are defined and their refinement rules established.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Baetan JCM, Bergstra JA, Klop JW (1985) Conditional axioms and α/β calculus in process algebra. Report CS-R 8502. Centre for Mathematics and Computer Science, Amsterdam

    Google Scholar 

  • Brookes SD, Hoare CAR, Roscoe AW (1984) A theory of communicating sequential processes. J Assoc Comput Mach 31:560–599

    Google Scholar 

  • Brookes SD, Roscoe AW (1984) An improved failures model for communicating sequential processes. Lect Notes Comp Sci 197:281–305

    Google Scholar 

  • Hayes IJ (1987) Specification case studies. Prentice-Hall International, London

    Google Scholar 

  • He J (1988) Process refinement. Refinement Workshop, University of York

  • He J, Hoare CAR, Sanders JW (1986) Data refinement refined. Lect Notes Comp Sci 213:187–196

    Google Scholar 

  • Hoare CAR (1980) A model for communicating sequential processes. In: McKeag RM, McNaghton AM (eds) On the construction of programs. Cambridge University Press, Cambridge, UK, pp 229–243

    Google Scholar 

  • Hoare CAR (1985) Communicating sequential processes. Prentice-Hall International, London

    Google Scholar 

  • Jones CB (1986) Systematic software development using VDM. Prentice-Hall International, London

    Google Scholar 

  • Milner AJRG (1980) A calculus of communicating systems. Lect Notes Comp Sci 92

  • Milner AJRG (1985) Lectures on a calculus for communicating systems. In: Broy M (ed) Control flow and data flow. Springer, Berlin Heidelberg New York Tokyo

    Google Scholar 

  • Olderog E-R, Hoare CAR (1986) Specification-oriented semantics for communicating processes. Acta Informatica 23:9–66

    Google Scholar 

  • Park D (1981) Concurrency and automata on infinite sequences. Lect Notes Comp Sci 104:167–183

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Mark Josephs joined the Programming Research Group at Oxford University in 1983, upon graduating from London University with a degree in Mathematics. One year later he was awarded the Master's degree in Computation. He received the doctorate in 1986 for his work in functional programming and took up a Visiting Scientist post at IBM Yorktown Heights in their Specification and Design Languages Group. He has now returned to the P.R.G. as a S.E.R.C. Research Officer.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Josephs, M.B. A state-based approach to communicating processes. Distrib Comput 3, 9–18 (1988). https://doi.org/10.1007/BF01788563

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01788563

Key words

Navigation