Granularity of conflicts and dependencies in graph transformation systems: A two-dimensional approach

Lambers, Leen; Born, Kristopher; Kosiol, Jens; Strüber, Daniel; Taentzer, Gabriele

doi:10.1016/j.jlamp.2018.11.004

Cited by 12 publications

(21 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It would be interesting to investigate in which use cases initial conflicts (or critical pairs) are useful already as symbolic transformation pairs, and in which use cases we rather need to consider unfoldings indeed. This is in line with the research on multi-granular conflict detection [3,18,24] investigating different levels of granularity that can be interesting from the point of view of applying conflict detection to different use cases. Finally, we plan to investigate conflict detection in the light of initial conflict theory for attributed graph transformation [5,13,16], and in particular the case of rules with so-called attribute conditions more specifically.…”

Section: Discussionsupporting

confidence: 80%

See 1 more Smart Citation

Initial Conflicts for Transformation Rules with Nested Application Conditions

Lambers

Orejas

2020

Graph Transformation

Self Cite

View full text Add to dashboard Cite

We extend the theory of initial conflicts in the framework of M-adhesive categories to transformation rules with ACs. We first show that for rules with ACs, conflicts are in general neither inherited from a bigger context any more, nor is it possible to find a finite and complete subset of finite conflicts as illustrated for the category of graphs. We define initial conflicts to be special so-called symbolic transformation pairs, and show that they are minimally complete (and in the case of graphs also finite) in this symbolic way. We show that initial conflicts represent a proper subset of critical pairs again. We moreover demonstrate that (analogous to the case of rules without ACs) for each conflict a unique initial conflict exists representing it. We conclude with presenting a sufficient condition illustrating important special cases for rules with ACs, where we do not only have initial conflicts being complete in a symbolic way, but also find complete (and in the case of graphs also finite) subsets of conflicts in the classical sense.

show abstract

Section: Discussionsupporting

confidence: 80%

“…A recent line of work concentrates on the development of multi-granular conflict detection techniques [3,18,24]. An extensive literature survey shows [24] that conflict detection is used at different levels of granularity depending on its application field.…”

Section: Related Workmentioning

confidence: 99%

Initial Conflicts for Transformation Rules with Nested Application Conditions

Lambers

Orejas

2020

Graph Transformation

Self Cite

View full text Add to dashboard Cite

show abstract

“…The rules would describe forbidden and intended flows of information between different actors. Second, we aim to apply a formally based conflict detection technique [37,38], which can discover all possible conflicts arising for a set of rules.…”

Section: Discussionmentioning

confidence: 99%

A semi-automated BPMN-based framework for detecting conflicts between security, data-minimization, and fairness requirements

et al. 2020

Self Cite

View full text Add to dashboard Cite

Requirements are inherently prone to conflicts. Security, data-minimization, and fairness requirements are no exception. Importantly, undetected conflicts between such requirements can lead to severe effects, including privacy infringement and legal sanctions. Detecting conflicts between security, data-minimization, and fairness requirements is a challenging task, as such conflicts are context-specific and their detection requires a thorough understanding of the underlying business processes. For example, a process may require anonymous execution of a task that writes data into a secure data storage, where the identity of the writer is needed for the purpose of accountability. Moreover, conflicts not arise from trade-offs between requirements elicited from the stakeholders, but also from misinterpretation of elicited requirements while implementing them in business processes, leading to a non-alignment between the data subjects' requirements and their specifications. Both types of conflicts are substantial challenges for conflict detection. To address these challenges, we propose a BPMN-based framework that supports: (i) the design of business processes considering security, data-minimization and fairness requirements, (ii) the encoding of such requirements as reusable, domain-specific patterns, (iii) the checking of alignment between the encoded requirements and annotated BPMN models based on these patterns, and (iv) the detection of conflicts between the specified requirements in the BPMN models based on a catalog of domain-independent anti-patterns. The security requirements were reused from SecBPMN2, a security-oriented BPMN 2.0 extension, while the fairness and data-minimization parts are new. For formulating our patterns and anti-patterns, we extended a graphical query language called SecBPMN2-Q. We report on the feasibility and the usability of our approach based on a case study featuring a healthcare management system, and an experimental user study.

show abstract

“…This allows us to present our analysis technique in the language of conflicts and dependencies which has been developed to characterise the possible interactions between rule applications [8,24]. As a bonus, since the efficient detection of such conflicts and dependencies has been the focus of recent theoretical and practical research [17,18], we obtain tool support for an automated analysis based on Henshin.…”

Section: Static Analysis For Direct Consistency Sustainment and Impromentioning

confidence: 99%

Graph Consistency as a Graduated Property

Kosiol

Strüber

Taentzer

et al. 2020

Graph Transformation

Self Cite

View full text Add to dashboard Cite

Where graphs are used for modelling and specifying systems, consistency is an important concern. To be a valid model of a system, the graph structure must satisfy a number of constraints. To date, consistency has primarily been viewed as a binary property: a graph either is or is not consistent with respect to a set of graph constraints. This has enabled the definition of notions such as constraint-preserving and constraint-guaranteeing graph transformations. Many practical applications-for example model repair or evolutionary search-implicitly assume a more graduated notion of consistency, but without an explicit formalisation only limited analysis of these applications is possible. In this paper, we introduce an explicit notion of consistency as a graduated property, depending on the number of constraint violations in a graph. We present two new characterisations of transformations (and transformation rules) enabling reasoning about the gradual introduction of consistency: while consistency-sustaining transformations do not decrease the consistency level, consistency-improving transformations strictly reduce the number of constraint violations. We show how these new definitions refine the existing concepts of constraint-preserving and constraint-guaranteeing transformations. To support a static analysis based on our characterisations, we present criteria for deciding which form of consistency ensuring transformations is induced by the application of a transformation rule. We illustrate our contributions in the context of an example from search-based model engineering.

show abstract

Granularity of conflicts and dependencies in graph transformation systems: A two-dimensional approach

Cited by 12 publications

References 6 publications

Initial Conflicts for Transformation Rules with Nested Application Conditions

Initial Conflicts for Transformation Rules with Nested Application Conditions

A semi-automated BPMN-based framework for detecting conflicts between security, data-minimization, and fairness requirements

Graph Consistency as a Graduated Property

Contact Info

Product

Resources

About