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
Proceedings of the 24th International Conference on Software Engineering
VL '00 Proceedings of the 2000 IEEE International Symposium on Visual Languages (VL'00)
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)
Efficient Conflict Detection in Graph Transformation Systems by Essential Critical Pairs
Electronic Notes in Theoretical Computer Science (ENTCS)
Efficient Detection of Conflicts in Graph-based Model Transformation
Electronic Notes in Theoretical Computer Science (ENTCS)
Transformations in Reconfigurable Place/Transition Systems
Concurrency, Graphs and Models
High-Level Programs and Program Conditions
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Sufficient Criteria for Consistent Behavior Modeling with Refined Activity Diagrams
MoDELS '08 Proceedings of the 11th international conference on Model Driven Engineering Languages and Systems
A formal framework for developing adaptable service-based applications
FASE'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Fundamental approaches to software engineering
DPO transformation with open maps
ICGT'12 Proceedings of the 6th international conference on Graph Transformations
Hi-index | 0.00 |
The goal of this paper is the generalization of parallelism and concurrency results for adhesive High-Level Replacement (HLR) systems to adhesive HLR systems with negative application conditions. These conditions restrict the application of a rule by expressing that a specific structure should not be present before or after applying the rule to a certain context. Such a condition influences thus each rule application or transformation and therefore changes significantly the properties of the replacement system. The effect of negative application conditions on parallelism and concurrency in the replacement system is described in the generalization of the following results, formulated already for adhesive HLR systems without negative application conditions: Local Church-Rosser Theorem, Parallelism Theorem and Concurrency Theorem. These important generalized results will support the development of formal analysis techniques for adhesive HLR systems with negative application conditions.