Nothing Special   »   [go: up one dir, main page]

Skip to main content

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

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1984)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 172))

Included in the following conference series:

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.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  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. 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. BERGSTRA, J.A. & J.W. KLOP, Process algebra for communication and mutual exclusion, Report IW 218/83, Mathematisch Centrum, Amsterdam 1983.

    Google Scholar 

  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. 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. HENNESSY, M., A term model for synchronous processes, Information and Control, Vol.51, No.1(1981), p.58–75.

    Google Scholar 

  7. HOARE, C.A.R., Communicating Sequential Processes, C.ACM 21 (1978), 666–677.

    Google Scholar 

  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. MILNER, R., A Calculus for Communicating Systems, Springer LNCS 92, 1980.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Jan Paredaens

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bergstra, J.A., Klop, J.W. (1984). The algebra of recursively defined processes and the algebra of regular processes. In: Paredaens, J. (eds) Automata, Languages and Programming. ICALP 1984. Lecture Notes in Computer Science, vol 172. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-13345-3_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-13345-3_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13345-2

  • Online ISBN: 978-3-540-38886-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics