250 research outputs found
Simulating Multigraph Transformations Using Simple Graphs
Application of graph transformations for software verification and model transformation is an emergent field of research. In particular, graph transformation approaches provide a natural way of modelling object oriented systems and semantics of object-oriented languages.\ud
\ud
There exist a number of tools for graph transformations that are often specialised in a particular kind of graphs and/or graph transformation approaches, depending on the desired application domain. The main drawback of this diversity is the lack of interoperability.\ud
\ud
In this paper we show how (typed) multigraph production systems can be translated into (typed) simple-graph production systems. The presented construction enables the use of multigraphs with DPO transformation approach in tools that only support simple graphs with SPO transformation approach, e.g. the GROOVE tool
Improved Conflict Detection for Graph Transformation with Attributes
In graph transformation, a conflict describes a situation where two
alternative transformations cannot be arbitrarily serialized. When enriching
graphs with attributes, existing conflict detection techniques typically report
a conflict whenever at least one of two transformations manipulates a shared
attribute. In this paper, we propose an improved, less conservative condition
for static conflict detection of graph transformation with attributes by
explicitly taking the semantics of the attribute operations into account. The
proposed technique is based on symbolic graphs, which extend the traditional
notion of graphs by logic formulas used for attribute handling. The approach is
proven complete, i.e., any potential conflict is guaranteed to be detected.Comment: In Proceedings GaM 2015, arXiv:1504.0244
A Graph Grammar for Modelling RNA Folding
We propose a new approach for modelling the process of RNA folding as a graph
transformation guided by the global value of free energy. Since the folding
process evolves towards a configuration in which the free energy is minimal,
the global behaviour resembles the one of a self-adaptive system. Each RNA
configuration is a graph and the evolution of configurations is constrained by
precise rules that can be described by a graph grammar.Comment: In Proceedings GaM 2016, arXiv:1612.0105
Towards an embedding of Graph Transformation in Intuitionistic Linear Logic
Linear logics have been shown to be able to embed both rewriting-based
approaches and process calculi in a single, declarative framework. In this
paper we are exploring the embedding of double-pushout graph transformations
into quantified linear logic, leading to a Curry-Howard style isomorphism
between graphs and transformations on one hand, formulas and proof terms on the
other. With linear implication representing rules and reachability of graphs,
and the tensor modelling parallel composition of graphs and transformations, we
obtain a language able to encode graph transformation systems and their
computations as well as reason about their properties
Redundancy and subsumption in high-level replacement systems
System verification in the broadest sense deals with those semantic
properties that can be decided or deduced by analyzing a syntactical
description of the system. Hence, one may consider the notions of
redundancy and subsumption in this context as they are known from the
area of rule-based systems. A rule is redundant if it can be removed
without affecting the semantics of the system; it is subsumed by
another rule if each application of the former one can be replaced by
an application of the latter one with the same effect. In this paper,
redundancy and subsumption are carried over from rule-based systems to
high-level replacement systems, which in turn generalize graph and
hypergraph grammars. The main results presented in this paper are a
characterization of subsumption and a sufficient condition for
redundancy, which involves composite productions.Postprint (published version
Modeling and Reasoning over Distributed Systems using Aspect-Oriented Graph Grammars
Aspect-orientation is a relatively new paradigm that introduces abstractions
to modularize the implementation of system-wide policies. It is based on a
composition operation, called aspect weaving, that implicitly modifies a base
system by performing related changes within the system modules. Aspect-oriented
graph grammars (AOGG) extend the classic graph grammar formalism by defining
aspects as sets of rule-based modifications over a base graph grammar. Despite
the advantages of aspect-oriented concepts regarding modularity, the implicit
nature of the aspect weaving operation may also introduce issues when reasoning
about the system behavior. Since in AOGGs aspect weaving is characterized by
means of rule-based rewriting, we can overcome these problems by using known
analysis techniques from the graph transformation literature to study aspect
composition. In this paper, we present a case study of a distributed
client-server system with global policies, modeled as an aspect-oriented graph
grammar, and discuss how to use the AGG tool to identify potential conflicts in
aspect weaving
Repotting the Geraniums: On Nested Graph Transformation Rules
We propose a scheme for rule amalgamation based on nested graph predicates. Essentially, we extend all the graphs in such a predicate with right hand sides. Whenever such an enriched nested predicate matches (i.e., is satisfied by) a given host graph, this results in many individual match morphisms, and thus many “small” rule applications. The total effect is described by the amalgamated rule. This makes for a smooth, uniform and very powerful amalgamation scheme, which we demonstrate on a number of examples. Among the examples is the following, which we believe to be inexpressible in very few other parallel rule formalism proposed in the literature: repot all flowering geraniums whose pots have cracked.\u
Algebraic transformation of unary partial algebras II: Single-pushout approach
AbstractThe single-pushout approach to graph transformation is extended to the algebraic transformation of partial many-sorted unary algebras. Such a generalization has been motivated by the need to model the transformation of structures which are richer and more complex than graphs and hypergraphs.The main result presented in this article is an algebraic characterization of the single-pushout transformation in the categories of all conformisms, all closed quomorphisms, and all closed-domain closed quomorphisms of unary partial algebras over a given signature, together with a corresponding operational characterization that may serve as a basis for implementation.Moreover, all three categories are shown to satisfy all of the HLR (high-level replacement) conditions for parallelism, taking as occurrences the total morphisms in each category. Another important result presented in this article is the definition of HLR conditions for amalgamation, which are also satisfied by the categories of partial homomorphisms considered here, taking again the corresponding total morphisms as occurrences
- …