Double-pullback graph transitions: A rule-based framework with incomplete information

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1764, Issue , 2000, Pages 85-102

  Ehrig, Hartmut ^a   Heckel, Reiko ^b   Llabrés, Mercè ^c   Orejas, Fernando ^d   Padberg, Julia ^a   Rozenberg, Grzegorz ^e  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^b UNIVERSITY OF PADERBORN   (Germany)

^c UNIVERSITAT DE LES ILLES BALEARS   (Spain)

^d UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^e LEIDEN UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

SEMANTICS;

COMPLETE CONTROL; DOUBLE-PUSHOUT APPROACH; GRAPH TRANSFORMATION; GRAPH TRANSFORMATION SYSTEM; INCOMPLETE INFORMATION; PLACE TRANSITION; REACTIVE SYSTEM; RULE-BASED APPROACH;

PETRI NETS;

EID: 84893141180     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-46464-8_7     Document Type: Conference Paper

References (15)

1. M. Bauderon. 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, LNCS 1073, pages 27–37, Springer Verlag, 1996.
2. M. Bauderon and H. Jacquet. Categorical product as a generic graph rewriting mechanism. Applied Categorical Structures, 1999. To appear. Also Tech. Rep. 1166-97, University of Bordeaux.
3. A. Corradini, U. Montanari, F. Rossi, H. Ehrig, R. Heckel, and M. Löwe. Algebraic approaches to graph transformation, Part I: Basic concepts and double pushout approach. In Rozenberg [15], pages 163–245.
4. H. Ehrig, R. Heckel, M. Llabres, and F. Orejas. Basic properties of double pullback graph transitions. Technical Report 99-02, TU Berlin, 1999.
5. H. Ehrig, R. Heckel, J. Padberg, and G. Rozenberg. Graph transformation and other rule-based formalisms with incomplete information. In Prelim. Proc. 6th Int. Workshop on Theory and Application of Graph Transformation (TAGT’98), Paderborn, 1998.
6. H. Ehrig, A. Merten, and J. Padberg. How to transfer concepts of abstract data types to petri nets? EATCS Bulletin, 62, pages 106–114, 1997.
7. J. Engelfriet and G. Rozenberg. Node replacement graph grammars. In Rozenberg [15], pages 1–94.
8. G. Engels, R. Heckel, G. Taentzer, and H. Ehrig. A combined reference modeland view-based approach to system specification. Int. Journal of Software and Knowledge Engeneering, 7(4):457–477, 1997.
9. R. Heckel. Open Graph Transformation Systems: A New Approach to the Compositional Modelling of Concurrent and Reactive Systems. PhD thesis, TU Berlin, 1998.
10. R. Heckel, H. Ehrig, U. Wolter, and A. Corradini. Double-pullback transitions and coalgebraic loose semantics for graph transformation systems. Applied Categorical Structures, 1999. To appear, see also TR 97-07 at http://www.cs.tu-berlin.de/cs/ifb/TechnBerichteListe.html.
11. A. Janhsen, K. Lemmer, B. Ptok, and E. Schnieder. Formal specifications of the european train control system. In IFAC Transportation Systems, 8th Symposium on Transportation Systems, 1997.
12. M. Löwe. Algebraic approach to single-pushout graph transformation. TCS, 109:181–224, 1993.
13. J. Meseguer and U. Montanari. Petri nets are monoids. Information and Computation, 88(2):105–155, 1990.
14. J. Padberg, L. Jansen, R. Heckel, and H. Ehrig. Interoperability in train control systems: Specification of scenarios using open nets. In Proc. Integrated Design and Process Technology (IDPT’98), Berlin, 1998.
15. G. Rozenberg, editor. Handbook of Graph Grammars and Computing by Graph Transformation, Volume 1: Foundations. World Scientific, 1997.