Synchronized composition of graph grammar productions

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

Volumn 1073, Issue , 1996, Pages 257-270

  Corradini, Andrea ^a   Rossi, Francesca ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LANGUAGES; METALS; PETRI NETS; SEMANTICS; SYNCHRONIZATION;

ALGEBRAIC APPROACHES; CLASSICAL THEORY; CONSERVATIVE EXTENSIONS; DOUBLE PUSHOUT APPROACHES; EVENT STRUCTURES; GRAPH GRAMMAR; PARALLEL COMPOSITION; PARTIAL ORDER;

CONTEXT SENSITIVE GRAMMARS;

EID: 84947705429     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61228-9_92     Document Type: Conference Paper

References (18)

1. P. Böehm, H. Fonio and A. Habel. Amalgamation of graph transformations: a synchronization mechanism. In JCSS 34 (1987), 307-408.
2. A. Corradini, H. Ehrig, M. Löwe, U. Montanan and F. Rossi. Abstract Graph Derivations in the Double-Pushout Approach. In Proceedings Dagstuhl Seminar on Graph Trasformations in Computer Science. LNCS 776, Springer-Verlag, 1994, 86-103.
3. A. Corradini, H. Ehrig, M. Löwe, U. Montanari and F. Rossi. An event structure semantics for safe graph grammars. In Programming Concepts, Methods and Calculi, E.-R. Olderog ed., IFIP Transactions A-56, North Holland, 1994, 423-444.
4. A. Corradini, H. Ehrig, M. Löwe, U. Montanari and F. Rossi. Algebraic approach to graph transformation II: models of computations in the double pushout approach. Submitted.
5. A. Corradini, H. Ehrig, M. Löwe, U. Montanari and F. Rossi. An event structure semantics for graph grammars with parallel productions. In this volume.
6. H. Ehrig. Tutorial introduction to the algebraic approach of graph-grammars. In Proceedings 3rd International Workshop on Graph Grammars and their Application to Computer Science, LNCS 291, Springer-Verlag, 1987, 3-14
7. H. Ehrig and R. Heckel and M. Korff and L. Ribeiro and A. Wagner. Algebraic Approach to Graph Transformation I: Tutorial Introduction and Single-Pushout Approach. Submitted for the Handbook of Graph Grammars, 1995.
8. R. Janicki and M. Koutny. Invariant semantics of nets with inhibitor arcs. In Proc. CONCUR. Springer-Verlag, LNCS 527, 1991.
9. R. Janicki and M. Koutny. Structure of concurrency. Theoretical Computer Science, 112:5-52, 1993.
10. J.R. Kennaway, J.W. Klop, M.R. Sleep, and F.J. de Vries. Event structures and orthogonal term graph rewriting. In M.J. Plasmejier M.R. Sleep and M.C.J.D. van Eekelen, editors, Term Graph Rewriting. Wiley Professional Computing, 1993.
11. H.-J. Kreowski. Manipulation von Graph Transformationen. Ph.D. Thesis, Technische Universität Berlin, 1977.
12. H.-J. Kreowski. Is parallelism already concurrency? Part 1: Derivations in graph grammars. In Proceedings of the 3rd International Workshop on Graph-Grammars and Their Application to Computer Science. LNCS 291, Springer-Verlag, 1987, 343-360.
13. M. Löwe. Extended algebraic graph transformation. Ph.D. Thesis, Technische Universität Berlin, 1990.
14. M. Löwe. Algebraic approach to single-pushout graph transformation. In Theoret. Com-put. Sci. 109 (1993) 181-224.
15. M. Löwe and J. Dingel. Parallelism in the Single-Pushout Graph Rewriting. In Proceedings Dagstuhl Seminar on Graph Trasformations in Computer Science, LNCS 776, Springer-Verlag, 1994.
16. R. Milner. A Calculus of Communicating Systems. In LNCS 92, 1980.
17. U. Montanari and F. Rossi. Graph grammars as context-dependent rewriting systems. In Proceedings CAAP92. Springer-Verlag, LNCS, 1992.
18. W. Reisig. Petri Nets: An Introduction. EACTS Monographs on Theoretical Computer Science, Springer-Verlag, 1985.