BibSonomy :: publication ::

tag user group author concept BibTeX key search:all search:minas

The blue social bookmark and publication sharing system.

entry of minas:

(0)

This publication has not been reviewed yet.

rating distribution

average user rating

The average rating is computed over all reviews. However, some of them may be invisible to you due to the visibility setting chosen by the reviewers.

(0.0 of 5.0 based on 0 reviews)

Amalgamation of graph transformations: a synchronization mechanism

by: Paul Böhm, Harald-Reto Fonio, and Annegret Habel

In: Journal of Computer and System Sciences, Vol. 34, Nr. 2-3 Orlando, FL, USA: Academic Press, Inc. (1987) , p. 377--408.

Resources (URL, PDF, PS...)

URL:	http://portal.acm.org/citation.cfm?id=29880.29888
DOI:	10.1016/0022-0000(87)90030-4

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 ämalgamated" production. The Amalgamation Theorem states that graph derivations which respect the given associations can be amalgamated to a single derivation via the ämalgamated" 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.

Description

Amalgamation of graph transformations: a synchronization mechanism

BibTeX record

@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
}

Endnote record

%0 Journal Article
%1 29888
%A B\"{o}hm, Paul
%A Fonio, Harald-Reto
%A Habel, Annegret
%C Orlando, FL, USA
%D 1987
%I Academic Press, Inc.
%J Journal of Computer and System Sciences
%K 
%N 2-3
%P 377--408
%T Amalgamation of graph transformations: a synchronization mechanism
%R http://dx.doi.org/10.1016/0022-0000(87)90030-4
%U http://portal.acm.org/citation.cfm?id=29880.29888
%V 34
%X 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).

BibSonomy :: publication ::

Amalgamation of graph transformations: a synchronization mechanism

Resources (URL, PDF, PS...)

Abstract

Description

BibTeX record

Endnote record