Skip to main content
SpringerLink
Log in
Book cover

Workshop/School/Symposium of the REX Project (Research and Education in Concurrent Systems)

REX 1993: A Decade of Concurrency Reflections and Perspectives pp 46–91Cite as

Process algebra with backtracking

  • Conference paper
  • First Online:

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

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 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. J.A. Bergstra and J.W. Klop. Process algebra for synchronous communication. Information and Computation, 60(1/3):109–137, 1984.

    Google Scholar 

  4. 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. J.C.M. Baeten and W.P. Weijland. Process algebra. Cambridge Tracts in Theoretical Computer Science 18. Cambridge University Press, 1990.

    Google Scholar 

  6. J.W. de Bakker. Mathematical Theory of Program Correctness. Prentice-Hall International, 1980.

    Google Scholar 

  7. I. Bratko. PROLOG programming for artificial intelligence. International Computer Science Series, Addison-Wesley Publishing Company, 1986.

    Google Scholar 

  8. W.F. Clocksin and C.S. Mellish. Programming in Prolog. Springer-Verlag, 1987.

    Google Scholar 

  9. E.W. Dijkstra. A Discipline of Programming. Prentice Hall International, Englewood Cliff, 1976.

    Google Scholar 

  10. A. Eliëns. DLP — A language for Distributed Logic Programming. Wiley, 1992.

    Google Scholar 

  11. L.M.G. Feijs and H.B.M. Jonkers. Formal Specification and Design. Cambridge University Press, 1992.

    Google Scholar 

  12. J.F. Groote and A. Ponse. The syntax and semantics of μCRL. Report CSR9076, CWI, Amsterdam, 1990.

    Google Scholar 

  13. 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. 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. C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall International, Englewood Cliffs, 1985.

    Google Scholar 

  16. 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. H.B.M. Jonkers. Protocold 1.1 User Manual. Technical report RWR-513-hj-91080-hj, Philips Research Laboratories, 1991.

    Google Scholar 

  18. 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. A.S. Klusener. An executable semantics for a subset of COLD. Report CSR 9145, CWI, Amsterdam, 1991.

    Google Scholar 

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

    Google Scholar 

  21. R. Milner. Communication and Concurrency. Prentice-Hall International, Englewood Cliffs, 1989.

    Google Scholar 

  22. J.D. Monk, editor. Handbook of Boolean Algebras, Volume I. North-Holland, 1989.

    Google Scholar 

  23. 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. G.D. Plotkin. A structural approach to operational semantics. Report DAIMI FN-19, Computer Science Department, Aarhus University, 1981.

    Google Scholar 

  25. 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 

Download references

Author information

Authors and Affiliations

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

    J. A. Bergstra

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

    J. A. Bergstra, A. Ponse & J. J. van Wamel

Authors
  1. J. A. Bergstra
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. Ponse
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. J. J. van Wamel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. W. de Bakker W. -P. de Roever G. Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bergstra, J.A., Ponse, A., van Wamel, J.J. (1994). Process algebra with backtracking. In: de Bakker, J.W., de Roever, W.P., Rozenberg, G. (eds) A Decade of Concurrency Reflections and Perspectives. REX 1993. Lecture Notes in Computer Science, vol 803. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58043-3_17

Download citation

  • DOI: https://doi.org/10.1007/3-540-58043-3_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-48423-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation