Skip to main content
SpringerLink
Log in
Book cover

International Conference on Graph Transformation

ICGT 2002: Graph Transformation pp 14–29Cite as

Approximating the Behaviour of Graph Transformation Systems

  • Conference paper
  • First Online:

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

Abstract

We propose a technique for the analysis of graph transformation systems based on the construction of finite structures approximating the behaviour of such systems with arbitrary accuracy. Following a classical approach, one can construct a chain of finite under-approximations (k-truncations) of the Winskel’s style unfolding of a graph grammar. More interestingly, also a chain of finite over-approximations (k-coverings) of the unfolding can be constructed and both chains converge (in a categorical sense) to the full unfolding. The finite over- and under-approximations can be used to check properties of a graph transformation system, like safety and liveness properties, expressed in (meaningful fragments of) the modal μ-calculus. This is done by embedding our approach in the general framework of abstract interpretation.

Research partially supported by the EC TMR Network GETGRATS, by the IST Project AGILE, and by the MURST project TOSCA.

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. P. Baldan, A. Corradini, and B. König. A static analysis technique for graph transformation systems. In Proc. of CONCUR’ 01, pages 381–395. Springer-Verlag, 2001. LNCS 2154.

    Google Scholar 

  2. P. Baldan, A. Corradini, and B. König. Static analysis of distributed systems with mobility specified by graph grammars—a case study. In Proc. of IDPT’ 02 (World Conference on Integrated Design & Process Technology), 2002. to appear.

    Google Scholar 

  3. P. Baldan, A. Corradini, and U. Montanari. Concatenable graph processes: relating processes and derivation traces. In Proc. of IC ALP’98, volume 1443 of LNCS, pages 283–295. Springer Verlag, 1998.

    Google Scholar 

  4. P. Baldan, A. Corradini, and U. Montanari. Unfolding and Event Structure Semantics for Graph Grammars. In W. Thomas, editor, Proc. of FoSSaCS’ 99, volume 1578 of LNCS, pages 73–89. Springer Verlag, 1999.

    Google Scholar 

  5. A. Corradini, U. Montanari, and F. Rossi. Graph processes. Fundamenta Informaticae, 26:241–265, 1996.

    MATH  MathSciNet  Google Scholar 

  6. B. Courcelle. The expression of graph properties and graph transformations in monadic second-order logic. In G. Rozenberg, editor, Handbook of Graph Grammars and Computing by Graph Transformation, Vol.1: Foundations, chapter 5. World Scientific, 1997.

    Google Scholar 

  7. P. Cousot. Abstract interpretation. ACM Computing Surveys, 28(2), 1996.

    Google Scholar 

  8. N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In Jan van Leeuwen, editor, Formal Models and Semantics, Handbook of Theoretical Computer Science, volume B, pages 243–320. Elsevier, 1990.

    Google Scholar 

  9. H. Ehrig. Introduction to the algebraic theory of graph grammars. In V. Claus, H. Ehrig, and G. Rozenberg, editors, Proc. of the 1st International Workshop on Graph-Grammars and Their Application to Computer Science and Biology, volume 73 of LNCS, pages 1–69. Springer Verlag, 1979.

    Chapter  Google Scholar 

  10. H. Ehrig, H.-J. Kreowski, U. Montanari, and G. Rozenberg, editors. Handbook of Graph Grammars and Computing by Graph Transformation, Vol.3: Concurrency, Parallellism, and Distribution. World Scientific, 1999.

    Google Scholar 

  11. H. Ehrig, J. Kreowski, U. Montanari, and G. Rozenberg, editors. Handbook of Graph Grammars and Computing by Graph Transformation, Vol. 2: Concurrency, Parallelism and Distribution. World Scientific, 1999.

    Google Scholar 

  12. J. Esparza. Model checking using net unfoldings. Science of Computer Programming, 23(2–3):151–195, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  13. J. Esparza. Decidability of model-checking for infinite-state concurrent systems. Acta Informatica, 34:85–107, 1997.

    Article  MathSciNet  Google Scholar 

  14. T. Genet. Decidable approximations of sets of descendants and sets of normal forms. In T. Nipkow, editor, Proc. of 9th International Conference on Rewriting Techniques and Applications, volume 1379 of LNCS, pages 151–165. Springer Verlag, 1998.

    Chapter  Google Scholar 

  15. R.R. Howell, L.E. Rosier, and H.-C. Yen. A taxonomy of fairness and temporal logic problems for Petri nets. Theoretical Computer Science, 82:341–372, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  16. P. Jančar. Decidability of a temporal logic problem for Petri nets. Theoretical Computer Science, 74:71–93, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  17. N.D. Jones and F. Nielson. Abstract interpretation: a semantics-based tool for program analysis. In S. Abramsky, Dov M. Gabbay, and T.S.E. Maibaum, editors, Handbook of Logic in Computer Science, Vol. 4: Semantic Modelling, pages 527–636. Oxford University Press, 1995.

    Google Scholar 

  18. M. Koch. Integration of Graph Transformation and Temporal Logic for the Specification of Distributed Systems. PhD thesis, Technische Universität Berlin, 2000.

    Google Scholar 

  19. B. König. A general framework for types in graph rewriting. In Proc. of FST TCS 2000, volume 1974 of LNCS, pages 373–384. Springer-Verlag, 2000.

    Google Scholar 

  20. C. Loiseaux, S. Graf, J. Sifakis, A. Bouajjani, and S. Bensalem. Property preserving abstractions for the verification of concurrent systems. Formal Methods in System Design, 6:1–35, 1995.

    Article  Google Scholar 

  21. P. Manolios and R.J. Trefler. Safety and liveness in branching time. In Proc. of LICS’ 01, 2001.

    Google Scholar 

  22. K.L. McMillan. Symbolic Model Checking. Kluwer, 1993.

    Google Scholar 

  23. J. Meseguer and U. Montanari. Petri nets are monoids. Information and Computation, 88:105–155, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  24. A. Prasad Sistla. Safety, liveness and fairness in temporal logic. Formal Aspects of Computing, 6(5):495–512, 1994.

    Article  MATH  Google Scholar 

  25. W. Reisig. Petri Nets: An Introduction. EACTS Monographs on Theoretical Computer Science. Springer Verlag, 1985.

    Google Scholar 

  26. L. Ribeiro. Parallel Composition and Unfolding Semantics of Graph Grammars. PhD thesis, Technische Universität Berlin, 1996.

    Google Scholar 

  27. G. Rozenberg, editor. Handbook of Graph Grammars and Computing by Graph Transformation, Vol. 1: Foundations. World Scientific, 1997.

    Google Scholar 

  28. G. Rozenberg, editor. Handbook of Graph Grammars and Computing by Graph Transformation. Volume 1: Foundations. World Scientific, 1997.

    Google Scholar 

  29. V. Sassone. On the Semantics of Petri Nets: Processes, Unfolding and Infinite Computations. PhD thesis, University of Pisa-Department of Computer Science, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Università Ca’ Foscari di Venezia, Italy

    Paolo Baldan

  2. Institut für Informatik, Technische Universität München, Germany

    Barbara König

Authors
  1. Paolo Baldan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Barbara König
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Informatica, Università di Pisa, Corso Italia 40, 56125, Pisa, Italy

    Andrea Corradini

  2. Computer Science Department, Technical University of Berlin, Franklinstraße 28/29, 10587, Berlin, Germany

    Hartmut Ehrig

  3. Computer Science Department, University of Bremen, Bibliothekstraße 1, 28359, Bremen, Germany

    Hans -Jörg Kreowski

  4. Leiden Institute of Advanced Computer Science, Leiden University, Niels Bohrweg 1, 2333, CA Leiden, The Netherlands

    Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Baldan, P., König, B. (2002). Approximating the Behaviour of Graph Transformation Systems. In: Corradini, A., Ehrig, H., Kreowski, H.J., Rozenberg, G. (eds) Graph Transformation. ICGT 2002. Lecture Notes in Computer Science, vol 2505. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45832-8_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-45832-8_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation