Hypergraph rewriting: critical pairs and undecidability of confluence
Term graph rewriting
Graph grammars with negative application conditions
Fundamenta Informaticae - Special issue on graph transformations
Algebraic approaches to graph transformation. Part I: basic concepts and double pushout approach
Handbook of graph grammars and computing by graph transformation
Handbook of graph grammars and computing by graph transformation
A graph-based formalism for RBAC
ACM Transactions on Information and System Security (TISSEC)
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
Describing Policies with Graph Constraints and Rules
ICGT '02 Proceedings of the First International Conference on Graph Transformation
Double-pushout graph transformation revisited
Mathematical Structures in Computer Science
Graph-based specification of access control policies
Journal of Computer and System Sciences
Adhesive High-Level Replacement Systems: A New Categorical Framework for Graph Transformation
Fundamenta Informaticae - SPECIAL ISSUE ON ICGT 2004
Fundamenta Informaticae - SPECIAL ISSUE ON ICGT 2004
Consistency checking and visualization of OCL constraints
UML'00 Proceedings of the 3rd international conference on The unified modeling language: advancing the standard
Nested constraints and application conditions for high-level structures
Formal Methods in Software and Systems Modeling
Adhesive High-Level Replacement Systems: A New Categorical Framework for Graph Transformation
Fundamenta Informaticae - SPECIAL ISSUE ON ICGT 2004
Visual Specification of Metrics for Domain Specific Visual Languages
Electronic Notes in Theoretical Computer Science (ENTCS)
An Algorithm for Approximating the Satisfiability Problem of High-level Conditions
Electronic Notes in Theoretical Computer Science (ENTCS)
On the relationship of model transformations based on triple and plain graph grammars
Proceedings of the third international workshop on Graph and model transformations
Explicit State Model Checking for Graph Grammars
Concurrency, Graphs and Models
High-Level Programs and Program Conditions
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Resolution-Like Theorem Proving for High-Level Conditions
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Development of Correct Graph Transformation Systems
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Correctness of high-level transformation systems relative to nested conditions†
Mathematical Structures in Computer Science
CSP(M): Constraint Satisfaction Problem over Models
MODELS '09 Proceedings of the 12th International Conference on Model Driven Engineering Languages and Systems
Information and Software Technology
Synthesis of OCL pre-conditions for graph transformation rules
ICMT'10 Proceedings of the Third international conference on Theory and practice of model transformations
Local confluence for rules with nested application conditions
ICGT'10 Proceedings of the 5th international conference on Graph transformations
Formalizing model consistency based on the abstract syntax
Proceedings of the 3rd ACM SIGCHI symposium on Engineering interactive computing systems
Satisfiability of high-level conditions
ICGT'06 Proceedings of the Third international conference on Graph Transformations
Weakest preconditions for high-level programs
ICGT'06 Proceedings of the Third international conference on Graph Transformations
Dynamic constraint satisfaction problems over models
Software and Systems Modeling (SoSyM)
Hi-index | 0.00 |
Graph constraints and application conditions are most important for graph grammars and transformation systems in a large variety of application areas. Although different approaches have been presented in the literature already there is no adequate theory up to now which can be applied to different kinds of graphs and high-level structures. In this paper, we introduce a general notion of graph constraints and application conditions and show under what conditions the basic results can be extended from graph transformation to high-level replacement systems. In fact, we use the new framework of adhesive HLR categories recently introduced as combination of HLR systems and adhesive categories. Our main results are the transformation of graph constraints into right application conditions and the transformation from right to left application conditions in this new framework. The transformations are illustrated by a railroad control system with rail net constraints and application conditions.