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
Hypergraph rewriting: critical pairs and undecidability of confluence
Term graph rewriting
Graph grammars with negative application conditions
Fundamenta Informaticae - Special issue on graph transformations
Handbook of graph grammars and computing by graph transformation: volume I. foundations
Handbook of graph grammars and computing by graph transformation: volume I. foundations
The expression of graph properties and graph transformations in monadic second-order logic
Handbook of graph grammars and computing by graph transformation
Term rewriting and all that
Double-pushout graph transformation revisited
Mathematical Structures in Computer Science
Graph-based specification of access control policies
Journal of Computer and System Sciences
Fundamentals of Algebraic Graph Transformation (Monographs in Theoretical Computer Science. An EATCS Series)
Correctness of high-level transformation systems relative to nested conditions†
Mathematical Structures in Computer Science
FASE'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Fundamental approaches to software engineering
Local confluence for rules with nested application conditions
ICGT'10 Proceedings of the 5th international conference on Graph transformations
Adhesivity is not enough: local church-rosser revisited
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Nested constraints and application conditions for high-level structures
Formal Methods in Software and Systems Modeling
GrGen: a fast SPO-based graph rewriting tool
ICGT'06 Proceedings of the Third international conference on Graph Transformations
Confluence of graph transformation revisited
Processes, Terms and Cycles
Fundamenta Informaticae - SPECIAL ISSUE ON ICGT 2004
Theory of Constraints and Application Conditions: From Graphs to High-Level Structures
Fundamenta Informaticae - SPECIAL ISSUE ON ICGT 2004
M,N-adhesive transformation systems
ICGT'12 Proceedings of the 6th international conference on Graph Transformations
Hi-index | 0.00 |
Graph transformation systems have been studied extensively and applied to several areas of computer science like formal language theory, the modeling of databases, concurrent or distributed systems, and visual, logical, and functional programming. In most kinds of applications it is necessary to have the possibility of restricting the applicability of rules. This is usually done by means of application conditions. In this paper, we continue the work of extending the fundamental theory of graph transformation to the case where rules may use arbitrary (nested) application conditions. More precisely, we generalize the Embedding theorem, and we study how local confluence can be checked in this context. In particular, we define a new notion of critical pair which allows us to formulate and prove a Local Confluence Theorem for the general case of rules with nested application conditions. All our results are presented, not for a specific class of graphs, but for any arbitrary ℳ-adhesive category, which means that our results apply to most kinds of graphical structures. We demonstrate our theory on the modeling of an elevator control by a typed graph transformation system with positive and negative application conditions.