@INPROCEEDINGS{BMM:PNGT2006:ESSDGG,
  title = {{Event Structure Semantics for Dynamic Graph Grammars}},
  author = {{Roberto} {Bruni} and {Hern\'an} {Melgratti} and {Ugo} {Montanari}},
  booktitle = {Proceedings of PNGT 2006, Workshop on Petri Nets and Graph Transformation},
  editor = {P. Baldan and  H. Ehrig and  J. Padberg and  G. Rozenberg},
  abstract = {Dynamic graph grammars (DGGs) are a reflexive extension of Graph Grammars that have been introduced to represent mobile reflexive systems and calculi at a convenient level of abstraction. Persistent graph grammars (PGGs) are a class of graph grammars that admits a fully satisfactory concurrent semantics thanks to the fact that all so-called asymmetric conflicts (between items that are read by some productions and consumed by other) are avoided. In this paper we introduce a slight variant of DGGs, called persistent dynamic graph grammars (PDGGs), that can be encoded in PGGs preserving concurrency. Finally, PDGGs are exploited to define a concurrent semantics for the join calculus enriched with persistent messaging (if preferred, the latter can be naively seen as dynamic nets with read arcs).},
  publisher = {EASST},
  series = {Electronic Communications of the EASST},
  volume = {2},
  year = {2007},
  url = {http://www.di.unipi.it/~bruni/publications/pngt2006.pdf.gz},
  keywords = {graph transformation},
  partner = {PISA},
  status = {public},
  task = {T3.3, T7.1},
}