Constraints and Application Conditions: From Graphs to High-Level Structures

Ehrig, Hartmut; Ehrig, Karsten; Habel, Annegret; Pennemann, Karl-Heinz

doi:10.1007/978-3-540-30203-2_21

Cited by 55 publications

(91 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In graph-based modelling (and meta-modelling), graphs are used to define the static structures, such as class and object ones, which represent visual alphabets and sentences over them. We formalise our approach using the typed graph transformation approach, specifically the Double Pushout (DPO) algebraic approach, with positive and negative (nested) application conditions [11,23]. We however carry on our formalisation for weak adhesive high-level replacement (HLR) categories [12].…”

Section: Graph Transformation and Adhesive Hlr Categoriesmentioning

confidence: 99%

Behaviour Protection in Modular Rule-Based System Specifications

Durán

Orejas

Zschaler

2013

Recent Trends in Algebraic Development Techniques

View full text Add to dashboard Cite

Abstract. Model-driven engineering (MDE) and, in particular, the notion of domain-specific modelling languages (DSMLs) is an increasingly popular approach to systems development. DSMLs are particularly interesting because they allow encoding domain-knowledge into a modelling language and enable full code generation and analysis based on high-level models. However, as a result of the domain-specificity of DSMLs, there is a need for many such languages. This means that their use only becomes economically viable if the development of new DSMLs can be made efficient. One way to achieve this is by reusing functionality across DSMLs. On this background, we are working on techniques for modularising DSMLs into reusable units. Specifically, we focus on DSMLs whose semantics are defined through in-place model transformations. In this paper, we present a formal framework of morphisms between graph-transformation systems (GTSs) that allow us to define a novel technique for conservative extensions of such DSMLs. In particular, we define different behaviour-aware GTS morphisms and prove that they can be used to define conservative extensions of a GTS.

show abstract

Section: Graph Transformation and Adhesive Hlr Categoriesmentioning

confidence: 99%

Behaviour Protection in Modular Rule-Based System Specifications

Durán

Orejas

Zschaler

2013

Recent Trends in Algebraic Development Techniques

View full text Add to dashboard Cite

show abstract

“…We apply well-known techniques, e.g., for transforming constraints to sufficient and necessary application conditions [4], which have already been shown in previous work [1,8] to be applicable in general to TGGs.…”

Section: Introductionmentioning

confidence: 99%

A Static Analysis of Non-confluent Triple Graph Grammars for Efficient Model Transformation

Anjorin

Leblebici

Schürr

et al. 2014

Graph Transformation

View full text Add to dashboard Cite

Abstract. Triple Graph Grammars (TGGs) are a well-known bidirectional model transformation language. All actively developed TGG tools pose restrictions to guarantee efficiency (polynomial runtime), without compromising formal properties. Most tools demand confluence of the TGG, meaning that a choice between applicable rules can be freely made without affecting the final result of a transformation. This is, however, a strong restriction for transformations with inherent degrees of freedom that should not be limited at design time. eMoflon is a TGG tool that supports non-confluent TGGs, allowing different results depending on runtime choices. To guarantee efficiency, nonetheless, a local choice of the next source element to be translated, based on source context dependencies of the rules, must not lead to a dead end, i.e., to a state where no rule is applicable for the currently chosen source element to be translated, and the transformation is not yet complete. Our contribution in this paper is to formalize a corresponding property, referred to as local completeness, using graph constraints. Based on the well-known transformation of constraints to application conditions, we present a static analysis that guarantees dead end-freeness for non-confluent TGGs.

show abstract

“…The idea of the transformation A is a case differentiation of all possible overlappings of the additional elements in codom(m) with the elements in the objects of the condition c. Transformation A generalizes the corresponding construction for "basic conditions" in [EEHP06], first described for graphs in [HW95]. At first view, it is similar to the construction of Theorem 3.12, but most importantly, as m ∈ M, the pushout is guaranteed to exist.…”

Section: Basic Transformations On Conditionsmentioning

confidence: 99%

“…Shortly thereafter, conditions for graphs of the form ∀(I ֒→ P, ∃(P → C)) were introduced as graph consistency constraints in [HW95]. The concepts of graph constraints and application conditions of [HW95] were lifted to weak adhesive HLR categories in [EEHP06,EEHP04], and, unified and generalized to nested conditions in [Ren04a] for edge-labeled graphs (without parallel edges) and in [Pen04,HP05] for weak adhesive HLR categories.…”

Section: ∃( )mentioning

confidence: 99%

See 1 more Smart Citation

Development of Correct Graph Transformation Systems

Pennemann

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Graph transformation has many application areas in computer science, such as software engineering or the design of concurrent and distributed systems. Being a visual modeling technique, graph transformation has the potential to play a decisive role in the development of increasingly larger and complex systems. However, the use of visual modeling techniques alone does not guarantee the correctness of a design. In context of rising standards for trustworthy systems, there is a growing need for the verification of graph transformation systems and programs. The research of appropriate methods for this purpose is the topic of this thesis.The primary goal is to obtain the capability to decide graphical program specifications. These specifications consists of a graphical precondition, a graph program, and a graphical postcondition. As usual, such a specification is said to be correct, if all those system states satisfy the postcondition that are reachable by applying the program on a start state satisfying the precondition. In the considered programs, the selection, deletion, addition and deselection of a graph's nodes and edges are the elementary constructs that can be composed to more complex programs by non-deterministic choice, sequential composition and iteration. The resulting programming language is computationally complete and is able to model transactions that deal with an unbounded number of nodes and edges. As language for the specification of state properties, graph conditions are investigated and used. We show that graph conditions provide an intuitive formalism for first-order structural properties and are suited to infer knowledge about the behavior of graph transformation systems and programs.According to Dijkstra, the correctness of program specifications can be shown by constructing a weakest precondition of the program relative to the postcondition and checking whether the specified precondition implies the weakest precondition. Hence the correctness problem of program specifications is reduced to an implication problem of conditions. In this thesis, it is shown how to construct weakest preconditions for graph programs and graph conditions. Following a dual approach, a sound and complete satisfiability iv Development of Correct Graph Transformation Systems algorithm for graph conditions is investigated and a fragment of conditions is identified, for which the algorithm decides. On the other hand, a resolutionbased calculus for graph conditions is presented and its soundness is proven. Implementations of the aforementioned deciders for conditions are compared with existing theorem provers and satisfiability solvers for first-order logic by verifying three case studies: a railroad control, an access control for computer systems, and, as an external example, a car platoon maneuver protocol.The research is done within the framework of the so-called weak adhesive high-level replacement categories. Therefore, the results will be applicable to different kinds of graph replacement systems and Petri n...

show abstract

Constraints and Application Conditions: From Graphs to High-Level Structures

Cited by 55 publications

References 11 publications

Behaviour Protection in Modular Rule-Based System Specifications

Behaviour Protection in Modular Rule-Based System Specifications

A Static Analysis of Non-confluent Triple Graph Grammars for Efficient Model Transformation

Development of Correct Graph Transformation Systems

Contact Info

Product

Resources

About