Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Theory and Application of Graph Transformations

TAGT 1998: Theory and Application of Graph Transformations pp 145–163Cite as

Unfolding of Double-Pushout Graph Grammars is a Coreflection

  • Conference paper

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

Abstract

In a recent paper, mimicking Winskel’s construction for Petri nets, a concurrent semantics for (double-pushout) DPO graph grammars has been provided by showing that each graph grammar can be unfolded into an acyclic branching structure, that is itself a (nondeterministic occurrence) graph grammar describing all the possible computations of the original grammar.

This paper faces the problem of providing a closer correspondence with Winskel’s result by showing that the unfolding construction can be described as a coreflection between the category of graph grammars and the category of occurrence graph grammars. The result is shown to hold for a suitable subclass of graph grammars, called semi-weighted graph grammars. Unfortunately the coreflection does not extend to the whole category of graph grammars: some ideas for solving the problem are suggested.

Research partially supported by MURST project Tecniche Formali per Sistemi Software, by TMR Network GETGRATS and by Esprit WG APPLIGRAPH.

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. Baldan, P., Corradini, A., Montanari, U.: Concatenable graph processes: relating processes and derivation traces. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, pp. 283–295. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  2. Baldan, P., Corradini, A., Montanari, U.: An event structure semantics for P/T contextual nets: Asymmetric event structures. In: Nivat, M. (ed.) FOSSACS 1998. LNCS, vol. 1378, pp. 63–80. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  3. Baldan, P., Corradini, A., Montanari, U.: Unfolding and Event Structure Semantics for Graph Grammars. In: Thomas, W. (ed.) FOSSACS 1999. LNCS, vol. 1578, pp. 73–89. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  4. Banach, R., Corradini, A.: An Opfibration Account of Typed DPO and DPB Graph Transformation: General Productions. Technical Report UMCS-96-11-2, University of Manchester, Department of Computer Science (1996)

    Google Scholar 

  5. Corradini, A.: Concurrent Graph and Term Graph Rewriting. In: Montanari, U., Sassone, V. (eds.) CONCUR 1996. LNCS, vol. 1119, pp. 438–464. Springer, Heidelberg (1996)

    Google Scholar 

  6. Corradini, A., Ehrig, H., Löwe, M., Montanari, U., Padberg, J.: The category of Typed Graph Grammars and its adjunctions with categories of derivations. In: Cuny, J., Ehrig, H., Engels, G., Rozenberg, G. (eds.) Graph Grammars 1994. LNCS, vol. 1073. Springer, Heidelberg (1996)

    Google Scholar 

  7. Corradini, A., Ehrig, H., Löwe, M., Montanari, U., Rossi, F.: An Event Structure Semantics for Graph Grammars with Parallel Productions. In: Cuny, J., Ehrig, H., Engels, G., Rozenberg, G. (eds.) Graph Grammars 1994. LNCS, vol. 1073. Springer, Heidelberg (1996)

    Google Scholar 

  8. Corradini, A., Montanari, U., Rossi, F.: Graph processes. Fundamenta Informaticae 26, 241–265 (1996)

    MATH  MathSciNet  Google Scholar 

  9. 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 

  10. Ehrig, H.: Tutorial introduction to the algebraic approach of graph-grammars. In: Ehrig, H., Nagl, M., Rozenberg, G., Rosenfeld, A. (eds.) Graph Grammars 1986. LNCS, vol. 291, pp. 3–14. Springer, Heidelberg (1987)

    Google Scholar 

  11. Golz, U., Reisig, W.: The non-sequential behaviour of Petri nets. Information and Control 57, 125–147 (1983)

    Article  MathSciNet  Google Scholar 

  12. Heckel, R., Corradini, A., Ehrig, H., Löwe, M.: Horizontal and Vertical Structuring of Graph Transformation Systems. Mathematical Structures in Computer Science 6(6), 613–648 (1996)

    MATH  MathSciNet  Google Scholar 

  13. Langerak, R.: Transformation and Semantics for LOTOS. PhD thesis, Department of Computer Science, University of Twente (1992)

    Google Scholar 

  14. Meseguer, J., Montanari, U., Sassone, V.: On the semantics of Petri nets. In: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol. 630, pp. 286–301. Springer, Heidelberg (1992)

    Chapter  Google Scholar 

  15. Meseguer, J., Montanari, U., Sassone, V.: On the semantics of Place/Transition Petri nets. Mathematical Structures in Computer Science 7, 359–397 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  16. Pinna, G.M., Poigné, A.: On the nature of events: another perspective in concurrency. Theoretical Computer Science 138, 425–454 (1995)

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  18. Winskel, G.: Event Structures. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) APN 1986. LNCS, vol. 255. Springer, Heidelberg (1987)

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Paolo Baldan, Andrea Corradini & Ugo Montanari

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. Ugo Montanari
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Technische Universität Berlin, Germany

    Hartmut Ehrig

  2. University of Paderborn, Warburger Straße 100, 33098, Paderborn, Germany

    Gregor Engels

  3. Department of Computer Science, University of Bremen, P.O. Box 33 04 40, 28334, Bremen, Germany

    Hans-Jörg Kreowski

  4. Leiden Center of Advanced Computer Science (LIACS), Leiden University, Niels Bohrweg 1, 2333, Leiden, CA, The Netherlands

    Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Baldan, P., Corradini, A., Montanari, U. (2000). Unfolding of Double-Pushout Graph Grammars is a Coreflection. In: Ehrig, H., Engels, G., Kreowski, HJ., Rozenberg, G. (eds) Theory and Application of Graph Transformations. TAGT 1998. Lecture Notes in Computer Science, vol 1764. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-46464-8_11

Download citation

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

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67203-6

  • Online ISBN: 978-3-540-46464-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation