Skip to main content

Grammar Morphisms and Weakly Adhesive Categories

  • Conference paper
Graph Transformations (ICGT 2008)

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

Included in the following conference series:

  • 791 Accesses

Abstract

In the area of specification and modelling of concurrent systems, Petri nets have become a standard tool, and they still work behind the scenes in tools for graph transformation systems (cf. [1]). Moreover there is still potential for crossfertilization between the graph transformation and Petri net community. Even a better understanding of adhesive categories [2] and the related concepts of [3] seems possible in light of the proposed notion of weakly adhesive categories [4], which has emerged during work on the generalization of the co-reflective semantics of Petri nets to the realm of graph transformation and adhesive rewriting systems.

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

Access this chapter

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

References

  1. König, B., Kozioura, V.: Augur – a tool for the analysis of graph transformation systems. Bulletin of the EATCS 87, 126–137 (2005)

    Google Scholar 

  2. Lack, S., Sobocinski, P.: Adhesive categories. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol. 2987, pp. 273–288. Springer, Heidelberg (2004)

    Google Scholar 

  3. Ehrig, H., Prange, U.: Weak adhesive high-level replacement categories and systems: A unifying framework for graph and petri net transformations. In: Futatsugi, K., Jouannaud, J.P., Meseguer, J. (eds.) Algebra, Meaning, and Computation. LNCS, vol. 4060, pp. 235–251. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  4. Baldan, P., Corradini, A., König, B., Heindel, T., Sobociński, P.: Unfolding weakly adhesive grammars. CONCUR 2008 (submitted, 2008)

    Google Scholar 

  5. Winskel, G.: Petri nets, algebras, morphisms, and compositionality. Information and Computation 72(3), 197–238 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  6. Bednarczyk, M.A., Borzyszkowski, A.M.: General morphisms of petri nets (extended abstract). In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, pp. 190–199. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  7. Winskel, G.: Event structures. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) APN 1986. LNCS, vol. 255, pp. 325–392. Springer, Heidelberg (1987)

    Google Scholar 

  8. Baldan, P., Corradini, A., Montanari, U.: Unfolding of double-pushout graph grammars is a coreflection. In: Ehrig, H., Engels, G., Kreowski, H.J., Rozenberg, G. (eds.) TAGT 1998. LNCS, vol. 1764, pp. 145–163. Springer, Heidelberg (2000)

    Google Scholar 

  9. Corradini, A., Ehrig, H., Löwe, M., Montanari, U., Padberg, J.: The category of typed graph grammars and its adjunctions with categories. In: Cuny, J.E., Ehrig, H., Engels, G., Rozenberg, G. (eds.) Graph Grammars 1994. LNCS, vol. 1073, pp. 56–74. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  10. Robinson, E., Rosolini, G.: Categories of partial maps. Information and Computation 79(2), 95–130 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  11. Kennaway, R.: Graph rewriting in some categories of partial morphisms. In: Ehrig, H., Kreowski, H.J., Rozenberg, G. (eds.) Graph Grammars 1990. LNCS, vol. 532, pp. 490–504. Springer, Heidelberg (1991)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Heindel, T. (2008). Grammar Morphisms and Weakly Adhesive Categories. In: Ehrig, H., Heckel, R., Rozenberg, G., Taentzer, G. (eds) Graph Transformations. ICGT 2008. Lecture Notes in Computer Science, vol 5214. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87405-8_43

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-87405-8_43

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-87404-1

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics