Skip to main content
SpringerLink
Log in

An algebraic specification of process algebra, including two examples

  • Part IV An Algebraic Approach To Concurrency
  • Conference paper
  • First Online:
Algebraic Methods: Theory, Tools and Applications (Algebraic Methods 1987)

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

Included in the following conference series:

Abstract

A study is made of the possibilities to describe process algebra as an algebraic specification. Two examples from the field of the specification of communication protocols are discussed to analyse the adequacy of this approach in practical situations.

Note: This work was sponsored in part by ESPRIT contract nr. 432, Meteor.

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, Procesalgebra, [in Dutch], Kluwer, 1986.

    Google Scholar 

  2. J.C.M. Baeten, J.A. Bergstra & J.W. Klop, Conditional axioms and α/β calculus in process algebra, Proc. IFIP Conf. on Formal Description of Programming Concepts — III, Ebberup 1986, (M. Wirsing, ed.), North-Holland Amsterdam, pp.53–75, 1987.

    Google Scholar 

  3. J.C.M. Baeten, J.A. Bergstra & J.W. Klop, On the consistency of Koomen's Fair Abstraction Rule, Report CS-R8504, Centre for Math. and Comp. Sci., Amsterdam 1985, to appear in TCS 51 (1/2), 1987.

    Google Scholar 

  4. J.C.M. Baeten, J.A. Bergstra & J.W. Klop, Syntax and defining equations for an interrupt mechanism in process algebra, Fund. Inf. IX (2), pp. 127–168, 1986.

    Google Scholar 

  5. J.A. Bergstra, Put and get, primitives for synchronous unreliable message passing, CIF report LGPS 3, State University of Utrecht, 1985.

    Google Scholar 

  6. J.A. Bergstra, J. Heering & P. Klint, Algebraic definition of a simple programming language, Report CS-R8504, Centre for Math. and Comp. Sci., Amsterdam 1985.

    Google Scholar 

  7. J.A. Bergstra, J. Heering & P. Klint, ASF — An algebraic specification formalism, report CS-R8705, Centre for Math. and Comp. Sci., Amsterdam 1987.

    Google Scholar 

  8. J.A. Bergstra & J.W. Klop, Algebra of communicating processes, Proc. CWI Symp. Math. & Comp. Sci. (J.W. de Bakker, M. Hazewinkel & J.K. Lenstra, eds.), pp. 89–138, North-Holland, 1986.

    Google Scholar 

  9. J.A. Bergstra & J.W. Klop, Algebra of communicating processes with abstraction, TCS 37 (1), pp. 77–121, 1985.

    Article  Google Scholar 

  10. J.A. Bergstra & J.W. Klop, Conditional Rewrite Rules: Confluence and Termination, JCSS 32, pp. 323–362, 1986.

    Google Scholar 

  11. J.A. Bergstra & J.W. Klop, Process algebra for synchronous communication, Inf. & Control 60 (1/3), pp. 109–137, 1984.

    Google Scholar 

  12. E. Brinksma (ed.), LOTOS, A Formal Description Technique Based on the Temporal Ordering of Observational Behaviour, ISO DIS 8807, 1987.

    Google Scholar 

  13. H. Ehrig, W. Fey & H. Hansen, ACT ONE, an algebraic specification language with two levels of semantics, TU Berlin, FB 20, Techn. Report 83-03, 1983.

    Google Scholar 

  14. H. Ehrig & B. Mahr, Fundamentals of Algebraic Specification 1, Springer verlag, 1985.

    Google Scholar 

  15. L.M.G. Feijs, H.B.M. Jonkers, C.P.J. Koymans & G.R. Renardel de Lavalette, Formal definition of the design language COLD-K, Technical Report, ESPRIT project 432, Doc.Nr. METEOR/t7/PRLE/7, 1987.

    Google Scholar 

  16. J.V. Guttag & J.J. Horning, The algebraic specification of abstract datatypes, Acta Informatica 10, pp. 27–52, 1978.

    Article  Google Scholar 

  17. C.A.R. Hoare, Communicating sequential processes, Prentice Hall International, 1985.

    Google Scholar 

  18. H.B.M. Jonkers, A concrete syntax for COLD-K, Philips Research Laboratories Eindhoven, 1988.

    Google Scholar 

  19. R. Milner, A calculus of communicating systems, Springer LNCS 92, 1980.

    Google Scholar 

  20. W. Reisig, Petrinetze, Springer-Verlag, 1982.

    Google Scholar 

  21. A.S. Tanenbaum, Computer Networks, Prentice Hall, 1981.

    Google Scholar 

  22. F.W. Vaandrager, Verification of two communication protocols by means of process algebra, Report CS-R8608, Centre for Math. and Comp. Sci., Amsterdam 1986.

    Google Scholar 

  23. H.R. Walters, An annotated algebraic specification of the static semantics of POOL, FVI report 86-20, University of Amsterdam, 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Programming Research Group, University of Amsterdam, P.O. Box 41882, 1009 DB, Amsterdam, The Netherlands

    S. Mauw

Authors
  1. S. Mauw
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Martin Wirsing Jan A. Bergstra

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mauw, S. (1989). An algebraic specification of process algebra, including two examples. In: Wirsing, M., Bergstra, J.A. (eds) Algebraic Methods: Theory, Tools and Applications. Algebraic Methods 1987. Lecture Notes in Computer Science, vol 394. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0015050

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51698-9

  • Online ISBN: 978-3-540-46758-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation