High-level replacement units and their termination properties

Bottoni, Paolo; Hoffmann, Kathrin; Presicce, Francesco Parisi; Taentzer, Gabriele

doi:10.1016/j.jvlc.2005.07.001

Cited by 15 publications

(11 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A simple (but weak) termination argument for graph transformation (previously considered in, among others, [1,2]) is the counting of nodes and edges. We consider a somewhat more general variant, weighted node and edge counting.…”

Section: Special Case: Node and Edge Countingmentioning

confidence: 99%

“…As mentioned in the introduction, various other works concern themselves with termination of graph transformation, more specifically, of graph transformation as a model transformation formalism. The paper [2] considers high-level replacement units (hlru), which are transformation systems with external control expressions. The paper introduces a general framework for proving termination of such hlrus, but the only concrete termination criteria considered are node and edge counting, which are subsumed by the weighted type graph method of this paper (see Sect.…”

Section: Related Workmentioning

confidence: 99%

“…Although termination is a basic notion of any computational formalism, it has not received a lot of attention in the graph transformation community; the focus is on reachability problems -the question whether a graph with some required or unwanted property is reachable from an initial graph. However, some prior work on the topic exists, mostly applied to model transformation [2,6,10]. Similar to [3] we follow a more general approach.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Termination Analysis for Graph Transformation Systems

Bruggink

König

Zantema

2014

Advanced Information Systems Engineering

View full text Add to dashboard Cite

We introduce two techniques for proving termination of graph transformation systems. We do not fix a single initial graph, but consider arbitrary initial graphs (uniform termination), but also certain sets of initial graphs (non-uniform termination). The first technique, which can also be used to show non-uniform termination, uses a weighted type graph to assign weights to graphs. The second technique reduces uniform termination of graph transformation systems of a specific form to uniform termination of cycle rewriting, a variant of string rewriting. 2 Preliminaries We first introduce graphs, morphisms, and graph transformation, in particular the double pushout approach [5]. We use edge-labeled, directed graphs.

show abstract

Section: Special Case: Node and Edge Countingmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Termination Analysis for Graph Transformation Systems

Bruggink

König

Zantema

2014

Advanced Information Systems Engineering

View full text Add to dashboard Cite

show abstract

“…In papers [19][20] [21], termination criteria have been presented. These approaches are based on layering grammars or measurement functions that control the execution order of rules.…”

Section: Related Workmentioning

confidence: 99%

Formal verification of model transformations: An automated framework

Asztalos

Madari

Vajk

et al. 2010

2010 International Joint Conference on Computational Cybernetics and Technical Informatics

View full text Add to dashboard Cite

Verification of models and model processing programs are inevitable in real world model-based software development. Model transformation developers are often interested in offline verification methods, when only the definition of the model transformation and the specification of the source and target languages are used to analyze the properties and no concrete input models are taken into account. Therefore, the results of the analysis hold for each output model not just particular ones, and we have to perform the analysis only once. Most often, formal verification of model transformations is performed manually or the methods can be applied only for a certain transformation or for the analysis of only a certain property. Previous work has presented formal and algorithmic background for a possible verification framework. Based on this background, this paper introduces a realization of an automated verification framework for graph rewriting-based model transformations. We illustrate the operation of the framework and demonstrate its applicability on a case study. Our goal is to further improve our approach in order to be able to be applied in more complex industrial solutions as well.

show abstract

“…This is based on the definition of rule refinement through rule [29] and subrule [25] morphisms. Applications are found in termination analysis [7], as well as in management of security policies [21]. In [29], an algebra of rules is defined based on rule morphisms, including operators for rule composition.…”

Section: Related Workmentioning

confidence: 99%

Enforced generative patterns for the specification of the syntax and semantics of visual languages

Bottoni

Guerra

Lara

2008

Journal of Visual Languages & Computing

Self Cite

View full text Add to dashboard Cite

Esta es la versión de autor del artículo publicado en: This is an author produced version of a paper published in:Journal of Visual Languages & Computing 19.4 (2008) AbstractWe present the new notion of enforced generative pattern, a structure that declares positive or negative conditions that must be satisfied by a model. Patterns are applied to transformation rules resulting in new rules that modify models according to the pattern specification. In the case of a negative pattern, an application condition is added to the rule. In the case of a positive one, the rule is modified to consider additional context in its left-hand side and to increase its effects. We have defined these patterns in an abstract setting, which enables their instantiation for different structures, like graphs, triple graphs and graph transformation rules.We apply the previous concepts to the specification of the syntax and semantics of visual languages. In particular, we show instantiations for: (i) graphs, with applications at the syntactical level; (ii) triple-graphs, for the coordination of syntax and static semantics; and (iii) rules, for the incremental construction of execution rules. We present some examples that illustrate the usefulness of the combination of these three instantiations. In particular, we show the specification of environments for visual languages with token-holder semantics, discrete-event semantics and communication semantics.

show abstract

High-level replacement units and their termination properties

Cited by 15 publications

References 15 publications

Termination Analysis for Graph Transformation Systems

Termination Analysis for Graph Transformation Systems

Formal verification of model transformations: An automated framework

Enforced generative patterns for the specification of the syntax and semantics of visual languages

Contact Info

Product

Resources

About