Ensuring consistency of conditional graph grammars -- a constructive approach (1995) [41 citations — 4 self]
by Reiko Heckel, Annika Wagner
Proc. of SEGRAGRA'95 "Graph Rewriting and Computation", Electronic Notes of TCS
http://pigeon.elsevier.nl/mcs/journals/tcs/pc/volume2/heckel.ps
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@INPROCEEDINGS{Heckel95ensuringconsistency,author = {Reiko Heckel and Annika Wagner},
title = {Ensuring consistency of conditional graph grammars -- a constructive approach},
booktitle = {Proc. of SEGRAGRA'95 "Graph Rewriting and Computation", Electronic Notes of TCS},
year = {1995},
pages = {2}
}
Years of Citing Articles
Abstract:
Consistency conditions describe basic properties of graphs as e.g. the existence or uniqueness of certain elements. A graph grammar is consistent if the start graph satisfies the consistency condition and the rules preserve this property. We propose a general construction that transforms global consistency conditions into preconditions for individual rules. A so-constructed rule is applicable to a consistent graph if and only if the derived graph is consistent, too. The relevance of this result is motivated by an example specification of a safety-critical system that is, a roundabout. 1
Citations
| 145 | Introduction to the algebraic theory of graph grammar – Ehrig - 1979 |
| 141 | The monadic second-order logic of graphs I: Recognizable sets of finite graphs – Courcelle - 1990 |
| 9 | Graph grammars with application conditions – Ehrig, Habel - 1986 |
| 2 | Graphische Spezifikation ausgewahlter Teile von AGG --- einem algebraischen Graphgrammatiksystem – Conrad, Gajewsky, et al. - 1995 |
