Skip to main content
SpringerLink
Log in

Relating conflict-free stable transition and event models (extended abstract)

  • Contributed Papers
  • Conference paper
  • First Online:
Book cover Mathematical Foundations of Computer Science 1997 (MFCS 1997)

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

Abstract

We describe an event-style (or poset) semantics for conflict-free rewrite systems, such as the Λ-calculus, and other stable transition systems with a residual relation. Our interpretation is based on considering redex families as events. It treats permutation-equivalent reductions as representing the same concurrent computation. Due to erasure of redexes, Event Structures are inadequate for such an interpretation. We therefore extend the Prime Event Structure model by axiomatizing permutation-equivalence on finite configurations in two different ways, for the conflict-free case, and show that these extended models are equivalent to known stable transition models with axiomatized residual and family relations.

Part of this work was supported by the Engineering and Physical Sciences Research Council of Great Britain under grant GR/H 41300

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. Asperti A., Laneve C. Interaction Systems I: The theory of optimal reductions. MSCS 11:1–48, 1993.

    Google Scholar 

  2. Barendregt H. P. The Lambda Calculus, its Syntax and Semantics. 1984.

    Google Scholar 

  3. Boudol G. Computational semantics of term rewriting systems. In: Algebraic methods in semantics. Nivat M., Reynolds J.C., eds. Camb. Univ. Press, 1985, p. 169–236.

    Google Scholar 

  4. Clark D., Kennaway R. Event structures and non-orthogonal term graph rewriting. MSCS 6:545–578, 1996.

    Google Scholar 

  5. Corradini A., Ehrig H., Löwe M., Montanari U., Rossi F. An event structure semantics for safe graph grammars. PROCOMET'94, IFIP Transactions A-56, 1994.

    Google Scholar 

  6. Glauert J.R.W., Khasidashvili Z. Relative normalization in deterministic residual structures. CAAP'96, Springer LNCS, vol. 1059, H. Kirchner, ed. 1996, p. 180–195.

    Google Scholar 

  7. Gonthier G., Lévy J.-J., Melliès P.-A. An abstract Standardisation theorem. In: Proc. of LICS'92, Santa Cruz, California, 1992, p. 72–81.

    Google Scholar 

  8. Hindley R.J. An abstract form of the Church-Rosser theorem. JSL 34(4):545–560, 1969.

    Google Scholar 

  9. Huet G., Lévy J.-J. Computations in Orthogonal Rewriting Systems. In: Computational Logic, Essays in Honor of Alan Robinson, J. L. Lassez and G. Plotkin, eds. MIT Press, p. 394–443, 1991.

    Google Scholar 

  10. Kennaway J. R., Sleep M. R. Neededness is hypernormalizing in regular combinatory reduction systems. Report. University of East Anglia, 1989.

    Google Scholar 

  11. Kennaway J. R., Klop J. W., Sleep M. R, de Vries F.-J. Event structures and orthogonal term graph rewriting. In Sleep M. R., Plasmeijer M. J., van Eekelen M. C. J. D., eds. Term Graph Rewriting: Theory and Practice. John Wiley, p. 141–156, 1993.

    Google Scholar 

  12. Khasidashvili Z., Glauert J. R. W. Discrete normalization and Standardization in Deterministic Residual Structures. ALP'96, Springer LNCS, vol. 1139, M. Hanus, M. Rodríguez-Artalejo, eds. 1996, p.135–149.

    Google Scholar 

  13. Khasidashvili Z., Glauert J.R.W. Zig-zag, extraction and separable families in nonduplicating stable Deterministic Residual Structures. Technical Report IR-420, Free University, Amsterdam, February 1997.

    Google Scholar 

  14. Khasidashvili Z., Glauert J.R.W. An abstract concept of optimal implementation. Report SYS-C97-??, UEA, Norwich, 1997.

    Google Scholar 

  15. Klop J. W. Combinatory Reduction Systems. Mathematical Centre Tracts n. 127, CWI, Amsterdam, 1980.

    Google Scholar 

  16. Laneve C. Distributive evaluations of Λ-calculus, Fundamenta Informaticae, 20(4):333–352, 1994.

    Google Scholar 

  17. Lévy J.-J. Reductions correctes et optimales dans le lambda-calcul, Thèse de l'Université de Paris VII, 1978.

    Google Scholar 

  18. Lévy J.-J. Optimal reductions in the Lambda-calculus. In: To H. B. Curry: Essays on Combinatory Logic, Lambda-calculus and Formalism, Hindley J. R., Seldin J. P. eds, Academic Press, 1980, p. 159–192.

    Google Scholar 

  19. Maranget L. Optimal derivations in weak Λ-calculi and in orthogonal Term Rewriting Systems. In: Proc. of POPL'91, p. 255–269.

    Google Scholar 

  20. Milner R. Communication and concurrency. Prentice Hall, 1989.

    Google Scholar 

  21. Nielsen M., Plotkin G., Winskel G. Petri nets, event structures and domains. Part 1. TCS 13:85–108,1981.

    Article  Google Scholar 

  22. Van Oostrom V. Higher order families. In: Proc. of RTA'96, Springer LNCS, vol. 1103, Ganzinger, H., ed., 1996, p. 392–407.

    Google Scholar 

  23. Sangiorgi D. Expressing mobility in process algebras: first-order and higher-order paradigms. Ph.D. Thesis, Edinburgh University, 1993.

    Google Scholar 

  24. Schied G. On relating rewrite systems and graph grammars to event structures. Springer LNCS, vol. 776, Schneider H.-J. Ehrig H., eds, 1994, p. 326–340.

    Google Scholar 

  25. Stark E. W. Concurrent transition systems. TCS 64(3):221–270, 1989.

    Article  Google Scholar 

  26. Winskel G. Events in Computation. Ph.D. Thesis, University of Edinburgh, 1980.

    Google Scholar 

  27. Winskel G. An introduction to Event Structures. Springer LNCS, vol. 354, 1989, p. 364–397. Full version: Cambr. Univ. Comp. Lab. Report n. 95, 1986.

    Google Scholar 

  28. Winskel G., Nielsen M. Models for concurrency. In: S. Abramsky, D. Gabbay, T. Maibaum eds. Handbook of Logic in Computer Science, vol. 4, Oxford Univ. Press, p. 1–148, 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. NTT Basic Research Laboratories, Atsugi, 243-01, Kanagawa, Japan

    Zurab Khasidashvili

  2. School of Information Systems, UEA, NR4 7TJ, Norwich, England

    John Glauert

Authors
  1. Zurab Khasidashvili
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. John Glauert
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Igor Prívara Peter Ružička

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Khasidashvili, Z., Glauert, J. (1997). Relating conflict-free stable transition and event models (extended abstract). In: Prívara, I., Ružička, P. (eds) Mathematical Foundations of Computer Science 1997. MFCS 1997. Lecture Notes in Computer Science, vol 1295. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029970

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-69547-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation