Concurrent graph and term graph rewriting

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

Volumn 1119, Issue , 1996, Pages 438-464

  Corradini, A ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

SEMANTICS;

ALGEBRAIC APPROACHES; CATEGORICAL SEMANTICS; CONCURRENT SEMANTICS; GRAPH REWRITING SYSTEMS; PARALLEL AND DISTRIBUTED SYSTEMS; PARALLELISM AND CONCURRENCIES; TERM GRAPH REWRITING; THEORY OF PETRI NETS;

PETRI NETS;

EID: 84955607399     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61604-7_69     Document Type: Conference Paper

References (72)

1. R. Banach. DPO Rewriting and Abstract Semantics via Opfibrations. In A. Corradini and U. Montanari, editors, Proceedings SEGRAGRA’95, volume 2 of Electronic Notes in Theoretical Computer Science. Elsevier Sciences, 1995. http://www.elsevier.nl/locate/entcs/volume2.html.
2. M.A. Bednarczyk. Categories of asynchronous systems. PhD thesis, University of Sussex, 1988. Report no. 1/88.
3. D. Clark and R. Kennaway. Some Properties of Non-Orthogonal Term Graph Rewriting. In A. Corradini and U. Montanari, editors, Proceedings SEGRA- GRA ’95, volume 2 of Electronic Notes in Theoretical Computer Science. Elsevier Sciences, 1995. http://wwv.elsevier.nl/locate/entcs/volume2.html.
4. D. Clark and R. Kennaway. Event Structures and Non-Orthogonal Term Graph Rewriting. Mathematical Structures in Computer Science, 1996. To appear.
5. V. Claus, H. Ehrig, and G. Rozenberg, editors. Proceedings of the 1st International Workshop on Graph-Grammars and Their Application to Computer Science and Biology, volume 73 of LNCS. Springer Verlag, 1979.
6. A. Corradini. Concurrent Computing: Prom Petri Nets to Graph Grammars. In A. Corradini and U. Montanari, editors, Proceedings SEGRAGRA ’95, volume 2 of Electronic Notes in Theoretical Computer Science. Elsevier Sciences, 1995. http://www.elsevier.nl/locate/entcs/volume2.html.
7. A. Corradini, H. Ehrig, M. Lowe, U. Montanari, and J. Padberg. The category of Typed Graph Grammars and its adjunctions with categories of derivations. In Proceedings of the Fifth International Workshop on Graph Grammars and their Application to Computer Science, LNCS. Springer Verlag, 1996. To appear.
8. A. Corradini, H. Ehrig, M. Lowe, U. Montanari, and F. Rossi. Abstract Graph Derivations in the Double-Pushout Approach. In H.-J. Schneider and H. Ehrig, editors, Proceedings of the Dagstuhl Seminar 9301 on Graph Transformations in Computer Science, volume 776 of LNCS, pages 86-103. Springer Verlag, 1994.
9. A. Corradini, H. Ehrig, M. Löwe, U. Montanari, and F. Rossi. An event structure semantics for safe graph grammars. In E.-R. Olderog, editor, Programming Concepts, Methods and Calculi, IFIP Transactions A-56, pages 423-444. North- Holland, 1994.
10. A. Corradini, H. Ehrig, M. Löwe, U. Montanari, and F. Rossi. Note on standard representation of graphs and graph derivations. In H.-J. Schneider and H. Ehrig, editors, Proceedings of the Dagstuhl Seminar 9301 on Graph Transformations in Computer Science, volume 776 of LNCS, pages 104-118. Springer Verlag, 1994.
11. A. Corradini, H. Ehrig, M. Löwe, U. Montanari, and F. Rossi. An Event Structure Semantics for Graph Grammars with Parallel Productions. In Proceedings of the Fifth International Workshop on Graph Grammars and their Application to Computer Science, LNCS. Springer Verlag, 1996. To appear.
12. A. Corradini and R. Heckel. A Compositional Approach to Structuring and Refinement of Typed Graph Grammars. In A. Corradini and U. Montanari, editors, Proceedings SEGRAGRA ’95, volume 2 of Electronic Notes in Theoretical Computer Science. Elsevier Sciences, 1995. http://vwv.elsevier.nl/locate/entcs/volume2.html.
13. A. Corradini, U. Montanari, and F. Rossi. Graph processes. Fundamenta Infor- maticae, 1996. to appear.
14. 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, The Handbook of Graph Grammars, Volume I: Foundations. World Scientific, 1996. To appear.
15. A. Corradini and F. Rossi. Synchronized Composition of Graph Grammar Productions. In Proceedings of the Fifth International Workshop on Graph Grammars and their Application to Computer Science, LNCS. Springer Verlag, 1996. To appear.
16. P. Degano and U. Montanari. A model of distributed systems based on graph rewriting. Journal of Ike ACM, 34:411-449, 1987.
17. F. Drewes, A. Habel, and H.-J. Kreowski. Hyperedge Replacement Graph Grammars. In G. Rozenberg, editor, Handbook of Graph Transformations. Vol. I: Foundations. World Scientific, 1996. To appear.
18. H. Ehrig. Introduction to the Algebraic Theory of Graph Grammars. In V. Claus, H. Ehrig, and G. Rozenberg, editors, Proceedings of the 1st International Workshop on Graph-Grammars and Their Application to Computer Science and Biology, volume 73 of LNCS, pages 1-69. Springer Verlag, 1979.
19. H. Ehrig. Aspects of Concurrency in Graph Grammars. In H. Ehrig, M. Nagl, and Rozenberg, editors, Proceedings of the 2nd International Workshop on Graph- Grammars and Their Application to Computer Science, volume 153 of LNCS, pages 58-81. Springer Verlag, 1983.
20. H. Ehrig. Tutorial introduction to the algebraic approach of graph-grammars. In Ehrig, M. Nagl, G. Rozenberg, and A. Rosenfeld, editors, Proceedings of the 3rd International Workshop on Graph-Grammars and Their Application to Computer Science, volume 291 of LNCS, pages 3-14. Springer Verlag, 1987.
21. 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.
22. 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 G. Rozenberg, editor, The Hand book of Graph Grammars, Volume I: Foundations. World Scientific, 1996. To appear.
23. H. Ehrig, H.-J. Kreowski, and G. Rozenberg, editors. Proceedings of the 4th International Workshop on Graph-Grammars and Their Application to Computer Science, volume 532 of LNCS. Springer Verlag, 1991.
24. H. Ehrig, M. Nagl, andG. Rozenberg, editors. Proceedings of the 2nd International Workshop on Graph-Grammars and Their Application to Computer Science, volume 153 of LNCS. Springer Verlag, 1983.
25. H. Ehrig, M. Nagl, G. Rozenberg, and A. Rosenfeld, editors. Proceedings of the 3rd International Workshop on Graph-Grammars and Their Application to Computer Science, volume 291 of LNCS. Springer Verlag, 1987.
26. H. Ehrig, M. Pfender, and H.J. Schneider. Graph-grammars: an algebraic approach. In Proceedings IEEE Conf. on Automata and Switching Theory, pages 167-180, 1973.
27. J. Engelfriet and G. Rozenberg. Node Replacement Graph Grammars. In Rozenberg, editor, Handbook of Graph Rewriting, Vol. I: Foundations. World Scientific, 1996. To appear.
28. G. Engels and G. Rozenberg, editors. Preliminary Proceedings of the Fifth International Workshop on Graph Grammars and their Application to Computer Science, 1994.
29. H.J. Genrich, D. Janssens, G. Rozenberg, and P.S. Thiagarajan. Petri nets and their relation to graph grammars. In H. Ehrig, M. Nagl, and G. Rozenberg, editors, Proceedings of the 2nd International Workshop on Graph-Grammars and Their Application to Computer Science, volume 153 of LNCS, pages 115-129. Springer Verlag, 1983.
30. U. Golz and W. Reisig. The Non-sequential Behaviour of Petri Nets. Info, and Co., 57:125-147, 1983.
31. A. Habel. Hyperedge replacement: Grammars and languages, volume 643 of LNCS. Springer Verlag, 1992.
32. R. Heckel, A. Corradini, H. Ehrig, and M. Löwe. Horizontal and Vertical Structuring of Graph Transformation Systems. Mathematical Structures in Computer Science, 1996. To appear.
33. G. Huet and J-J. Levy. Computations in Orthogonal Rewriting Systems, I. In J.-L. Lassez and G. Plotkin, editors, Festschrift in Honor of J. A. Robinson, pages 395-414. MIT Press, 1991.
34. R. Janicki and M Koutny. Invariant semantics of nets with inhibitor arcs. In Proceedings CONCUR ’91, volume 527 of LNCS. Springer Verlag, 1991.
35. R. Janicki and M Koutny. Structure of concurrency. Theoret. Comput. Sci., 112:5-1993.
36. D. Janssens. ESM systems and the composition of their computations. In Graph Transformations in Computer Science, volume 776 of LNCS, pages 203-217. Springer Verlag, 1994.
37. D. Janssens, H.-J. Kreowski, G. Rozenberg, and H. Ehrig. Concurrency of nodelabel-controlled graph transformations. Technical Report 82-38, Antwerp, 1982.
38. D. Janssens, M. Léns, and G. Rozenberg. Computation graphs for actor grammars. Computer and System Sciences, 46:60-90, 1993.
39. D. Janssens and T. Mens. Abstract semantics for ESM systems. Technical Report 95-04, University of Antwerp - UIA, dept, of Math, and Comp. Sci., 1995. to appear in Fundamenta Informaticae.
40. D. Janssens and G. Rozenberg. Actor Grammars. Mathematical Systems Theory, 22:75-107, 1989.
41. J.R. Kennaway, J.W. Klop, M.R. Sleep, and F.J. de Vries. Event structures and orthogonal term graph rewriting. In M.R. Sleep, M.J. Plasmeijer, and M.C. van Eekele, editors, Term Graph Rewriting: Theory and Practice, pages 141-155. Wiley, London, 1993.
42. M. Korff. True Concurrency Semantics for Single Pushout Graph Transformations with Applications to Actor Systems. In Proceedings International Workshop on Information Systems - Corretness and Reusability, IS-CORE’94, pages 244-258. Vrije Universiteit Press, 1994. Tech. Report IR-357.
43. M. Korff. Generalized graph structure grammars with applications to concurrent object-oriented systems. PhD thesis, Technische Universität Berlin, 1996.
44. M. Korff and L. Ribeiro. Concurrent Derivations as Single Pushout Graph Grammar Processes. In A. Corradini and U. Montanari, editors, Proceedings SEGRA- GRA ’95, volume 2 of Electronic Notes in Theoretical Computer Science. Elsevier Sciences, 1995. http://wwH.elsevier.nl/locate/entcs/volwne2.htiiiI.
45. M. Korff and L. Ribeiro. An Attributed Graph Transformation Approach to the Behaviour of Algebraic High-Level Nets. In Proceedings of the Fifth International Workshop on Graph Grammars and their Application to Computer Science, LNCS. Springer Verlag, 1996. To appear.
46. H.-J. Kreowski. Manipulation von Graphmanipulationen. PhD thesis, Technische Universität Berlin, 1977.
47. H.-J. Kreowski. A comparison between Petri nets and graph grammars. In Noltemeier, editor, Proceedings GraphTheoretic Concepts in Computer Science WG80, volume 100 of LNCS, pages 306-317. Springer Verlag, 1981.
48. H.-J. Kreowski. Is parallelism already concurrency? Part 1: Derivations in graph grammars. In H. Ehrig, M. Nagl, G. Rozenberg, and A. Rosenfeld, editors, Proceedings of the 3rd International Workshop on Graph-Grammars and Their Application to Computer Science, volume 291 of LNCS, pages 343-360. Springer Verlag, 1987.
49. H.-J. Kreowski and A. Wilharm. Net processes correspond to derivation processes in graph grammars. Theoret. Comput. Sci., 44:275-305, 1986.
50. H.-J. Kreowski and A. Wilharm. Is parallelism already concurrency? Part 2: Nonsequential processes in graph grammars. In H. Ehrig, M. Nagl, G. Rozenberg, and A. Rosenfeld, editors, Proceedings of the 3rd International Workshop on Graph- Grammars and Their Application to Computer Science, volume 291 of LNCS, pages 361-377. Springer Verlag, 1987.
51. M. Lowe. Algebraic approach to single-pushout graph transformation. Theoret. Comput. Sci., 109:181-224, 1993.
52. J. Meseguer and U. Montanari. Petri nets are monoids. Info, and Co., 88:105-155, 1990.
53. J. Meseguer, U. Montanari, and V. Sassone. On the semantics of Petri nets. In Proceedings CONCUR ’92, volume 630 of LNCS, pages 286-301. Springer Verlag, 1992.
54. U. Montanari and F. Rossi. Contextual nets. Acta Informatica, 32, 1995. Also as Technical Report TR 4-93, Department of Computer Science, University of Pisa, February 1993.
55. M. Nagl. Set theoretic approaches to graph grammars. In H. Ehrig, M. Nagl, Rozenberg, and A. Rosenfeld, editors, Proceedings of the 3rd International Workshop on Graph-Grammars and Their Application to Computer Science, volume 291 of LNCS, pages 41-54. Springer Verlag, 1987.
56. Manfred Nagl. Graph-Grammatiken: Theorie, Anwendungen,Implementierungen. Vieweg, Braunschweig, 1979.
57. M. Nielsen, G. Plotkin, and G. Winskel. Petri Nets, Event Structures and Domains, Part 1. Theoret. Comput. Sci., 13:85-108, 1981.
58. C.A. Petri. Kommunikation mit Automaten. Schriften des Institutes fur Instru- mentelle Matematik, Bonn. 1962.
59. W. Reisig. A graph grammar representation of nonsequential processes. In Noltemeier, editor, Proceedings Graphtheoretic Concepts in Computer Science WG80, volume 100 of LNCS, pages 318-325. Springer Verlag, 1981.
60. W. Reisig. Petri Nets: An Introduction. EACTS Monographs on Theoretical Computer Science. Springer Verlag, 1985.
61. L. Ribeiro. Parallel Composition and Unfolding Semanics of Graph Grammars. PhD thesis, Technische Universität Berlin, 1996.
62. G. Rozenberg. Behaviour of Elementary Net Systems. In Petri Nets: Central Models and Their Properties, volume 254 of LNCS, pages 60-94. Springer Verlag, 1987.
63. G. Rozenberg, editor. The Handbook of Graph Grammars, Volume I: Foundations. World Scientific, 1996. To appear.
64. V. Sassone, M. Nielsen, and G. Winskel. Relationships between models of concurrency. In Proceedings REX ’93, 1993.
65. G. Schied. On relating Rewriting Systems and Graph Grammars to Event Structures. In H.-J. Schneider and H. Ehrig, editors, Proceedings of the Dagstuhl Seminar 9301 on Graph Transformations in Computer Science, volume 776 of LNCS, pages 326-340. Springer Verlag, 1994.
66. H.-J. Schneider. On categorical graph grammars integrating structural transformations and operations on labels. Theoret. Comput. Sci., 109:257-274, 1993.
67. H.-J. Schneider. Graph Grammars as a Tool to Define the Behaviour of Process Systems: From Petri Nets to Linda. In G. Engels and G. Rozenberg, editors, Preliminary Proceedings of the Fifth International Workshop on Graph Grammars and their Application to Computer Science, 1994.
68. H.J. Schneider. Describing distributed systems by categorial graph grammars. In 15th International Workshop on Graph-theoretic Concepts in Computer Science, volume 411 of LNCS, pages 121-135. Springer Verlag, 1990.
69. G. Taentzer. Parallel and distributed graph transformation: Formal description and application to communication-based systems. PhD thesis, Technische Universitat Berlin, 1996.
70. J.C. Wileden. Relationships between graph grammars and the design and analysis of concurrent software. In V. Claus, H. Ehrig, and G. Rozenberg, editors, Proceedings of the 1st International Workshop on Graph-Grammars and Their Application to Computer Science and Biology, volume 73 of LNCS, pages 456-463. Springer Verlag, 1979.
71. G. Winskel. Event Structures. In Petri Nets: Applications and Relationships to Other Models of Concurrency, volume 255 of LNCS, pages 325-392. Springer Verlag, 1987.
72. G. Winskel. An Introduction to Event Structures. In Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, volume 354 of LNCS, pages 325-392. Springer Verlag, 1989.