Formal languages
Amalgamation of graph transformations: a synchronization mechanism
Journal of Computer and System Sciences
Abstract and concrete categories
Abstract and concrete categories
On structured graph grammars. II
Information Sciences: an International Journal
Institutions: abstract model theory for specification and programming
Journal of the ACM (JACM)
Parallel and distributed derivations in the single-pushout approach
Theoretical Computer Science - Special issue on selected papers of the International Workshop on Computing by Graph Transformation, Bordeaux, France, March 21–23, 1991
Algebraic approach to single-pushout graph transformation
Theoretical Computer Science - Special issue on selected papers of the International Workshop on Computing by Graph Transformation, Bordeaux, France, March 21–23, 1991
Computing with graph rewriting systems with priorities
Theoretical Computer Science
Hyperedge Replacement: Grammars and Languages
Hyperedge Replacement: Grammars and Languages
Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
Proceedings of the International Workshop on Graph-Grammars and Their Application to Computer Science and Biology
Introduction to the Algebraic Theory of Graph Grammars (A Survey)
Proceedings of the International Workshop on Graph-Grammars and Their Application to Computer Science and Biology
Characterization of graph classes by forbidden structures and reductions
Proceedings of the 2nd International Workshop on Graph-Grammars and Their Application to Computer Science
PROGRESS: A VHL-Language Based on Graph Grammars
Proceedings of the 4th International Workshop on Graph-Grammars and Their Application to Computer Science
Five Facets of Hyperedge Replacement Beyond Context-Freeness
FCT '93 Proceedings of the 9th International Symposium on Fundamentals of Computation Theory
IJCAI'69 Proceedings of the 1st international joint conference on Artificial intelligence
Pair grammars, graph languages and string-to-graph translations
Journal of Computer and System Sciences
Conditional Graph Rewriting as a Domain-Independent Formalism for Software Evolution
AGTIVE '99 Proceedings of the International Workshop on Applications of Graph Transformations with Industrial Relevance
A transformation-based approach to context-aware modelling
Software and Systems Modeling (SoSyM)
Hi-index | 0.00 |
In each graph-grammar approach it is defined how and under which conditions graph productions can be applied to a given graph in order to obtain a derived graph. The conditions under which productions can be applied are called application conditions. Although the generative power of most of the known general graph-grammar approaches is sufficient to generate any recursively enumerable set of graphs, it is often convenient to have specific application conditions for each production. Such application conditions, on the one hand, include context conditions like the existence or non-existence of nodes, edges, or certain subgraphs in the given graph as well as embedding restrictions concerning the morphisms from the left-hand side of the production to the given graph. In this paper, the concept of application conditions introduced by Ehrig and Habel is restricted to contextual conditions, especially negative ones. In addition to the general concept, we state local confluence and the Parallelism Theorem for derivations with application conditions. Finally we study context-free graph grammars with application conditions with respect to their generative power.