Some finite-graph models for process algebra | SpringerLink
Skip to main content
Springer Nature Link
Log in

Some finite-graph models for process algebra

  • Selected Presentations
  • Conference paper
  • First Online:
CONCUR '91 (CONCUR 1991)

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

Included in the following conference series:

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J.C.M. Baeten and W.P. Weijland. Process Algebra. Cambridge Tracts in Theoretical Computer Science 18. Cambridge University Press, 1990.

    Google Scholar 

  2. J.A. Bergstra and J.W. Klop. Process algebra for synchronous communication. Information and Control, 60:109–137, 1984.

    Google Scholar 

  3. J.A. Bergstra and J.W. Klop. Algebra of communicating processes with abstraction. Theoretical Computer Science, 37:77–121, 1985.

    Google Scholar 

  4. J.A. Bergstra and J.W. Klop. Algebra of communicating processes. In J.W. de Bakker, M. Hazewinkel, and J.K. Lenstra, editors, Mathematics and Computer Science (CWI Monographs 1), pages 89–138. North-Holland, 1986.

    Google Scholar 

  5. R. J. van Glabbeek. Comparative Concurrency Semantics and Refinement of Actions. PhD thesis, Vrije Universiteit/Centrum voor Wiskunde en Informatica, Amsterdam, 1990.

    Google Scholar 

  6. D. Harel. On visual formalisms. Communications of the ACM, 31:514–530, 1988.

    Google Scholar 

  7. R. Milner. A Calculus of Communicating Systems. Springer, 1980. Lecture Notes in Computer Science 92.

    Google Scholar 

  8. R. Milner. Communication and Concurrency. Prentice Hall, 1989.

    Google Scholar 

  9. P.A. Spruit. Two finite-graph models for basic process algebra. Technical report, Department of Mathematics and Computer Science, Vrije Universiteit, Amsterdam, December 1990.

    Google Scholar 

  10. P.A. Spruit. Finite-graph models for Process Algebra with parallel composition. Technical report, Department of Mathematics and Computer Science, Vrije Universiteit, Amsterdam, In preparation.

    Google Scholar 

  11. P.A. Spruit and C.J.A. Duivenvoorde. A syntax-and semantics-directed editor for conceptual model specifications. Technical report, Department of Mathematics and Computer Science, Vrije Universiteit, Amsterdam, April 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, Vrije Universiteit, De Boelelaan 1081a, 1081 HV, Amsterdam, The Netherlands

    Paul Spruit & Roel Wieringa

Authors
  1. Paul Spruit
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Roel Wieringa
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jos C. M. Baeten Jan Frisco Groote

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Spruit, P., Wieringa, R. (1991). Some finite-graph models for process algebra. In: Baeten, J.C.M., Groote, J.F. (eds) CONCUR '91. CONCUR 1991. Lecture Notes in Computer Science, vol 527. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54430-5_109

Download citation

  • DOI: https://doi.org/10.1007/3-540-54430-5_109

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-38357-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation