Concurrency and loose semantics of open graph transformation systems

Mathematical Structures in Computer Science

Volumn 12, Issue 4, 2002, Pages 349-376

  Heckel, Reiko ^a   Llabres, Merce ^b   Ehrig, Hartmut ^c   Orejas, Fernando ^d  

^a UNIVERSITY OF PADERBORN   (Germany)

^b UNIVERSITAT DE LES ILLES BALEARS   (Spain)

^c TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^d UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33746474531     PISSN: 09601295     EISSN: 14698072     Source Type: Journal    
DOI: 10.1017/S0960129501003553     Document Type: Article

References (23)

1. Andries, M. and Engels, G. (1996). A hybrid query language for the extended entity relationship model. Journal of Visual Languages and Computing 7 (3) 321–352. (Special Issue on Visual Query Systems.)
2. Baldan, P., Corradini, A., Ehrig, H. Lowe, M., Montanari, U. and Rossi, F. (1999). Concurrent semantics of algebraic graph transformation. In: Ehrig, H. Kreowski, H.-J., Montanari, U. and Rozenberg, G. (eds.) Handbook of Graph Grammars and Computing by Graph Transformation, Volume 3: Concurrency and Distribution, World Scientific 107–188.
3. Bauderon, M. (1996) A category-theoretical approach to vertex replacement: The generation of infinite graphs. In: 5th Int. Workshop on Graph Grammars and their Application to Computer Science, Williamsburg ’94. Springer-Verlag Lecture Notes in Computer Science 1073 27–37.
4. Bauderon, M. and Jacquet, H. (2001) Pullback as a generic graph rewriting mechanism. Applied Categorical Structures 9 (1).
5. Bernstein, P., Hadzilacos, V. and Goodman, N. (1987) Concurrency Control and Recovery in Database Systems, Addison-Wesley.
6. Corradini, A., Montanari, U. and Rossi, F. (1996) Graph processes. Fundamenta Informaticae 26 (34) 241–266.
7. Corradini, A., Montanari, U., Rossi, F., Ehrig, H. Heckel, R. and Lowe, M. (1997) Algebraic approaches to graph transformation, Part I: Basic concepts and double pushout approach. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformation, Volume 1: Foundations, World Scientific 163–245.
8. Ehrig, H., Engels, G., Kreowski, H.-J. and Rozenberg, G. (eds.) (1999a) Handbook of Graph Grammars and Computing by Graph Transformation, Volume 2: Applications, Languages, and Tools, World Scientific.
9. Ehrig, H., Heckel, R., Llabres, M. and Orejas, F. (1999b) Basic properties of double pullback graph transitions. Technical Report 99–102, TU Berlin.
10. Ehrig, H., Heckel, R., Llabres, M., Orejas, F., Padberg, J. and Rozenberg, G. (2000) Double-pullback graph transitions: A rule-based framework with incomplete information. In: Ehrig, H., Engels, G., Kreowski, H.-J. and Rozenberg, G. (eds.) Proc. 6th Int. Workshop on Theory and Application of Graph Transformation (TAGT’98), Paderborn, November 1998. Springer-Verlag Lecture Notes in Computer Science 1764.
11. Ehrig, H., Pfender, M. and Schneider, H. (1973) Graph grammars: an algebraic approach. In: 14th Annual IEEE Symposium on Switching and Automata Theory 167–180.
12. Engelfriet, J. and Rozenberg, G. (1997) Node replacement graph grammars. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformation, Volume 1: Foundations, World Scientific 1–94.
13. Heckel, R. (1998) Open Graph Transformation Systems: A New Approach to the Compositional Mod-elling of Concurrent and Reactive Systems, Ph. D. thesis, TU Berlin.
14. Heckel, R., Corradini, A., Ehrig, H. and Lowe, M. (1996) Horizontal and vertical structuring of typed graph transformation systems. Mathematical Structures in Computer Science 6 (6) 613–648.
15. Heckel, R., Ehrig, H., Wolter, U. and Corradini, A. (2001) Double-pullback transitions and coalge-braic loose semantics for graph transformation systems. Applied Categorical Structures 9 (1).
16. Heckel, R., Engels, G., Ehrig, H. and Taentzer, G. (1999) A view-based approach to system modelling based on open graph transformation systems. In: Ehrig, H., Engels, G., Kreowski, H.-J. and Rozenberg, G. (eds.) Handbook of Graph Grammars and Computing by Graph Transformation, Volume 2: Applications, Languages, and Tools, World Scientific.
17. Kreowski, H.-J. (1977) Manipulation von Graphmanipulationen, Ph. D. thesis, Technical University of Berlin, Dept, of Comp. Sci.
18. Mac Lane, S. (1971) Categories for the Working Mathematician, Springer-Verlag (Volume 5 of Graduate Texts in Mathematics.)
19. Object Management Group (1999) UML specification version 1.3. http://www.omg.org.
20. Reisig, W. and Goltz, U. (1983) The nonsequential behaviour of Petri nets. Information and Control 57 (23).
21. Rozenberg, G. (ed.) (1997) Handbook of Graph Grammars and Computing by Graph Transformation, Volume 1: Foundations, World Scientific.
22. Schiirr, A., Winter, A. and Zundorf, A. (1999) The PROGRES approach: Language and environment. In: Ehrig, H., Engels, G., Kreowski, H.-J. and Rozenberg, G. (eds.) Handbook of Graph Grammars and Computing by Graph Transformation, Volume 2: Applications, Languages, and Tools, World Scientific 487–550.
23. Winskel, G. (1986) Event structures. In: Advances in Petri Nets 86-Part II. Springer-Verlag Lecture Notes in Computer Science 255 325–392.