Danos, Vincent
Heindel, Tobias
Honorato-Zimmer, Ricardo
Stucki, Sandro
Giese, Holger
König, Barbara
Reversible Sesqui-Pushout Rewriting, Graph Transformation
Graph Transformation, 7th International Conference, ICGT 2014. Proceedings
Graph Transformation, 7th International Conference, ICGT 2014. Proceedings
Graph Transformation, 7th International Conference, ICGT 2014. Proceedings
Graph Transformation, 7th International Conference, ICGT 2014. Proceedings
16
8571
2014
2014-07-22
The paper proposes a variant of sesqui-pushout rewriting (SqPO) that allows one to develop the theory of nested application conditions (NACs) for arbitrary rule spans; this is a considerable generalisation compared with existing results for NACs, which only hold for linear rules (w.r.t. a suitable class of monos). Besides this main contribution, namely an adapted shifting construction for NACs, the paper presents a uniform commutativity result for a revised notion of independence that applies to arbitrary rules; these theorems hold in any category with (enough) stable pushouts and a class of monos rendering it weak adhesive HLR. To illustrate results and concepts, we use simple graphs, i.e. the category of binary endorelations and relation preserving functions, as it is a paradigmatic example of a category with stable pushouts; moreover, using regular monos to give semantics to NACs, we can shift NACs over arbitrary rule spans.
Springer
978-3-319-09108-2
Graph Transformation, 7th International Conference, ICGT 2014. Proceedings
Conference Papers
10.1007/978-3-319-09108-2_11