Skip to main content
SpringerLink
Log in

Process algebra with combinators

  • Conference paper
  • First Online:
Computer Science Logic (CSL 1993)

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

Included in the following conference series:

Abstract

We introduce typed combinatory process algebra, a system combining process algebra with types and combinators. We describe its syntax and semantics, and by way of example, verify within this frame-work the Simple Alternating Bit Protocol.

The first author acknowledges the support of ESPRIT Basic Research Action CON-FER no. 6454.

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. T. Bolognesi and E. Brinksma. Introduction to the ISO Specification Language LOTOS. Computer Networks and ISDN Systems,14:25–29. Elsevier Science Publishers, 1987.

    Google Scholar 

  2. J.C.M. Baeten and J.A. Bergstra. Global renaming operators in concrete process algebra. Information and Computation, 78(3):205–245, 1988.

    Article  MathSciNet  Google Scholar 

  3. J. A. Bergstra, I. Bethke and A. Ponse. Process algebra with nesting and iteration. Report P9314a (revised version of Report P9314), Programming Research Group, University of Amsterdam, 1994. To appear in The Computer Journal.

    Google Scholar 

  4. M. Bezem and J. F. Groote. A formal verification of the Alternating Bit Protocol in the Calculus of Constructions. Logic Group Preprint Series, no. 88, Department of Philosophy, University of Utrecht, 1993.

    Google Scholar 

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

    MathSciNet  Google Scholar 

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

    MathSciNet  Google Scholar 

  7. J.A. Bergstra and J.W. Klop. Verification of an alternating bit protocol by means of process algebra. In W. Bibel and K.P. Jantke, editors, Math. Methods of Spec. and Synthesis of Software Systems '85, Math, Research 31, pages 9–23, Berlin, 1986. Akademie-Verlag.

    Google Scholar 

  8. J.A. Bergstra, J.W. Klop, and E.-R. Olderog. Failures without chaos: a new process semantics for fair abstraction. In M. Wirsing, editor, Formal Description of Programming Concepts — III, Proceedings of the 3 th IFIP WG 2.2 working conference, Ebberup 1986, pages 77–103, Amsterdam, 1987. North-Holland.

    Google Scholar 

  9. J.A. Bergstra and J.V. Tucker. Top down design and the algebra of communicating processes. Science of Computer Programming, 5(2):171–199, 1984.

    MathSciNet  Google Scholar 

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

    Google Scholar 

  11. J.C.M. Baeten (ed.). Applications of Process Algebra. Cambridge Tracts in Theoretical Computer Science 17. Cambridge University Press, 1990.

    Google Scholar 

  12. E. Brinksma. On the design of extended LOTOS — a specification language for open distributed systems. Ph.D. thesis, University of Twente, 1988.

    Google Scholar 

  13. H. B. Curry and R. Feys. Combinatory Logic. Volume I. North-Holland, Amsterdam, 1958.

    Google Scholar 

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

    Google Scholar 

  15. J. F. Groote and A. Ponse. Proof theory for μCRL: a language for processes with data. In D.J. Andrews, J.F. Groote and C.A. Middelburg, editors, Proceedings of the International Workshop on Semantics of Specification Languages. Workshops in Computer Science, Springer Verlag, 1994.

    Google Scholar 

  16. R.J. van Glabbeek and F.W. Vaandrager. Modular specifications in Process Algebra. Theoretical Computer Science, 113(2):294–348, 1993.

    Google Scholar 

  17. J. R. Hindley and J. P. Seldin. Introduction to combinators and λ-calculus. London Mathematical Society Student Texts.1, Cambridge University Press, Cambridge, 1986.

    Google Scholar 

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

    Google Scholar 

  19. S. Mauw. A process specification formalism. Ph.D. thesis, University of Amsterdam, 1991.

    Google Scholar 

  20. J. Parrow. Fairness properties in process algebra — with applications in communication protocol verification. Ph.D. thesis, Dept. of Comp. Sci., Uppsala Univ., 1985.

    Google Scholar 

  21. L. E. Sanchis. Functionals defined by recursion. Notre Dame Journal of Formal Logic, VIII(3):161–174, 1967.

    MathSciNet  Google Scholar 

  22. M. Schönfinkel. Über die Bausteine der mathematischen Logik. Mathematische Annalen, 92:305–316, 1924.

    Article  MATH  MathSciNet  Google Scholar 

  23. F. W. Vaandrager. Two simple protocols. In J. C. M. Baeten, editor, Applications of Process Algebra, pages 23–44, Cambridge Tracts in Theoretical Computer Science 17, Cambridge University Press, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Jan A. Bergstra & Alban Ponse

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

    Jan A. Bergstra & Inge Bethke

  3. Department of Software Technology, CWI, Kruislaan 413, 1098, SJ Amsterdam, The Netherlands

    Inge Bethke

Authors
  1. Jan A. Bergstra
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Inge Bethke
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Alban Ponse
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Egon Börger Yuri Gurevich Karl Meinke

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bergstra, J.A., Bethke, I., Ponse, A. (1994). Process algebra with combinators. In: Börger, E., Gurevich, Y., Meinke, K. (eds) Computer Science Logic. CSL 1993. Lecture Notes in Computer Science, vol 832. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0049323

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-48599-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation