Skip to main content
SpringerLink
Log in

A Temporal Graph Logic for Verification of Graph Transformation Systems

  • Conference paper
Recent Trends in Algebraic Development Techniques (WADT 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4409))

Included in the following conference series:

Abstract

We extend our approach for verifying properties of graph transformation systems using suitable abstractions. In the original approach properties are specified as formulae of a propositional temporal logic whose atomic predicates are monadic second-order graph formulae. We generalize this aspect by considering more expressive logics, where edge quantifiers and temporal modalities can be interleaved, a feature which allows, e.g., to trace the history of objects in time. This requires the use of graph transition systems, a generalization of transition systems where states and transitions are mapped to graphs and graph morphisms, respectively, and of a corresponding notion of abstraction. After characterizing fragments of the logic which can be safely checked on the approximations, we show how the verification of the logic over graph transformation systems can be reduced to the verification of a logic over suitably defined Petri nets.

Research partially supported by the EU IST-2004-16004 SEnSOria, the MIUR PRIN 2005015824 ART, the DFG project SANDS and CRUI/DAAD Vigoni “Models based on Graph Transformation Systems: Analysis and Verification”.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baldan, P., Corradini, A., König, B.: A static analysis technique for graph transformation systems. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol. 2154, Springer, Heidelberg (2001)

    Google Scholar 

  2. Baldan, P., Corradini, A., König, B.: Verifying finite-state graph grammars: An unfolding-based approach. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 83–98. Springer, Heidelberg (2004)

    Google Scholar 

  3. Baldan, P., Corradini, A., König, B., König, B.: Verifying a behavioural logic for graph transformation systems. In: Proc. of COMETA’03. ENTCS, vol. 104, pp. 5–24. Elsevier, Amsterdam (2004)

    Google Scholar 

  4. Baldan, P., König, B.: Approximating the behaviour of graph transformation systems. In: Corradini, A., Ehrig, H., Kreowski, H.-J., Rozenberg, G. (eds.) ICGT 2002. LNCS, vol. 2505, pp. 14–29. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  5. Baldan, P., König, B., König, B.: A logic for analyzing abstractions of graph transformation systems. In: Cousot, R. (ed.) SAS 2003. LNCS, vol. 2694, pp. 255–272. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  6. Bradfield, J., Stirling, C.: Modal logics and mu-calculi: an introduction. In: Bergstra, J., Ponse, A., Smolka, S. (eds.) Handbook of Process Algebra, Elsevier, Amsterdam (2001)

    Google Scholar 

  7. Corradini, A., Montanari, U., Rossi, F., Ehrig, H., Heckel, R., Löwe, M.: Algebraic Approaches to Graph Transformation I: Basic Concepts and Double Pushout Approach. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformation: Foundations, vol. 1, World Scientific, Singapore (1997)

    Google Scholar 

  8. Courcelle, B.: The expression of graph properties and graph transformations in monadic second-order logic. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformation: Foundations, vol. 1, pp. 313–400. World Scientific, Singapore (1997)

    Google Scholar 

  9. Distefano, D., Katoen, J.-P., Rensink, A.: Who is pointing when to whom? In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004. LNCS, vol. 3328, pp. 250–262. Springer, Heidelberg (2004)

    Google Scholar 

  10. Dotti, F., Foss, L., Ribeiro, L., Santos, O.M.: Verification of distributed object-based systems. In: Najm, E., Nestmann, U., Stevens, P. (eds.) FMOODS 2003. LNCS, vol. 2884, pp. 261–275. Springer, Heidelberg (2003)

    Google Scholar 

  11. Ehrig, H., Heckel, R., Korff, M., Löwe, M., Ribeiro, L., Wagner, A., Corradini, A.: Algebraic Approaches to Graph Transformation II: Single Pushout Approach and Comparison with Double Pushout Approach. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformation: Foundations, vol. 1, World Scientific, Singapore (1997)

    Google Scholar 

  12. Esparza, J., Nielsen, M.: Decidability issues for Petri nets - a survey. Journal of Information Processing and Cybernetic 30(3), 143–160 (1994)

    MATH  Google Scholar 

  13. Franconi, E., Toman, D.: Fixpoint extensions of temporal description logics. In: Proc. of the International Workshop on Description Logics (DL2003), vol. 81 of CEUR Workshop Proceedings (2003)

    Google Scholar 

  14. Gadducci, F., Heckel, R., Koch, M.: A fully abstract model for graph intepreted temporal logic. In: Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.) TAGT 1998. LNCS, vol. 1764, pp. 310–322. Springer, Heidelberg (2000)

    Google Scholar 

  15. Große-Rhode, M.: Algebra transformation systems as a unifying framework. Electronic Notes in Theoretical Computer Science 51 (2001)

    Google Scholar 

  16. Hodkinson, I., Wolter, F., Zakharyaschev, M.: Monadic fragments of first-order temporal logics: 2000-2001 a.d. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol. 2250, pp. 1–23. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  18. König, B., Kozioura, V.: Counterexample-guided abstraction refinement for the analysis of graph transformation systems. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006 and ETAPS 2006. LNCS, vol. 3920, pp. 197–211. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

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

    Article  Google Scholar 

  20. Rensink, A.: Towards model checking graph grammars. In: Proc. of the 3rd Workshop on Automated Verification of Critical Systems, Technical Report DSSE–TR–2003–2, pp. 150–160. University of Southampton (2003)

    Google Scholar 

  21. Rensink, A.: Canonical graph shapes. In: Schmidt, D. (ed.) ESOP 2004. LNCS, vol. 2986, pp. 401–415. Springer, Heidelberg (2004)

    Google Scholar 

  22. Rensink, A.: Model checking quantified computation tree logic. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol. 4137, pp. 110–125. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  23. Rozenberg, G. (ed.): Handbook of Graph Grammars and Computing by Graph Transformation: Foundations, vol. 1. World Scientific, Singapore (1997)

    Google Scholar 

  24. Schmidt, K.: Model-checking with coverability graphs. Formal Methods in System Design 15(3) (1999)

    Google Scholar 

  25. D. Varró. Automated formal verification of visual modeling languages by model checking. Software and System Modeling, 3(2):85–113, 2004.

    Article  Google Scholar 

  26. Yahav, E., Reps, T., Sagiv, M., Wilhelm, R.: Verifying temporal heap properties specified via evolution logic. In: Degano, P. (ed.) ESOP 2003 and ETAPS 2003. LNCS, vol. 2618, pp. 204–222. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Matematica Pura e Applicata, Università di Padova,  

    Paolo Baldan

  2. Dipartimento di Informatica, Università di Pisa,  

    Andrea Corradini & Alberto Lluch Lafuente

  3. Abt. für Informatik und Ang. Kognitionswissenschaft, Universität Duisburg-Essen,  

    Barbara König

Authors
  1. Paolo Baldan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrea Corradini
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Barbara König
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Alberto Lluch Lafuente
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

José Luiz Fiadeiro Pierre-Yves Schobbens

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Baldan, P., Corradini, A., König, B., Lluch Lafuente, A. (2007). A Temporal Graph Logic for Verification of Graph Transformation Systems. In: Fiadeiro, J.L., Schobbens, PY. (eds) Recent Trends in Algebraic Development Techniques. WADT 2006. Lecture Notes in Computer Science, vol 4409. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71998-4_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-71998-4_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-71997-7

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation