Unfolding and Event Structure Semantics for Graph Grammars (1996)
Cached
Download Links
- [www.math.unipd.it]
- [www.di.unipi.it]
- [www.math.unipd.it]
- DBLP
Other Repositories/Bibliography
| Venue: | PROCEEDINGS OF THE 5TH INTERNATIONAL WORKSHOP ON GRAPH GRAMMARS AND THEIR APPLICATION TO COMPUTER SCIENCE, VOLUME 1073 OF LNCS |
| Citations: | 31 - 19 self |
BibTeX
@INPROCEEDINGS{Baldan96unfoldingand,
author = {Paolo Baldan and Andrea Corradini and Ugo Montanari},
title = {Unfolding and Event Structure Semantics for Graph Grammars },
booktitle = {PROCEEDINGS OF THE 5TH INTERNATIONAL WORKSHOP ON GRAPH GRAMMARS AND THEIR APPLICATION TO COMPUTER SCIENCE, VOLUME 1073 OF LNCS},
year = {1996},
publisher = {Springer}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We propose an unfolding semantics for graph transformation systems in the double-pushout (DPO) approach. Mimicking Winskel’s construction for Petri nets, a graph grammar is unfolded into an acyclic branching structure, that is itself a (nondeterministic occurrence) graph grammar describing all the possible computations of the original grammar. The unfolding can be abstracted naturally to a prime algebraic domain and then to an event structure semantics. We show that such event structure coincides both with the one defined by Corradini et al. [3] via a
