Unfolding and event structure semantics for graph grammars

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

Volumn 1578, Issue , 1999, Pages 73-89

  Baldan, Paolo ^a   Corradini, Andrea ^a   Montanari, Ugo ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CONTEXT SENSITIVE GRAMMARS; FORMAL LANGUAGES; PETRI NETS;

ALGEBRAIC DOMAINS; BRANCHING STRUCTURES; DOUBLE PUSHOUT APPROACHES; EVENT STRUCTURES; GRAPH GRAMMAR; GRAPH TRANSFORMATION; GRAPH TRANSFORMATION SYSTEM; UNFOLDING SEMANTICS;

SEMANTICS;

EID: 84937706727     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49019-1_6     Document Type: Conference Paper

References (15)

1. P. Baldan, A. Corradini, and U. Montanari. An event structure semantics for P/T contextual nets: Asymmetric event structures. Proceedings of FoSSaCS '98, volume 1378, pages 63-80. Springer, 1998.
2. A. Corradini. Concurrent Graph and Term Graph Rewriting. Proceedings CON- CUR'96, volume 1119 of LNCS, pages 438-464. Springer, 1996.
3. A. Corradini, H. Ehrig, M. Löwe, U. Montanari, and F. Rossi. An Event Structure Semantics for Graph Grammars with Parallel Productions. Proceedings of the 5th International Workshop on Graph Grammars and their Application to Computer Science, volume 1073 of LNCS. Springer, 1996.
4. A. Corradini, U. Montanari, and F. Rossi. Graph processes. Fundamenta Infor- maticae, 26:241-265, 1996.
5. A. Corradini, U. Montanari, F. Rossi, H. Ehrig, R. Heckel, and M. Löwe. Algebraic Approaches to Graph Transformation I: Basic Concepts and Double Pushout Approach. In G. Rozenberg, editor, Handbook of Graph Grammars and Computing by Graph Transformation. Volume 1: Foundations. World Scientific, 1997.
6. H. Ehrig. Tutorial introduction to the algebraic approach of graph-grammars. Proceedings of the 3rd International Workshop on Graph-Grammars and Their Application to Computer Science, volume 291 of LNCS, pages 3-14. Springer, 1987.
7. R. Janicki and M. Koutny. Semantics of inhibitor nets. Information and Computation, 123:1-16, 1995.
8. H.-J. Kreowski. A comparison between Petri nets and graph grammars. Proceedings of the Workshop on Graphtheoretic Concepts in Computer Science, volume 100 of LNCS, pages 306-317. Springer, 1981.
9. J. Meseguer, U. Montanari, and V. Sassone Process versus unfolding semantics for Place/Transition Petri nets. Theoret. Comput. Sci., 153(1-2):171-210, 1996.
10. U. Montanari and F. Rossi. Contextual nets. Acta Informatica, 32, 1995.
11. W. Reisig. Petri Nets: An Introduction. EACTS Monographs on Theoretical Computer Science. Springer, 1985.
12. L. Ribeiro. Parallel Composition and Unfolding Semantics of Graph Grammars. PhD thesis, Technische Universität Berlin, 1996.
13. G. Schied. On relating Rewriting Systems and Graph Grammars to Event Structures. Proceedings of the Dagstuhl Seminar 9301 on Graph Transformations in Computer Science, volume 776 of LNCS, pages 326-340. Springer, 1994.
14. W. Vogler. Effciency of asynchronous systems and read arcs in Petri nets. Technical Report 352, Institüt für Mathematik, Augsburg University, 1996.
15. G. Winskel. Event Structures. In Petri Nets: Applications and Relationships to Other Models of Concurrency, volume 255 of LNCS, pages 325-392. Springer, 1987.