Concatenable graph processes: Relating processes and derivation traces

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

Volumn 1443 LNCS, Issue , 1998, Pages 283-295

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

^a UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; FORMAL LANGUAGES; PETRI NETS;

CONCURRENT AND DISTRIBUTED SYSTEMS; CONCURRENT SEMANTICS; DOUBLE PUSHOUT APPROACHES; EVENT STRUCTURES; GRAPH GRAMMAR; GRAPH REWRITING; P/T PETRI NETS; PROCESS SEMANTICS;

SEMANTICS;

EID: 22044455690     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055061     Document Type: Conference Paper

References (17)

1. P. Baldan, A. Corradini, and U. Montanari. An event structure semantics for P/T contextual nets: Asymmetric event structures. FoSSaCS '98, LNCS 1378, pp. 63-80. Springer, 1998.
2. A. Corradini. Concurrent Graph and Term Graph Rewriting. CONCUR'96, LNCS 1119, pp. 438-464. Springer, 1996.
3. A. Corradini, H. Ehrig, M. Löwe, U. Montanari, and F. Rossi. Abstract Graph Derivations in the Double-Pushout Approach. Dagstuhl Seminar 9301 on Graph Transformations in Computer Science, LNCS 776, pp. 86-103. Springer, 1994.
4. A. Corradini, H. Ehrig, M. Löwe, U. Montanari, and F. Rossi. Note on standard representation of graphs and graph derivations. Dagstuhl Seminar 9301 on Graph Transformations in Computer Science, LNCS 776, pp. 104-118. Springer, 1994.
5. A. Corradini, H. Ehrig, M. Löwe, U. Montanari, and F. Rossi. An Event Structure Semantics for Graph Grammars with Parallel Productions. 5th International Workshop on Graph Grammars and their Application to Computer Science, LNCS 1073. Springer, 1996.
6. A. Corradini, U. Montanari, and F. Rossi. Graph processes. Fundamenta Informaticae, 26:241-265, 1996.
7. 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 [15].
8. P. Degano, J. Meseguer, and U. Montanari. Axiomatizing the algebra of net computations and processes. Acta Informatica, 33:641-647, 1996.
9. H. Ehrig. Tutorial introduction to the algebraic approach of graph-grammars. 3rd International Workshop on Graph-Grammars and Their Application to Computer Science, LNCS 291, pp. 3-14. Springer, 1987.
10. U. Golz and W. Reisig. The non-sequential behaviour of Petri nets. Information and Control, 57:125-147, 1983.
11. H.-J. Kreowski. Manipulation von Graphmanipulationen. PhD thesis, Technische Universität Berlin, 1977.
12. A. Maggiolo-Schettini and J. Winkowski. Dynamic Graphs. In MFCS'96, LNCS 1113, pp. 431-442, 1996.
13. J. Meseguer, U. Montanari, and V. Sassone. On the semantics of Petri nets. In CONCUR '92, LNCS 630, pp. 286-301. Springer, 1992.
14. 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.
15. G. Rozenberg, editor. Handbook of Graph Grammars and Computing by Graph Transformation. Volume 1: Foundations. World Scientific, 1997.
16. G. Schied. On relating Rewriting Systems and Graph Grammars to Event Structures. Dagstuhl Seminar 9301 on Graph Transformations in Computer Science, LNCS 776, pp. 326-340. Springer, 1994.
17. G. Winskel. Event Structures. In Petri Nets: Applications and Relationships to Other Models of Concurrency, LNCS 255, pp. 325-392. Springer, 1987.