Abstract
We introduce an extension of Graph Grammars (GGs), called Dynamic Graph Grammars (DynGGs), where the right-hand side of a production can spawn fresh parts of the type graph and fresh productions operating on it. The features of DynGGs make them suitable for the straightforward modeling of reflexive mobile systems like dynamic nets and the Join calculus. Our main result shows that each DynGG can be modeled as a (finite) GG, so that the dynamically generated structure can be typed statically, still preserving exactly all derivations.
Research supported by the EU FET-GC2 IST-2004-16004 Integrated Project Sensoria.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Asperti, A., Busi, N.: Mobile Petri nets. Technical Report UBLCS 96-10, Computer Science Department, University of Bologna (1996)
Buscemi, M., Sassone, V.: High-level Petri nets as type theories in the Join calculus. In: Honsell, F., Miculan, M. (eds.) ETAPS 2001 and FOSSACS 2001. LNCS, vol. 2030, pp. 104–120. Springer, Heidelberg (2001)
Corradini, A., Degano, P., Montanari, U.: Specifying highly concurrent data structure manipulation. In: Proc. of Computing 1985: A Broad Perspective of Current Developments (1985)
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: [13]
Corradini, A., Montanari, U., Rossi, F.: Graph processes. Fund. Inf. 26, 241–265 (1996)
Drewes, F., Kreowski, H.-J., Habel, A.: Hyperedge replacement graph grammars. In: [13]
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: [13]
Engelfriet, J., Rozenberg, G.: Node replacement graph grammars. In: [13]
Fournet, C., Gonthier, G.: The reflexive chemical abstract machine and the Join calculus. In: Proc. of POPL 1996, pp. 372–385. ACM Press, New York (1996)
Lanese, I.: Synchronization Strategies for Global Computing Models. PhD thesis, Department of Computer Science, University of Pisa (2006)
Hirsch, D.: Graph Transformation Models for Software Architecture Styles. PhD thesis, Departamento de Computación, Universidad de Buenos Aires (2003)
Löwe, M.: Algebraic approach to single-pushout graph transformation. Theoret. Comput. Sci. 109, 181–224 (1993)
Rozenberg, G. (ed.): Handbook of Graph Grammars and Computing by Graph Transformation. Foundations, vol. 1. World Scientific, Singapore (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bruni, R., Melgratti, H. (2006). Dynamic Graph Transformation Systems. In: Corradini, A., Ehrig, H., Montanari, U., Ribeiro, L., Rozenberg, G. (eds) Graph Transformations. ICGT 2006. Lecture Notes in Computer Science, vol 4178. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11841883_17
Download citation
DOI: https://doi.org/10.1007/11841883_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-38870-8
Online ISBN: 978-3-540-38872-2
eBook Packages: Computer ScienceComputer Science (R0)