2018
DOI: 10.1007/978-3-319-75396-6_1
|View full text |Cite
|
Sign up to set email alerts
|

On the Essence of Parallel Independence for the Double-Pushout and Sesqui-Pushout Approaches

Abstract: Parallel independence between transformation steps is a basic notion in the algebraic approaches to graph transformation, which is at the core of some static analysis techniques like Critical Pair Analysis. We propose a new categorical condition of parallel independence and show its equivalence with two other conditions proposed in the literature, for both left-linear and non-left-linear rules. Next we present some preliminary experimental results aimed at comparing the three conditions with respect to computa… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
21
0

Year Published

2018
2018
2021
2021

Publication Types

Select...
6
1

Relationship

2
5

Authors

Journals

citations
Cited by 11 publications
(21 citation statements)
references
References 21 publications
0
21
0
Order By: Relevance
“…the cloning and fusing of vertices in graphs), this most general case is left for future work.SqPO Rewriting: Concurrency, Associativity and Rule Algebra Framework adhesive categories (see Assumption 1) in order to ensure certain technical properties necessary for our concurrency and associativity theorems to hold. To the best of our knowledge, apart from some partial results in the direction of developing a concurrency theorem for SqPO-type rewriting in [16,36,15], prior to this work neither of the aforementioned theorems had been available in the SqPO framework.Associativity of SqPO rewriting theories plays a pivotal role in our development of a novel form of concurrent semantics for these theories, the so-called SqPO-type rule algebras. Previous work on associative DPO-type rewriting theories [3, 5, 7] (see also [8]) has led to a category-theoretical understanding of associativity that may be suitably extended to the SqPO setting.…”
mentioning
confidence: 99%
“…the cloning and fusing of vertices in graphs), this most general case is left for future work.SqPO Rewriting: Concurrency, Associativity and Rule Algebra Framework adhesive categories (see Assumption 1) in order to ensure certain technical properties necessary for our concurrency and associativity theorems to hold. To the best of our knowledge, apart from some partial results in the direction of developing a concurrency theorem for SqPO-type rewriting in [16,36,15], prior to this work neither of the aforementioned theorems had been available in the SqPO framework.Associativity of SqPO rewriting theories plays a pivotal role in our development of a novel form of concurrent semantics for these theories, the so-called SqPO-type rule algebras. Previous work on associative DPO-type rewriting theories [3, 5, 7] (see also [8]) has led to a category-theoretical understanding of associativity that may be suitably extended to the SqPO setting.…”
mentioning
confidence: 99%
“…In this paper, we contribute to this research thread by proposing a new characterization for the root causes of conflicts, called conflict essences, based on a recently proposed characterization of parallel independence [3]. In any adhesive category with strict initial object we show that having an empty conflict essence is equivalent to parallel independence, and that conflict essences are smaller than conflict reasons.…”
Section: Introductionmentioning
confidence: 94%
“…We start introducing parallel independence according to the so-called essential definition [3]. Definition 19 (Parallel Independence).…”
Section: The Essence Of Conflicting Transformationsmentioning
confidence: 99%
“…Intuitively, two rule applications starting from the same graph are parallel independent if they can be sequentialized arbitrarily with isomorphic results. This property is captured categorically by the following definition [5].…”
Section: Definition 2 (Graph Transformation Systemmentioning
confidence: 99%
“…As discussed in [5], this definition is equivalent to others proposed in literature, but does not need to compute the pushout complements to be checked.…”
Section: Definition 2 (Graph Transformation Systemmentioning
confidence: 99%