@article{29888,
  abstract = {The authors generalize the well-known Parallelism Theorem for graph derivations to the Amalgamation Theorem. In this theorem the assumption of "parallel independence" is dropped. For each pair of productions together with a relational production (allowing productions to be associated with each other) they construct a single "amalgamated" production. The Amalgamation Theorem states that graph derivations which respect the given associations can be amalgamated to a single derivation via the "amalgamated" production. The amalgamation concept is applied to synchronization of graph manipulations in a simplified railway control system as well as to a graph grammar formalism for distributed systems (GDS). },
  added-at = {2010-03-08T11:09:58.000+0100},
  address = {Orlando, FL, USA},
  author = {B\"{o}hm, Paul and Fonio, Harald-Reto and Habel, Annegret},
  biburl = {http://www.bibsonomy.org/bibtex/21f8e57ec4eb5d54508f0f745176e301e/minas},
  description = {Amalgamation of graph transformations: a synchronization mechanism},
  doi = {http://dx.doi.org/10.1016/0022-0000(87)90030-4},
  interhash = {0ff3132f4e31855eeb3cd1df890e5e30},
  intrahash = {1f8e57ec4eb5d54508f0f745176e301e},
  issn = {0022-0000},
  journal = {Journal of Computer and System Sciences},
  keywords = {1987 GraGra},
  number = {2-3},
  pages = {377--408},
  publisher = {Academic Press, Inc.},
  timestamp = {2010-03-08T11:09:58.000+0100},
  title = {Amalgamation of graph transformations: a synchronization mechanism},
  url = {http://portal.acm.org/citation.cfm?id=29880.29888},
  volume = 34,
  year = 1987
}