Advertisement

The algebra of recursively defined processes and the algebra of regular processes

  • J. A. Bergstra
  • J. W. Klop
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 172)

Abstract

We introduce recursively defined processes and regular processes, both in presence and absence of communication. It is shown that both classes are process algebras. As an example of recursively defined processes, Bag and Stack are discussed in detail. It is shown that Bag cannot be recursively defined without merge. We introduce fixed point algebras which have useful applications in several proofs.

Keywords

Communication Function Process Algebra Denotational Semantic Recursive Definition Fixed Point Equation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    DE BAKKER, J.W. & J.I. ZUCKER, Denotational semantics of concurrency, Proc. 14th ACM Symp. on Theory of Computing, p.153–158 (1982).Google Scholar
  2. [2]
    DE BAKKER, J.W. & J.I. ZUCKER, Processes and the denotational semantics of concurrency, Information and Control, Vol.54, No.1/2, p.70–120, 1982.Google Scholar
  3. [3]
    BERGSTRA, J.A. & J.W. KLOP, Process algebra for communication and mutual exclusion, Report IW 218/83, Mathematisch Centrum, Amsterdam 1983.Google Scholar
  4. [4]
    BERGSTRA, J.A. & J.W. KLOP, The algebra of recursively defined processes and the algebra of regular processes, Report IW 235/83, Mathematisch Centrum, Amsterdam 1983.Google Scholar
  5. [5]
    BERGSTRA, J.A. & J.W. KLOP, Algebra of Communicating Processes, in: Proceedings of the CWI Symposium Mathematics and Computer Science (eds. J.W. de Bakker, M. Hazewinkel and J.K. Lenstra), CWI Monograph Series, North-Holland. To appear.Google Scholar
  6. [6]
    HENNESSY, M., A term model for synchronous processes, Information and Control, Vol.51, No.1(1981), p.58–75.Google Scholar
  7. [7]
    HOARE, C.A.R., Communicating Sequential Processes, C.ACM 21 (1978), 666–677.Google Scholar
  8. [8]
    HOARE, C.A.R., A Model for Communicating Sequential Processes, in: "On the Construction of Programs" (ed. R.M. McKeag and A.M. McNaghton), Cambridge University Press, 1980 (p.229–243).Google Scholar
  9. [9]
    MILNER, R., A Calculus for Communicating Systems, Springer LNCS 92, 1980.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • J. A. Bergstra
    • 1
  • J. W. Klop
    • 1
  1. 1.Centrum voor Wiskunde en InformaticaAMSTERDAM

Personalised recommendations