Skip to main content
SpringerLink
Log in
Book cover

Algebra of Communicating Processes pp 26–62Cite as

The Syntax and Semantics of μCRL

  • Conference paper

Part of the Workshops in Computing book series (WORKSHOPS COMP.)

Abstract

A simple specification language based on CRL (Common Representation Language)and therefore called μCRL (micro CRL) is proposed. It has been developed to study processes with data. So the language contains only basic constructs with an easy semantics. To obtain executability, effective μCRL has been defined. In effective μCRL equivalence between closed data-terms is decidable and the operational behaviour is finitely branching and computable. This makes effective μCRL a good platform for tooling activities.

Key Words & Phrases

  • Specification Language
  • Abstract Data Types
  • Process Algebra
  • Operational Semantics

This is a preview of subscription content, access via your institution.

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D.J. Andrews, J.F. Groote, and C.A. Middelburg, editors. Proceedings of the International Workshop on Semantics of Specification Languages. Workshops in Computing, Springer-Verlag, 1994.

    Google Scholar 

  2. J.C.M. Baeten and J.A. Bergstra. Process algebra with signals and conditions. In M. Broy, editor, Programming and Mathematical Methods, Proceedings Summer School Marktoberdorf 1991, pages 273–323. Springer-Verlag, 1992. NATO ASI Series F88.

    Google Scholar 

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

    CrossRef  Google Scholar 

  4. J.A. Bergstra and J.W. Klop. Process algebra for synchronous communication. Information and Control, 60(1/3) :109–137, 1984.

    CrossRef  MathSciNet  MATH  Google Scholar 

  5. J.A. Bergstra and J.V. Tucker. A characterisation of computable data types by means of a finite equational specification method. In J.W. de Bakker and J. van Leeuwen, editors, Proceedings 7th ICALP, Noorwijkerhout, volume 85 of Lecture Notes in Computer Science, pages 76–90. Springer-Verlag, July 1980.

    Google Scholar 

  6. J.A. Bergstra and J.V. Tucker. The completeness of the algebraic specification methods for computable data types. Information and Control, 12:186–200, 1982.

    CrossRef  MathSciNet  Google Scholar 

  7. M.A. Bezem and J.F. Groote. Invariants in process algebra with data. Technical Report 98, Logic Group Preprint Series, Utrecht University, 1993. To appear in Proceedings Concur’94, Uppsala.

    Google Scholar 

  8. M.A. Bezem and J.F. Groote. A correctness proof of a one bit sliding window protocol in μCRL. Technical Report 99, Logic Group Preprint Series, Utrecht University, 1993. To appear in the Computer Journal Volume 37(4), 1994.

    Google Scholar 

  9. CCITT Working Party X/1. Recommendation Z.100 (SDL), 1987.

    Google Scholar 

  10. N. Dershowitz. Computing with rewrite systems. Information and Computation, 65:122–157, 1985.

    MathSciNet  MATH  Google Scholar 

  11. H. Ehrig and B. Mahr. Fundamentals of algebraic specifications I, volume 6 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1985.

    Google Scholar 

  12. J.F. Groote. Process Algebra and Structured Operational Semantics. PhD thesis, University of Amsterdam, 1991.

    Google Scholar 

  13. J.F. Groote and H. Korver. A correctness proof of the bakery protocol in μCRL. In this volume: A. Ponse, C Verhoef and S.F.M. van Vlijmen, editors. Proceedings of ACP94- Workshops in Computing, Springer-Verlag, 1994.

    Google Scholar 

  14. J.F. Groote and J.C. van de Pol. A bounded retransmission protocol for large data packets. A case study in computer checked verification. Technical Report 100, Logic Group Preprint Series, Utrecht University, 1993.

    Google Scholar 

  15. J.F. Groote and A. Ponse. The syntax and semantics of μCRL. Report CS-R9076, CWI, Amsterdam, 1990.

    Google Scholar 

  16. J.F. Groote and A. Ponse. Proof theory for μCRL. Report CS-R9138, CWI, 1991.

    Google Scholar 

  17. J.F. Groote and A. Ponse. Proof theory for μCRL: a language for processes with data. In Andrews et al. [1], pages 231–250.

    Google Scholar 

  18. J.F. Groote and J. van Wamel. Algebraic Data Types and Induction in μCRL. Report P9409, University of Amsterdam, Amsterdam, 1994.

    Google Scholar 

  19. J.F. Groote and F.W. Vaandrager. Structured operational semantics and bisimulation as a congruence. Information and Computation, 100(2) :202–260, October 1992.

    CrossRef  MathSciNet  MATH  Google Scholar 

  20. J. Heering, P.R.H. Hendriks, P. Klint, and J. Rekers. The syntax definition formalism SDF - reference manual -. ACM SIGPLAN Notices, 24(11):43–75, 1989.

    CrossRef  Google Scholar 

  21. P.R.H. Hendriks. Implementation of Modular Algebraic Specifications. PhD thesis, University of Amsterdam, 1991. To appear.

    Google Scholar 

  22. C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall International, Englewood Cliffs, 1985.

    MATH  Google Scholar 

  23. C.A.R. Hoare, I.J. Hayes, He Jifeng, C.C. Morgan, A.W. Roscoe, J.W. Sanders, I.H. Sorensen, J.M. Spivey, and B.A. Sufrin. Laws of programming. Communications of the ACM, 30(8):672–686, August 1987.

    CrossRef  MATH  Google Scholar 

  24. G. Huet and D.D. Oppen. Equations and rewrite rules: A survey. In R. Book, editor, Formal Language Theory: Perspectives and Open Problems, pages 349–405. Academic Press, 1980.

    Google Scholar 

  25. ISO. Information processing systems - open systems interconnection - LOTOS - a formal description technique based on the temporal ordering of observational behaviour ISO/TC97/SC21/N DIS8807, 1987.

    Google Scholar 

  26. J.W. Klop. Term rewriting systems. In S. Abramsky, D.M. Gabbay, and T.S.E. Maibaum, eds., Handbook of Logic in Computer Science, Volume 2, pages 2–108. Oxford University Press, 1992.

    Google Scholar 

  27. H. Korver. Private communications, 1991.

    Google Scholar 

  28. H. Korver. Protocol Verification in μCRL. PhD. Thesis, University of Amsterdam, Amsterdam, The Netherlands. 1994.

    Google Scholar 

  29. H. Korver and J. Springintveld. A computer-checked verification of Milner’s scheduler. In M. Hagiya and J.C. Mitchel, editors. Proceedings of the 2 nd International Symposium on Theoretical Aspects of Computer Software, TACS ’94, Sendai, Japan, pages 161–178, volume 789 of Lecture Notes in Computer Science. Springer-Verlag, 1994.

    Google Scholar 

  30. S. Mauw and G.J. Veltink. A process specification formalism. Fundamenta Informaticae, XIII:85–139, 1990.

    Google Scholar 

  31. R. Milner. A Calculus of Communicating Systems, volume 92 of Lecture Notes in Computer Science. Springer-Verlag, 1980.

    MATH  Google Scholar 

  32. M.H.A. Newman. On theories with a combinatorial definition of equivalence. Annals of Mathematics, 43(2):223–243, 1942

    CrossRef  MathSciNet  MATH  Google Scholar 

  33. G.D. Plotkin. An operational semantics for CSP. In D. Bjørner, editor, Proceedings IFIP TC2 Working Conference on Formal Description of Programming Concepts - II, Garmisch, pages 199–225, Amsterdam, 1983. North-Holland.

    Google Scholar 

  34. A. Ponse. Computable processes and bisimulation equivalence. Report CS-R9207, CWI, Amsterdam, January 1992.

    Google Scholar 

  35. M.P.A. Sellink. Verifying process algebra proofs in type theory. In Andrews et al. [1], pages 314–338.

    Google Scholar 

  36. SPECS-semantics. Definition of MR and CRL Version 2.1, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Philosophy, Utrecht University, Heidelberglaan 8, 3584 CS, Utrecht, The Netherlands

    Jan Friso Groote

  2. Programming Research group, University of Amsterdam, Kruislaan 403, 1098 SJ, Amsterdam, The Netherlands

    Alban Ponse

Authors
  1. Jan Friso Groote
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alban Ponse
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Programming Research Group, University of Amsterdam, Kruislaan 403, 1098 SJ, Amsterdam, The Netherlands

    A. Ponse PhD

  2. Department of Mathematics and Computing Science, Eindhoven University of Technology, PO Box 513, 5600 MB, Eindhoven, The Netherlands

    C. Verhoef PhD

  3. Department of Philosophy, Utrecht University, Heidelberglaan 8, 3584 CS, Utrecht, The Netherlands

    S. F. M. van Vlijmen Drs.

Rights and permissions

Reprints and Permissions

Copyright information

© 1995 British Computer Society

About this paper

Cite this paper

Groote, J.F., Ponse, A. (1995). The Syntax and Semantics of μCRL. In: Ponse, A., Verhoef, C., van Vlijmen, S.F.M. (eds) Algebra of Communicating Processes. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-2120-6_2

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-2120-6_2

  • Publisher Name: Springer, London

  • Print ISBN: 978-3-540-19909-0

  • Online ISBN: 978-1-4471-2120-6

  • eBook Packages: Springer Book Archive

Search

Navigation