Algebraic approaches to graph transformation. Part I: basic concepts and double pushout approach
Handbook of graph grammars and computing by graph transformation
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
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)
Adhesive High-Level Replacement Systems: A New Categorical Framework for Graph Transformation
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
Nested constraints and application conditions for high-level structures
Formal Methods in Software and Systems Modeling
Weakest preconditions for high-level programs
ICGT'06 Proceedings of the Third international conference on Graph Transformations
An Algorithm for Approximating the Satisfiability Problem of High-level Conditions
Electronic Notes in Theoretical Computer Science (ENTCS)
Explicit State Model Checking for Graph Grammars
Concurrency, Graphs and Models
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
Analyzing Rule-Based Behavioral Semantics of Visual Modeling Languages with Maude
Software Language Engineering
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
Matrix Graph Grammars with Application Conditions
Fundamenta Informaticae
Weakest preconditions for high-level programs
ICGT'06 Proceedings of the Third international conference on Graph Transformations
Hi-index | 0.00 |
In this paper, we consider high-level structures like graphs, Petri nets, and algebraic specifications and investigate two kinds of satisfiability of conditions and two kinds of rule matching over these structures. We show that, for weak adhesive HLR categories with class ${\mathcal{A}}$ of all morphisms and a class ${\mathcal {M}}$ of monomorphisms, strictly closed under decompositions, ${\mathcal{A}}$- and ${\mathcal{M}}$-satisfiability and ${\mathcal{A}}$- and $P{\mathcal{M}}$-matching are expressively equivalent. The results are applied to the category of graphs, where ${\mathcal{M}}$ is the class of all injective graph morphisms.