Skip to main content
SpringerLink
Log in

Rewriting: An effective model of concurrency

  • Conference paper
  • First Online:
PARLE'94 Parallel Architectures and Languages Europe (PARLE 1994)

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

Abstract

Meseguer has advocated the use of rewriting logic [14] as a general model of concurrency. Since this model is based on rewriting modulo (an equational theory), a direct implementation will face inefficiency or even undecidability problems. However, rewriting was precisely originally studied as a way to implement efficiently equational theories. We show how to combine the rewrite steps corresponding to rewriting logic deductions (non-equationally interpreted) with those implementing the equational theory (equationally interpreted). As an application, we show on a simple example how this may provide a unified semantics for a LOTOS-like language integrating transitions and abstract data types. This result also gives some insight about the semantics of non determinism.

European Communities Science and Technology Fellowship Program in Japan. On leave from CRIN/INRIA-Lorraine.

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. Ilies Alouini. Réécriture concurrente: Etude et implantation. Mémoire de DEA en informatique, Université de Nancy I, September 1993.

    Google Scholar 

  2. T. Bolognesi and E. Brinksma. Introduction to the ISO specification language LO-TOS. In P. H. J. van Eijk, C. A. Vissers, and M. Diaz, editors, The Formal Description Technique LOTOS, pp. 23–73. Elsevier Science Publishers B. V. (North-Holland), 1989.

    Google Scholar 

  3. G. Boudol. Computational semantics of term rewriting systems. In M. Nivat and J. C. Reynolds, editors, Application of Algebra to Language definition and Compilation. Prentice-Hall, 1985. Also INRIA research report 192 (1983).

    Google Scholar 

  4. N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In J. van Leuven, editor, Handbook of Theoretical Computer Science. Elsevier Science Publishers B. V. (North-Holland), 1990.

    Google Scholar 

  5. J. A. Goguen, C. Kirchner, H. Kirchner, A. Mégrelis, J. Meseguer, and T. Winkler. An introduction to OBJ-3. In J.-P. Jouannaud and S. Kaplan, editors, Proceedings 1st International Workshop on Conditional Term Rewriting Systems, Orsay (France), volume 308 of Lecture Notes in Computer Science, pp. 258–263. Springer-Verlag, July 1987.

    Google Scholar 

  6. J. A. Goguen, C. Kirchner, and J. Meseguer. Concurrent term rewriting as a model of computation. In R. Keller and J. Fasel, editors, Proceedings of Graph Reduction Workshop, volume 279 of Lecture Notes in Computer Science, pp. 53–93, Santa Fe (NM, USA), 1987. Springer-Verlag.

    Google Scholar 

  7. G. Huet and J.-J. Lévy. Computations in orthogonal rewriting systems, I. In Jean-Louis Lassez and G. Plotkin, editors, Computational Logic, chapter 11. The MIT Press, 1991.

    Google Scholar 

  8. H. Hussmann. Nondeterministic Algebraic Specifications. PhD thesis, Universität Passau (Germany), September 1988. English literal translation, Nov. 1990.

    Google Scholar 

  9. J.-P. Jouannaud and H. Kirchner. Completion of a set of rules modulo a set of equations. SIAM Journal of Computing, Vol. 15, No. 4, pp. 1155–1194, 1986.

    Article  Google Scholar 

  10. C. Kirchner and H. Kirchner. Rewriting: Theory and Applications. Elsevier Science Publishers B. V. (North-Holland), 1991.

    Google Scholar 

  11. C. Kirchner and P. Viry. Implementing parallel rewriting. In B. Fronhöfer and G. Wrightson, editors, Parallelization in Inference Systems, volume 590 of Lecture Notes in Artificial Intelligence, pp. 123–138. Springer-Verlag, 1992.

    Google Scholar 

  12. C. Laneve and U. Montanari. Axiomatising permutation equivalence in the λ-calculus. In H. Kirchner and G. Levi, editors, Proceedings 3rd International Conference on Algebraic and Logic Programming, Volterra (Italy), volume 632 of Lecture Notes in Computer Science. Springer-Verlag, September 1992.

    Google Scholar 

  13. N. Martí-Oliet and J. Meseguer. Rewriting logic as a logical and semantic framework. Technical Report CSL-93-05, SRI International, 1993.

    Google Scholar 

  14. J. Meseguer. Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science, Vol. 96, pp. 73–155, 1992.

    Article  Google Scholar 

  15. J. Meseguer. A logical theory of concurrent objects and its realization in the maude language. In G. Agha, P. Wegner, and A. Yonezawa, editors, Research Directions in Object-Based Concurrency. MIT Press, 1993.

    Google Scholar 

  16. R. Milner. Communication and concurrency. Prentice-Hall International Series in Computer Science. Prentice-Hall, 1989.

    Google Scholar 

  17. P. Viry. Rewriting: an effective model of concurrency. Internal report 94-R-046, Centre de Recherche en Informatique de Nancy, 1994.

    Google Scholar 

  18. Patrick Viry. La réécriture concurrente. Thèse de Doctorat d'Université, Université de Nancy I, 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. RIMS, Kyoto University, Kitashirakawa, Sakyo-ku, 606-01, Kyoto, Japan

    Patrick Viry

Authors
  1. Patrick Viry
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Costas Halatsis Dimitrios Maritsas George Philokyprou Sergios Theodoridis

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Viry, P. (1994). Rewriting: An effective model of concurrency. In: Halatsis, C., Maritsas, D., Philokyprou, G., Theodoridis, S. (eds) PARLE'94 Parallel Architectures and Languages Europe. PARLE 1994. Lecture Notes in Computer Science, vol 817. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58184-7_138

Download citation

  • DOI: https://doi.org/10.1007/3-540-58184-7_138

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-48477-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation