Unfolding semantics of graph transformation

Information and Computation

Volumn 205, Issue 5, 2007, Pages 733-782

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

^a UNIVERSITY OF PADOVA   (Italy)

^b UNIVERSITY OF PISA   (Italy)

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

Author keywords

Concurrency; Event structures; Graph transformation systems; Nondeterminism; Petri nets; Read arcs; Unfolding

Indexed keywords

CONTEXT SENSITIVE GRAMMARS; FORMAL LANGUAGES; PETRI NETS; SEMANTICS;

CONCURRENCY; EVENT STRUCTURES; GRAPH TRANSFORMATION SYSTEM; NON-DETERMINISM; READ ARCS; UNFOLDING;

GRAPH THEORY;

EID: 84855193670     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2006.11.004     Document Type: Article

References (40)

1. P. Baldan, Modelling concurrent computations: from contextual Petri nets to graph grammars. Ph. D. thesis, Departmentof Computer Science, University of Pisa, 2000. Available as technical report n. TD-1/00.
2. P. Baldan, N. Busi, A. Corradini, G. M. Pinna, Domain and event structure semantics for Petri nets with read and inhibitor arcs, Theoretical Computer Science 323 (1-3) (2004) 129-189.
3. P. Baldan, A. Corradini, B. König, A static analysis technique for graph transformation systems, in: K. G. Larsen, M. Nielsen (Eds.), Proceedings of CONCUR 2001, LNCS, vol. 2154, Springer Verlag, 2001, pp. 381-395. (Pubitemid 33326669)
4. P. Baldan, A. Corradini, B. König, Verifying finite-state graph grammars: an unfolding-based approach, in: P. Gardner, N. Yoshida (Eds.), Proceedings of CONCUR 2004, LNCS, vol. 3170, Springer Verlag, 2004, pp. 83-98.
5. P. Baldan, A. Corradini, U. Montanari, Concatenable graph processes: relating processes and derivation traces, in: Proceedings of ICALP'98, LNCS, vol. 1443, Springer Verlag, 1998, pp. 283-295. (Pubitemid 128111123)
6. P. Baldan, A. Corradini, U. Montanari, Unfolding and event structure semantics for graph grammars, in: W. Thomas (Ed.), Proceedings of FoSSaCS'99, LNCS, vol. 1578, Springer Verlag, 1999, pp. 73-89.
7. P. Baldan, A. Corradini, U. Montanari, Unfolding of double-pushout graph grammars is a coreflection, in: G. Ehrig, G. Engels, H. Kreowsky, G. Rozemberg (Eds.), TAGT'98 Conference Proceedings, LNCS, vol. 1764, Springer Verlag, 1999, pp. 145-163.
8. P. Baldan, A. Corradini, U. Montanari, Contextual Petri nets, asymmetric event structures and processes, Information and Computation 171(1) (2001) 1-49.
9. P. Baldan, A. Corradini, U. Montanari, L. Ribeiro, Coreflective concurrent semantics for single-pushout graph grammars, in:M. Wirsing, D. Pattinson, R. Hennicker (Eds.), Proceedingsof WADT'02, LNCS, vol. 2755, Springer Verlag, 2003, pp. 165-184.
10. M. A. Bednarczyk, A. M. Borzyszkowski, General morphisms of Petri nets (extended abstract), in: in: J. Wiedermann, P. van Emde Boas, M. Nielsen (Eds.), Proceedings of ICALP'99, vol. 1644, Springer Verlag, 1999, pp. 190-199.
11. R. Bruni, F. Gadducci, Some algebraic laws for spans (and their connections with multirelations), in: W. Kahl, D. Parnas, G. Schmidt (Eds.), Proceedings of RelMiS 2001, Relational Methods in Software, vol. 44.3 of ENTCS, 2001. Also published as Technical Report, Bericht Nr. 2001-02, Fakultat fur Informatik, Universitat der Bundeswehr Munchen.
12. S. Christensen, N. D. Hansen, Coloured Petri nets extended with place capacities, test arcs and inhibitor arcs, in: M. Ajmone-Marsan (Ed.), Applications and Theory of Petri Nets, LNCS, vol. 691, Springer Verlag, 1993, pp. 186-205.
13. A. Corradini, Concurrent graph and term graph rewriting, in: U. Montanari, V. Sassone (Eds.), Proceedings of CONCUR'96, LNCS, vol. 1119, Springer Verlag, 1996, pp. 438-464. (Pubitemid 126117776)
14. A. Corradini, H. Ehrig, M. Löwe, U. Montanari, J. Padberg, The category of typed graph grammars and its adjunctions with categories of derivations, in: J. Cuny, H. Ehrig, G. Engels, G. Rozenberg (Eds.), Proceedings of the 5th International Workshop on Graph Grammars and their Application to Computer Science, LNCS, vol. 1073, Springer Verlag, 1996.
15. A. Corradini, U. Montanari, F. Rossi, Graph processes, Fundamenta Informaticae 26(1996) 241-265. (Pubitemid 126715011)
16. A. Corradini, U. Montanari, F. Rossi, H. Ehrig, R. Heckel, M. Löwe, Algebraic approaches to graph transformation I: basic concepts and double pushout approach, in: G. Rozenberg (Ed.), Handbook of Graph Grammars and Computing by Graph Transformation, vol. 1. Foundations, World Scientific, 1997.
17. H. Ehrig, A. Habel, H.-J. Kreowski, F. Parisi-Presicce, Parallelism and concurrency in high-level replacement systems, Mathematical Structures in Computer Science 1(1991) 361-404.
18. H. Ehrig, R. Heckel, M. Korff, M. Löwe, L. Ribeiro, A. Wagner, A. Corradini, Algebraic approaches to graph transformation II: single pushout approach and comparison with double pushout approach, in: G. Rozenberg (Ed.), Handbook of Graph Grammars and Computing by Graph Transformation. Vol. 1: Foundations, World Scientific, 1997.
19. H. Ehrig, M. Pfender, H. Schneider, Graph-grammars: an algebraic approach, in: Proceedings of IEEE Conf. on Automata and Switching Theory, (1973) pp. 167-180.
20. U. Goltz, W. Reisig, The non-sequential behaviour of Petri nets, Information and Control 57(1983) 125-147.
21. R. Heckel, A. Corradini, H. Ehrig, M. Löwe, Horizontal and vertical structuring of graph transformation systems, Mathematical Structures in Computer Science 6(6) (1996) 613-648. (Pubitemid 127012729)
22. R. Janicki, M. Koutny, Semantics of inhibitor nets, Information and Computation 123(1995) 1-16.
23. M. Korff. Generalized graph structure grammars with applications to concurrent object-oriented systems. Ph. D. thesis, Technische Universität Berlin, 1996.
24. S. Lack, P. Sobociński, Adhesive and quasiadhesive categories, Theoretical Informatics and Applications 39(2) (2005) 511-546.
25. R. Langerak, Transformation and Semantics for LOTOS. Ph. D. thesis, Department of Computer Science, University of Twente, 1992.
26. M. Löwe, Extended Algebraic Graph Transformation. Ph. D. thesis, Technical University of Berlin, 1990.
27. M. Löwe, Algebraic approach to single-pushout graph transformation, Theoretical Computer Science 109(1993) 181-224. (Pubitemid 23639485)
28. M. Löwe, M. Korff, A. Wagner, An algebraic framework for the transformation of attributed graphs, in: M. Sleep, M. Plasmeijer, M. van Eekelen (Eds.), Term Graph Rewriting: Theory and Practice, Wiley, London, 1993, pp. 185-199.
29. J. Meseguer, U. Montanari, Petri nets are monoids, Information and Computation 88(1990) 105-155. (Pubitemid 20735591)
30. J. Meseguer, U. Montanari, V. Sassone, Process versus unfolding semantics for place/transition Petri nets, Theoretical Computer Science 153 (1-2) (1996) 171-210. (Pubitemid 126412715)
31. J. Meseguer, U. Montanari, V. Sassone, On the semantics of place/transition Petri nets, Mathematical Structures in Computer Science 7(1997) 359-397. (Pubitemid 127088825)
32. U. Montanari, F. Rossi, Contextual nets, Acta Informatica 32(6) (1995) 545-596.
33. M. Nielsen, G. Plotkin, G. Winskel, Petri nets, event structures and domains, part 1, Theoretical Computer Science 13(1981) 85-108.
34. G. M. Pinna, A. Poigné, On the nature of events: another perspective in concurrency, Theoretical Computer Science 138(2) (1995) 425-454.
35. L. Ribeiro, Parallel Composition and Unfolding Semantics of Graph Grammars. Ph. D. thesis, Technische Universit/"at Berlin, 1996.
36. E. Robinson, G. Rosolini, Categories of partial maps, Information and Computation 79(1988) 95-130.
37. in: G. Rozenberg (Ed.), Handbook of Graph Grammars and Computing by Graph Transformation, vol. 1: Foundations, World Scientific, 1997.
38. W. Vogler, Efficiency of asynchronous systems and read arcs in Petri nets, in: Proceedings of ICALP'97, LNCS, vol. 1256, Springer Verlag, 1997, pp. 538-548. (Pubitemid 127097769)
39. G. Winskel, Event structures, in: Petri Nets: Applications and Relationshipsto Other Models of Concurrency, LNCS, vol. 255, Springer Verlag, 1987, pp. 325-392.
40. G. Winskel, Petri nets, algebras, morphisms, compositionality, Information and Computation 72(3) (1987) 197-238.