Skip to main content
SpringerLink
Log in

Graph Transformation with Time: Causality and Logical Clocks

  • Conference paper
  • First Online:
Graph Transformation (ICGT 2002)

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

Included in the following conference series:

Abstract

Following TER nets, an approach to the modelling of time in high-level Petri nets, we propose a model of time within (attributed) graph transformation systems where logical clocks are represented as distinguished node attributes. Corresponding axioms for the time model in TER nets are generalised to graph transformation systems and semantic variations are discussed. They are summarised by a general theorem ensuring the consistency of temporal order and casual dependencies.

The resulting notions of typed graph transformation with time specialise the algebraic double-pushout (DPO) approach to typed graph transformation. In particular, the concurrency theory of the DPO approach can be used in the transfer of the basic theory of TER nets.

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. P. Baldan. Modelling Concurrent Computations: from Contextual Petri Nets to Graph Grammars. PhD thesis, Dipartimento di Informatica, Universitá di Pisa, 2000.

    Google Scholar 

  2. P. Baldan, A. Corradini, H. Ehrig, M. Löwe, U. Montanari, and F. Rossi. Concurrent semantics of algebraic graph transformation. In H. Ehrig, H.-J. Kreowski, U. Montanari, and G. Rozenberg, editors, Handbook of Graph Grammars and Computing by Graph Transformation, Volume 3: Concurrency and Distribution, pages 107–188. World Scientific, 1999.

    Google Scholar 

  3. L. Baresi, M. Pezzé, and G. Taentzer, editors. Proc. ICALP 2001 Workshop on Graph Transformation and Visual Modeling Techniques, Heraklion, Greece, Electronic Notes in TCS. Elsevier Science, July 2001.

    Google Scholar 

  4. A. Corradini and R. Heckel, editors. Proc. ICALP 2000 Workshop on Graph Transformation and Visual Modeling Techniques, Geneva, Switzerland, July 2000. Carleton Scientific. http://www.di.unipi.it/GT-VMT/.

  5. A. Corradini and U. Montanari. Specification of Concurrent Systems: from Petri Nets to Graph Grammars. In Quality of Communication-Based Systems, pages 35–52. Kluwer Academic Publishers, 1995.

    Google Scholar 

  6. A. Corradini, U. Montanari, and F. Rossi. Graph processes. Fundamenta Informaticae, 26(3,4):241–266, 1996.

    MATH  MathSciNet  Google Scholar 

  7. G. Engels, J.H. Hausmann, R. Heckel, and St. Sauer. Dynamic meta modeling: A graphical approach to the operational semantics of behavioral diagrams in UML. In A. Evans, S. Kent, and B. Selic, editors, Proc. UML 2000, York, UK, volume 1939 of LNCS, pages 323–337. Springer-Verlag, 2000.

    Google Scholar 

  8. H. Ehrig, J. Padberg, and L. Ribeiro. Algebraic high-level nets: Petri nets revisited. In Recent Trends in Data Type Specification, pages 188–206, Caldes de Malavella, Spain, 1994. Springer Verlag. Lecture Notes in Computer Science 785.

    Google Scholar 

  9. H. Ehrig, M. Pfender, and H.J. Schneider. Graph grammars: an algebraic approach. In 14th Annual IEEE Symposium on Switching and Automata Theory, pages 167–180. IEEE, 1973.

    Google Scholar 

  10. S. Gyapay and R. Heckel. Towards graph transformation with time. In Proc. ET APS’02 Workshop on Application of Graph Transformation, Grenoble, France, 2002.

    Google Scholar 

  11. C. Ghezzi, D. Mandrioli, S. Morasca, and Pezzè. A unified high-level petri net formalism for time-critical systems. IEEE Transactions on Software Engineering, 17(2):160–172, 1991.

    Article  Google Scholar 

  12. J.H. Hausmann, R. Heckel, and S. Sauer. Towards dynamic meta modeling of UML extensions: An extensible semantics for UML sequence diagrams. In M. Minas and A. Schürr, editors, Symposium on Visual Languages and Formal Methods, IEEE Symposia on Human Computer Interaction (HCI 2001), Stresa, Italy, Los Alamitos, CA, September 2001. IEEE Computer Society Press.

    Google Scholar 

  13. C. E. Hrischuk. A Model Making Automation Process (MMAP) using a graph grammar formalism. In Theory and Application of Graph Transformations, 6th International Workshop, TAGT’98, Paderborn, Germany, Selected Papers, volume 1764 of LNCS, pages 442–454. Springer-Verlag, 2000.

    Google Scholar 

  14. H.-J. Kreowski. Manipulation von Graphmanipulationen. PhD thesis, Technical University of Berlin, Dep. of Comp. Sci., 1977.

    Google Scholar 

  15. S. Kuske. A formal semantics of UML state machines based on structured graph transformation. In M. Gogolla and C. Kobryn, editors, Proc. UML 2001, Toronto, Kanada, volume 2185 of LNCS, pages 241–256. Springer-Verlag, 2001.

    Google Scholar 

  16. L. Lamport. Time, clocks, and the ordering of events in a distributed system. Communications of the ACM, 21(7), July 1978.

    Google Scholar 

  17. M. Löwe, M. Korff, and A. Wagner. An algebraic framework for the transformation of attributed graphs. In M. R. Sleep, M. J. Plasmeijer, and M.C. van Eekelen, editors, Term Graph Rewriting: Theory and Practice, chapter 14, pages 185–199. John Wiley & Sons Ltd, 1993.

    Google Scholar 

  18. L. Ribeiro. Parallel Composition and Unfolding Semantics of Graph Grammars. PhD thesis, TU Berlin, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Measurement and Information Systems, Budapest University of Technology and Economics, H-1521, Budapest, Hungary

    Szilvia Gyapay & Dániel Varró

  2. Dept. of Math. and Comp. Science, University of Paderborn, D-33095, Paderborn, Germany

    Reiko Heckel

Authors
  1. Szilvia Gyapay
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Reiko Heckel
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Dániel Varró
    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

Gyapay, S., Heckel, R., Varró, D. (2002). Graph Transformation with Time: Causality and Logical Clocks. 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_11

Download citation

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

  • 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