Skip to main content
SpringerLink
Log in

Experiments on processes with backtracking

  • Selected Presentations
  • Conference paper
  • First Online:
CONCUR '91 (CONCUR 1991)

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

Included in the following conference series:

  • 128 Accesses

Abstract

We investigate trace-, ready-, failure-based equivalences of processes when the user is provided with a special undo-button allowing to take back steps. Such undo-buttons were first suggested in [vG90]. This gives rise to new semantic equivalences and to new characterizations of old ones. We investigate congruence properties and full abstraction problems for a CCS-like process algebra.

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. S. Abramsky. Observation equivalence as a testing equivalence. Theoretical Computer Science, 53:225–241, 1987.

    Google Scholar 

  2. J. C. M. Baeten, J. A. Bergstra, and J. W. Klop. Ready Trace Semantics for Concrete Process Algebra with Priority Operator. Research Report CS-R8517, CWI, 1985.

    Google Scholar 

  3. B. Bloom, S. Istrail, and A. R. Meyer. Bisimulation can't be traced: preliminary report. In Proc. 15th ACM Symp. Principles of Programming Languages, San Diego, CA, pages 229–239, January 1988.

    Google Scholar 

  4. J. A. Bergstra and J. W. Klop. Algebra of communicating processes. In J. W. de Bakker et al., editor, CWI Monographs I, Proc. CWI Symp. Math. and Comp. Sci., pages 89–138, North-Holland, 1986.

    Google Scholar 

  5. J. A. Bergstra, J. W. Klop, and E.-R. Olderog. Readies and failures in the algebra of communicating processes. SIAM Journal on Computing, 17(6):1134–1177, December 1988.

    Google Scholar 

  6. B. Bloom. Partial Traces and the Semantics and Logic of CCS-Like languages. Tech. Report 89-1066, Cornell University, Ithaca, NY, December 1989.

    Google Scholar 

  7. B. Bloom. Ready Simulation, Bisimulation, and the Semantics of CCS-Like Languages. PhD thesis, MIT, September 1989.

    Google Scholar 

  8. R. De Nicola and F. Vaandrager. Three logics for branching bisimulation (extended abstract). In Proc. 5th IEEE Symp. Logic in Computer Science, Philadelphia, PA, pages 118–129, June 1990.

    Google Scholar 

  9. J. F. Groote. Transition system specifications with negative premisses. In Proc. CONCUR'90, Amsterdam, LNCS 458, pages 332–341, Springer-Verlag, August 1990.

    Google Scholar 

  10. J. F. Groote and F. W. Vaandrager. Structured Operational Semantics and Bisimulation as a Congruence. Research Report CS-R8845, CWI, November 1988.

    Google Scholar 

  11. M. Hennessy and R. Milner. On observing nondeterminism and concurrency. In Proc. 7th ICALP, Noordwijkerhout, LNCS 85, pages 299–309, Springer-Verlag, July 1980.

    Google Scholar 

  12. M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. Journal of the ACM, 32(1):137–161, January 1985.

    Google Scholar 

  13. K. G. Larsen and A. Skou. Bisimulation through probabilistic testing. In Proc. 16th ACM Symp. Principles of Programming Languages, Austin, Texas, pages 344–352, January 1989.

    Google Scholar 

  14. R. Milner. A Calculus of Communicating Systems. LNCS 92, Springer-Verlag, 1980.

    Google Scholar 

  15. R. Milner. A model characterisation of observable machine-behaviour. In Proc. CAAP 81, Genoa, LNCS 112, pages 25–34, Springer-Verlag, March 1981.

    Google Scholar 

  16. R. Milner. Operational and algebraic semantics of concurrent processes. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, vol. B, chapter 19, pages 1201–1242, Elsevier Science Publishers, 1990.

    Google Scholar 

  17. D. Park. Concurrency and automata on infinite sequences. In Proc. 5th GI Conf. on Th. Comp. Sci., LNCS 104, pages 167–183, Springer-Verlag, March 1981.

    Google Scholar 

  18. A. Pnueli. Linear and branching structures in the semantics and logics of reactive systems. In Proc. 12th ICALP, Nafplion, LNCS 194, pages 15–32, Springer-Verlag, July 1985.

    Google Scholar 

  19. Ph. Schnoebelen. Experiments on Processes with Backtracking. Research Report, LIFIAIMAG, Grenoble, June 1991.

    Google Scholar 

  20. R. J. van Glabbeek. The Linear Time — Branching Time Spectrum. Research Report CS-R9029, CWI, July 1990.

    Google Scholar 

  21. R. J. van Glabbeek, S. A. Smolka, B. Steffen, and C. M. N. Tofts. Reactive, generative, and stratified models of probabilistic processes. In Proc. 5th IEEE Symp. Logic in Computer Science, Philadelphia, PA, pages 130–141, June 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIFIA-IMAG, 46 Av. Félix Viallet, 38031, Grenoble Cedex, France

    Ph. Schnoebelen

Authors
  1. Ph. Schnoebelen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jos C. M. Baeten Jan Frisco Groote

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schnoebelen, P. (1991). Experiments on processes with backtracking. In: Baeten, J.C.M., Groote, J.F. (eds) CONCUR '91. CONCUR 1991. Lecture Notes in Computer Science, vol 527. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54430-5_108

Download citation

  • DOI: https://doi.org/10.1007/3-540-54430-5_108

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54430-2

  • Online ISBN: 978-3-540-38357-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation