Coreflective concurrent semantics for single-pushout graph grammars

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

Volumn 2755, Issue , 2003, Pages 165-184

  Baldan, Paolo ^a   Corradini, Andrea ^b   Montanari, Ugo ^b   Ribeiro, Leila ^c  

^a CA' FOSCARI UNIVERSITY OF VENICE   (Italy)

^b UNIVERSITY OF PISA   (Italy)

^c FEDERAL UNIVERSITY OF RIO GRANDE DO SUL   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; CONTEXT SENSITIVE GRAMMARS; FORMAL LANGUAGES; GRAPH THEORY; PETRI NETS;

ALGEBRAIC DOMAINS; CONCURRENT SEMANTICS; DOUBLE PUSHOUT APPROACHES; GRAPH GRAMMAR; PARTIAL RESULTS; PUSH-OUT; UNFOLDING SEMANTICS;

SEMANTICS;

EID: 0347587032     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-40020-2_9     Document Type: Article

References (27)

1. P. Baldan. Modelling concurrent computations: from contextual Petri nets to graph grammars. PhD thesis, Department of Computer Science, University of Pisa, 2000. Available as technical report n. TD-1/00.
2. P. Baldan, A. Corradini, and U. Montanari. An event structure semantics for P/T contextual nets: Asymmetric event structures. Proc. of FoSSaCS '98, vol. 1378 of LNCS, pp. 63-80. Springer, 1998.
3. P. Baldan, A. Corradini, and U. Montanari. Unfolding of double-pushout graph grammars is a coreflection. TAGT'98 Conference Proc., vol. 1764 of LNCS, pp. 145-163. Springer, 1999.
4. P. Baldan, A. Corradini, and U. Montanari. Contextual Petri nets, asymmetric event structures and processes. Information and Computation, 171(1):1-49, 2001.
5. S. Christensen and N. D. Hansen. Coloured Petri nets extended with place capacities, test arcs and inhibitor arcs. Applications and Theory of Petri Nets, vol. 691 of LNCS, pp. 186-205. Springer, 1993.
6. A. Corradini. Concurrent graph and term graph rewriting. Proc. of CONCUR'96, vol. 1119 of LNCS, pp. 438-464. Springer, 1996.
7. A. Corradini, H. Ehrig, M. Löwe, U. Montanari, and J. Padberg. The category of typed graph grammars and its adjunctions with categories of derivations. Proc. of the 5th International Workshop on Graph Grammars and their Application to Computer Science, vol. 1073 of LNCS. Springer, 1996.
8. A. Corradini, U. Montanari, and F. Rossi. Graph processes. Fundamenta Informaticae, 26:241-265, 1996.
9. 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 Rozenberg [25], chapter 3.
10. H. Ehrig, A. Habel, H.-J. Kreowski, and F. Parisi-Presicce. Parallelism and concurrency in High-Level Replacement Systems. Mathematical Structures in Computer Science, 1:361-404, 1991.
11. H. Ehrig, R. Heckel, M. Korff, M. Löwe, L. Ribeiro, A. Wagner, and A. Corradini. Algebraic Approaches to Graph Transformation II: Single Pushout Approach and Comparison with Double Pushout Approach. In Rozenberg [25], chapter 4.
12. H. Ehrig, M. Pfender, and H.J. Schneider. Graph-grammars: an algebraic approach. In Proc. of IEEE Conf. on Automata and Switching Theory, pp. 167-180, 1973.
13. U. Golz and W. Reisig. The non-sequential behaviour of Petri nets. Information and Control, 57:125-147, 1983.
14. R. Heckel, A. Corradini, H. Ehrig, and M. Löwe. Horizontal and vertical structuring of graph transformation systems. Mathematical Structures in Computer Science, 6(6):613-648, 1996.
15. R. Janicki and M. Koutny. Semantics of inhibitor nets. Information and Computation, 123:1-16, 1995.
16. M. Korff. Generalized graph structure grammars with applications to concurrent object-oriented systems. PhD thesis, Technische Universität Berlin, 1996.
17. R. Langerak. Transformation and Semantics for LOTOS. PhD thesis, Department of Computer Science, University of Twente, 1992.
18. M. Löwe. Algebraic approach to single-pushout graph transformation. Theoretical Computer Science, 109:181-224, 1993.
19. M. Löwe, M. Korff, and A. Wagner. An Algebraic Framework for the Transformation of Attributed Graphs. Term Graph Rewriting: Theory and Practice, pp. 185-199. Wiley, London, 1993.
20. J. Meseguer, U. Montanari, and V. Sassone. On the semantics of Place/Transition Petri nets. Mathematical Structures in Computer Science, 7:359-397, 1997.
21. U. Montanari and F. Rossi. Contextual nets. Acta Informatica, 32(6), 1995.
22. M. Nielsen, G. Plotkin, and G. Winskel. Petri Nets, Event Structures and Domains, Part 1. Theoretical Computer Science, 13:85-108, 1981.
23. G. M. Pinna and A. Poigné. On the nature of events: another perspective in concurrency. Theoretical Computer Science, 138(2):425-454, 1995.
24. L. Ribeiro. Parallel Composition and Unfolding Semantics of Graph Grammars. PhD thesis, Technische Universität Berlin, 1996.
25. Grzegorz Rozenberg, editor. Handbook of Graph Grammars and Computing by Graph Transformation. Vol. 1: Foundations. World Scientific, 1997.
26. W. Vogler. Efficiency of asynchronous systems and read arcs in Petri nets. In Proc. of ICALP'97, vol. 1256 of LNCS, pp. 538-548. Springer, 1997.
27. G. Winskel. Event Structures. In Petri Nets: Applications and Relationships to Other Models of Concurrency, vol. 255 of LNCS, pp. 325-392. Springer, 1987.