Skip to main content
SpringerLink
Log in
Book cover

Recent Trends in Algebraic Development Techniques pp 122–138Cite as

Parallel Admissible Graph Rewriting

  • Conference paper
  • First Online:

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

Abstract

We investigate the rewrite relation over graphs induced by constructor-based weakly orthogonal graph rewriting systems. It is well known that this relation is not confluent in general whereas it is confluent in the case of weakly orthogonal term rewriting systems. We show, however, that the considered relation is always confluent, as well as confluent modulo bisimilarity, for a large class of graphs called admissible graphs. Afterwards, we define a parallel graph rewriting relation and propose an efficient parallel graph rewriting strategy.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Antoy. Definitional trees. In Proc. of ALP’92, pages 143–157. LNCS 632, 1992.

    Google Scholar 

  2. S. Antoy, R. Echahed, and M. Hanus. Parallel evaluation strategies for functional logic languages. In Proc. of ICLP’97, pages 138–152, Portland, 1997. MIT Press.

    Google Scholar 

  3. Z.M. Ariola and J.W. Klop. Equational term graph rewriting. Fundamenta Informaticae, 26(3–4), 1996.

    Google Scholar 

  4. Z.M. Ariola, J.W. Klop, and D. Plump. Confluent rewriting of bisimilar term graphs. Electronic Notes in Theoretical Computer Science, 7, 1997.

    Google Scholar 

  5. H. Barendregt, M. van Eekelen, J. Glauert, R. Kenneway, M. J. Plasmeijer, and M. Sleep. Term graph rewriting. In PARLE’87, pages 141–158. LNCS 259, 1987.

    Google Scholar 

  6. R. Echahed and J. C. Janodet. On constructor-based graph rewriting systems. Technical report, IMAG, 1997. Available via URL: ftp://ftp.imag.fr/pub/LEIBNIZ/ATINF/c-graph-rewriting.ps.gz.

  7. R. Echahed and J. C. Janodet. On weakly orthogonal constructorbased graph rewriting. Technical report, 1998. Available via URL: ftp://ftp.imag.fr/pub/LEIBNIZ/ATINF/wa-c-graph-rewriting.ps.gz.

  8. R. Echahed and J.C. Janodet. Admissible graph rewriting and narrowing. In Proc. of JICSLP’98, pages 325–340. MIT Press, June 1998.

    Google Scholar 

  9. H. Ehrig and G. Taentzer. Computing by graph transformation: A survey and annotated bibliography. Bulletin of the EATCS, 59:182–226, June 1996.

    Google Scholar 

  10. J. R. Kennaway, J. K. Klop, M. R. Sleep, and F. J. De Vries. On the adequacy of graph rewriting for simulating term rewriting. ACM Transactions on Programming Languages and Systems, 16(3):493–523, 1994.

    Article  Google Scholar 

  11. J. R. Kennaway, J. K. Klop, M. R. Sleep, and F. J. De Vries. Transnite reduction in orthogonal term rewriting systems. Information and Computation, 119(1):18–38, 1995.

    Article  MathSciNet  Google Scholar 

  12. M. J. O’Donnell. Computing in Systems Described by Equations. LNCS 58, 1977.

    Book  Google Scholar 

  13. R. Plasmeijer and M. van Eekelen. Functional Programming and Parallel Graph Rewriting. Addison-Wesley, 1993.

    Google Scholar 

  14. D. Plump. Term graph rewriting. In H. Ehrig, G. Engels, H.-J. Kreowski, and G. Rozenberg, editors, Handbook of Graph Grammars and Computing by Graph Transformation, volume 2. World Scientic, to appear.

    Google Scholar 

  15. Grzegorz Rozenberg. Handbook of Graph Grammars and Computing by Graph Transformations, volume 1. World Scientic, 1997.

    Google Scholar 

  16. R. C. Sekar and I. V. Ramakrishnan. Programming in equational logic: Beyond strong sequentiality. Information and Computation, 104(1):78–109, May 1993.

    Article  MathSciNet  Google Scholar 

  17. M. R. Sleep, M. J. Plasmeijer, and M. C. J. D. van Eekelen, editors. Term Graph Rewriting. Theory and Practice. J. Wiley & Sons, Chichester, UK, 1993.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire Leibniz - Institut IMAG, CNRS, 46, Av. Felix Viallet, F-38031, Grenoble, France

    Rachid Echahed & Jean-Christophe Janodet

Authors
  1. Rachid Echahed
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jean-Christophe Janodet
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Informatics, University of Lisbon, Campo Grande 1700, Lisbon, Portugal

    José Luiz Fiadeiro

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Echahed, R., Janodet, JC. (1999). Parallel Admissible Graph Rewriting. In: Fiadeiro, J.L. (eds) Recent Trends in Algebraic Development Techniques. Lecture Notes in Computer Science, vol 1589. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48483-3_9

Download citation

  • DOI: https://doi.org/10.1007/3-540-48483-3_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66246-4

  • Online ISBN: 978-3-540-48483-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation