Conflict Essences for Transformation Rules with Nested Application Conditions
Conflict and dependency analysis is an important static analysis tool that provides an overview of the potential interactions of (graph) transformation rules. This analysis is based on critical pairs and initial conflicts, which represent conflicting transformations in a minimal context. However, the crucial information about a conflicting transformation pair is contained in much smaller structures, called disabling/conflict essences in existing research. Recently, we introduced disabling essences for rules with application conditions which contain the information on how an application condition can be violated by another rule. In this paper, we extend the notion of disabling essences to support not only application conditions in Alternating Quantifier Normal Form, but also arbitrary nested conditions. We introduce (symbolic) conflict essences that are constructed from disabling essences and which capture the interaction between two rules. We show that a transformation pair is parallel dependent if and only if a symbolic conflict essence can be embedded into it and relate symbolic conflict essences to initial conflicts for transformation rules with application conditions. We present our results for adhesive HLR categories, which includes several types of graph-like structures.
Thu 2 JulDisplayed time zone: Brussels, Copenhagen, Madrid, Paris change
13:30 - 15:10 | Session 5ICGT Research Papers at Petri Chair(s): Oszkár Semeráth Budapest University of Technology and Economics | ||
13:30 30mTalk | CGACell: A Cellular Automata-Based Graph Transformation Framework for Neural Pooling ICGT Research Papers Doru Constantin The National University of Science and Technology POLITEHNICA Bucharest, Pitesti University Centre, Costel Bălcău The National University of Science and Technology POLITEHNICA Bucharest, Pitesti University Centre | ||
14:00 30mTalk | Conflict Essences for Transformation Rules with Nested Application Conditions ICGT Research Papers Alexander Lauer Philipps-Universität Marburg, Jens Kosiol Brandenburgische Technische Universität Cottbus-Senftenberg, Leen Lambers Brandenburg University of Technology Cottbus-Senftenberg, Gabriele Taentzer Philipps-Universität Marburg Pre-print | ||
14:30 30mTalk | From Graph Rewriting to Markov Automata: Mass-Action Semantics for Stochastic and Probabilistic Systems ICGT Research Papers | ||