Graph Grammars 1994: Graph Grammars and Their Application to Computer Science pp 240-256 | Cite as
An event structure semantics for graph grammars with parallel productions
Abstract
We propose a truly concurrent semantics for graph grammars, based on event structures, that generalizes to arbitrary consuming grammars (i.e., such that each production deletes some items) the semantics presented in [4] for the subclass of safe grammars. Also, parallel derivations are explicitly considered, instead of sequential ones only as in [4]. The “domain” and the “event structure” of a grammar are introduced independently, and one main result shows that they are strongly related, since the domain is the domain of finite configurations of the event structure. Another important result provides an abstract characterization of when two (parallel) graph derivations should be considered as equivalent from a true-concurrency perspective.
Keywords
Partial Order Event Structure Direct Derivation Graph Grammar Parallel ProductionPreview
Unable to display preview. Download preview PDF.
References
- 1.M.A. Bednarczyk, Categories of asynchronous systems, Ph.D. Thesis, University of Sussex, Report no. 1/88, 1988.Google Scholar
- 2.A. Corradini, H. Ehrig, M. Löwe, U. Montanari and F. Rossi, Note on Standard Representation of Graphs and Graph Derivations, in [17], 104–118. (Also as Technical Report “Bericht-Nr. 92-25”, Technische Universität Berlin, Fachbereich 20 Informatik, 1992.)Google Scholar
- 3.A. Corradini, H. Ehrig, M. Löwe, U. Montanari and F. Rossi, Abstract Graph Derivations in the Double Pushout Approach, in [17], 86–103.Google Scholar
- 4.A. Corradini, H. Ehrig, M. Löwe, U. Montanari and F. Rossi, An Event Structure Semantics for Safe Graph Grammars, in Programming Concepts, Methods and Calculi, E.-R. Olderog (ed.), IFIP Transactions A-56, North-Holland, 1994, 423–444.Google Scholar
- 5.A. Corradini, H. Ehrig, M. Löwe, U. Montanari and F. Rossi, Algebraic Approach to Graph Transformation II: Models of Computation in the Double Pushout Approach, submitted, 1995.Google Scholar
- 6.A. Corradini, U. Montanari and F. Rossi, Graph Processes, to appear in Fundamenta Informaticae, 1995.Google Scholar
- 7.A. Corradini, Concurrent computing: From Petri nets to graph grammars, in Proceedings SEGRAGRA '95, Electronic Notes in Theoretical Computer Science, Volume 2, URL: http://www.elsevier.nl/locate/entcs/volume2.html.Google Scholar
- 8.H. Ehrig, Tutorial introduction to the algebraic approach of graph-grammars, LNCS 291, Springer-Verlag, 1987, 3–14.Google Scholar
- 9.H. Ehrig, A. Habel, H.-J. Kreowski, F. Parisi-Presicce, Parallelism and Concurrency in High-Level Replacement Systems, in Mathematical Structures in Computer Science, 1, 1991, 361–404.Google Scholar
- 10.H. Ehrig, M. Pfender, H.J. Schneider, Graph-grammars: an algebraic approach, Proc, IEEE Conf. on Automata and Switching Theory, 1973, 167–180.Google Scholar
- 11.H.-J. Kreowski, Manipulationen von Graphmanipulationen, Ph.D. Thesis, Technische Universität Berlin, 1977.Google Scholar
- 12.H.-J. Kreowski, Is parallelism already concurrency? Part 1: Derivations in graph grammars, LNCS 291, Springer-Verlag, 1987, 343–360.Google Scholar
- 13.S. Mac Lane, Categories for the working mathematician, Springer Verlag, 1971.Google Scholar
- 14.J. Meseguer, U. Montanari, and V. Sassone, On the semantics of Petri Nets, in Proceedings CONCUR '92, LNCS 630, 286–301.Google Scholar
- 15.W. Reisig, Petri Nets: An Introduction, EATCS Monographs on Theoretical Computer Science, Springer-Verlag, 1985.Google Scholar
- 16.G. Schied, On relating Rewriting Systems and Graph Grammars to Event Structures, in [17], 326–340.Google Scholar
- 17.H.J. Schneider and H. Ehrig (Eds.), Proceedings of the Dagstuhl Seminar 9301 on Graph Transformations in Computer Science, LNCS 776, Springer-Verlag, 1994.Google Scholar
- 18.V. Sassone, M. Nielsen and G. Winskel, A classification of models for concurrency, in Proceedings CONCUR '93, LNCS 715, Springer-Verlag, 1993, 82–96.Google Scholar
- 19.G. Winskel, An Introduction to Event Structures, in Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, LNCS 354, Springer-Verlag, 1989, 364–397.Google Scholar