Handbook of graph grammars and computing by graph transformation: volume I. foundations
Handbook of graph grammars and computing by graph transformation: volume I. foundations
Algebraic approaches to graph transformation. Part I: basic concepts and double pushout approach
Handbook of graph grammars and computing by graph transformation
Termination of graph rewriting is undecidable
Fundamenta Informaticae
Handbook of graph grammars and computing by graph transformation: vol. 3: concurrency, parallelism, and distribution
Handbook of graph grammars and computing by graph transformation: vol. 2: applications, languages, and tools
The AGG approach: language and environment
Handbook of graph grammars and computing by graph transformation
Graph transformation units and modules
Handbook of graph grammars and computing by graph transformation
Graph rewrite systems for program optimization
ACM Transactions on Programming Languages and Systems (TOPLAS)
More About Control Conditions for Transformation Units
TAGT'98 Selected papers from the 6th International Workshop on Theory and Application of Graph Transformations
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Termination of High-Level Replacement Units with Application to Model Transformation
Electronic Notes in Theoretical Computer Science (ENTCS)
Termination criteria for model transformation
FASE'05 Proceedings of the 8th international conference, held as part of the joint European Conference on Theory and Practice of Software conference on Fundamental Approaches to Software Engineering
Graph transformation units guided by a sat solver
ICGT'10 Proceedings of the 5th international conference on Graph transformations
| Hi-index | 0.00 |
Graph transformation units are an approach-independent concept for programming by applying rules and imported transformation units to graphs, starting in an initial and ending in a terminal graph. This transformation process has to obey a so-called control condition, i.e. the device to select how rules or imported transformation units are to be combined in the transformation process executed by the unit. While the other parts of a unit may simply be required to be computable, this is too restrictive for control conditions. In this paper, we show that the semantics of certain control conditions is in general undecidable already when a single imported transformation unit occurs in the condition, and discuss the consequences for programming with graph transformation units.