Process algebra with backtracking

  • J. A. Bergstra
  • A. Ponse
  • J. J. van Wamel
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 803)

Key words & Phrases

process algebra guarded commands backtracking 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BB88]
    J.C.M. Baeten and J.A. Bergstra. Global renaming operators in concrete process algebra. Information and Computation, 78(3):205–245, 1988.Google Scholar
  2. [BB91]
    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, NATO ASI Series F88, pages 273–323. Springer-Verlag, 1991.Google Scholar
  3. [BK84]
    J.A. Bergstra and J.W. Klop. Process algebra for synchronous communication. Information and Computation, 60(1/3):109–137, 1984.Google Scholar
  4. [BV93]
    J.C.M. Baeten and C. Verhoef. A congruence theorem for structured operational semantics with predicates. Report CSN 93/05, Eindhoven University of Technology, 1993.Google Scholar
  5. [BW90]
    J.C.M. Baeten and W.P. Weijland. Process algebra. Cambridge Tracts in Theoretical Computer Science 18. Cambridge University Press, 1990.Google Scholar
  6. [Bak80]
    J.W. de Bakker. Mathematical Theory of Program Correctness. Prentice-Hall International, 1980.Google Scholar
  7. [Bra86]
    I. Bratko. PROLOG programming for artificial intelligence. International Computer Science Series, Addison-Wesley Publishing Company, 1986.Google Scholar
  8. [CM87]
    W.F. Clocksin and C.S. Mellish. Programming in Prolog. Springer-Verlag, 1987.Google Scholar
  9. [Dij76]
    E.W. Dijkstra. A Discipline of Programming. Prentice Hall International, Englewood Cliff, 1976.Google Scholar
  10. [Eli92]
    A. Eliëns. DLP — A language for Distributed Logic Programming. Wiley, 1992.Google Scholar
  11. [FJ92]
    L.M.G. Feijs and H.B.M. Jonkers. Formal Specification and Design. Cambridge University Press, 1992.Google Scholar
  12. [GP90a]
    J.F. Groote and A. Ponse. The syntax and semantics of μCRL. Report CSR9076, CWI, Amsterdam, 1990.Google Scholar
  13. [GP90b]
    J.F. Groote and A. Ponse. Process algebra with guards. Report CS-R9069, CWI, Amsterdam, 1990. To appear in Formal Aspects of Computing.Google Scholar
  14. [GP91]
    J.F. Groote and A. Ponse. μCRL: A base for analysing processes with data. In E. Best and G. Rozenberg, editors, Proceedings 3rd Workshop on Concurrency and Compositionality, Goslar, GMD-Studien Nr. 191, pages 125–130. Universität Hildesheim, 1991.Google Scholar
  15. [Hoa85]
    C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall International, Englewood Cliffs, 1985.Google Scholar
  16. [ISO87]
    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
  17. [Jon91]
    H.B.M. Jonkers. Protocold 1.1 User Manual. Technical report RWR-513-hj-91080-hj, Philips Research Laboratories, 1991.Google Scholar
  18. [Kli82]
    P. Klint. From SPRING to SUMMER. Design, definition and implementation of programming languages for string manipulation and pattern matching. PhD thesis, Technische Hogeschool Eindhoven, 1982.Google Scholar
  19. [Klu91]
    A.S. Klusener. An executable semantics for a subset of COLD. Report CSR 9145, CWI, Amsterdam, 1991.Google Scholar
  20. [MV90]
    S. Mauw and G.J. Veltink. A process specification formalism. Fundamenta Informaticae, XIII:85–139, 1990.Google Scholar
  21. [Mil89]
    R. Milner. Communication and Concurrency. Prentice-Hall International, Englewood Cliffs, 1989.Google Scholar
  22. [Mon89]
    J.D. Monk, editor. Handbook of Boolean Algebras, Volume I. North-Holland, 1989.Google Scholar
  23. [Par81]
    D.M.R. Park. Concurrency and automata on infinite sequences. In P. Deussen, editor, 5th GI Conference, volume 104 of Lecture Notes in Computer Science, pages 167–183. Springer-Verlag, 1981.Google Scholar
  24. [Plo81]
    G.D. Plotkin. A structural approach to operational semantics. Report DAIMI FN-19, Computer Science Department, Aarhus University, 1981.Google Scholar
  25. [VW93]
    S.F.M. van Vlijmen and J.J. van Wamel. A semantic approach to Protocold using process algebra. Report P9317, University of Amsterdam, 1993.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • J. A. Bergstra
    • 1
    • 2
  • A. Ponse
    • 2
  • J. J. van Wamel
    • 2
  1. 1.Department of PhilosophyUtrecht UniversityCS UtrechtThe Netherlands
  2. 2.Programming Research GroupUniversity of AmsterdamSJ AmsterdamThe Netherlands

Personalised recommendations