Distributed Computing

, Volume 3, Issue 1, pp 9–18 | Cite as

A state-based approach to communicating processes

  • Mark B. Josephs


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.

Key words

Communicating processes State-transition systems Refinement Simulation Failures model 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Baetan JCM, Bergstra JA, Klop JW (1985) Conditional axioms and α/β calculus in process algebra. Report CS-R 8502. Centre for Mathematics and Computer Science, AmsterdamGoogle Scholar
  2. Brookes SD, Hoare CAR, Roscoe AW (1984) A theory of communicating sequential processes. J Assoc Comput Mach 31:560–599Google Scholar
  3. Brookes SD, Roscoe AW (1984) An improved failures model for communicating sequential processes. Lect Notes Comp Sci 197:281–305Google Scholar
  4. Hayes IJ (1987) Specification case studies. Prentice-Hall International, LondonGoogle Scholar
  5. He J (1988) Process refinement. Refinement Workshop, University of YorkGoogle Scholar
  6. He J, Hoare CAR, Sanders JW (1986) Data refinement refined. Lect Notes Comp Sci 213:187–196Google Scholar
  7. 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–243Google Scholar
  8. Hoare CAR (1985) Communicating sequential processes. Prentice-Hall International, LondonGoogle Scholar
  9. Jones CB (1986) Systematic software development using VDM. Prentice-Hall International, LondonGoogle Scholar
  10. Milner AJRG (1980) A calculus of communicating systems. Lect Notes Comp Sci 92Google Scholar
  11. Milner AJRG (1985) Lectures on a calculus for communicating systems. In: Broy M (ed) Control flow and data flow. Springer, Berlin Heidelberg New York TokyoGoogle Scholar
  12. Olderog E-R, Hoare CAR (1986) Specification-oriented semantics for communicating processes. Acta Informatica 23:9–66Google Scholar
  13. Park D (1981) Concurrency and automata on infinite sequences. Lect Notes Comp Sci 104:167–183Google Scholar

Copyright information

© Springer-Verlag 1988

Authors and Affiliations

  • Mark B. Josephs
    • 1
  1. 1.IBM Research DivisionYorktown

Personalised recommendations