Results 11  20
of
21
Rewriting on Cyclic Structures
 Extended abstract in Fixed Points in Computer Science, satellite workshop of MFCS'98
, 1998
"... We present a categorical formulation of the rewriting of possibly cyclic term graphs, and the proof that this presentation is equivalent to the wellaccepted operational definition proposed in [3]  but for the case of circular redexes, for which we propose (and justify formally) a different treatm ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
We present a categorical formulation of the rewriting of possibly cyclic term graphs, and the proof that this presentation is equivalent to the wellaccepted operational definition proposed in [3]  but for the case of circular redexes, for which we propose (and justify formally) a different treatment. The categorical framework, based on suitable 2categories, allows to model also automatic garbage collection and rules for sharing/unsharing and folding/unfolding of structures. Furthermore, it can be used for defining various extensions of term graph rewriting, and for relating it to other rewriting formalisms.
Shaped generic graph transformation
 APPLICATIONS OF GRAPH TRANSFORMATION WITH INDUSTRIAL RELEVANCE (AGTIVE’07), LECTURE NOTES IN COMPUTER SCIENCE
, 2008
"... Since the systematic evolution of graphlike program models has become important in software engineering, graph transformation has gained much attention in this area. For specifying model evolution concisely, graph transformation rules should be as expressive as possible. The generic rules proposed ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
Since the systematic evolution of graphlike program models has become important in software engineering, graph transformation has gained much attention in this area. For specifying model evolution concisely, graph transformation rules should be as expressive as possible. The generic rules proposed in this paper may contain placeholders for graphs of varying number and shape. Expansion of these placeholders by graphs yields the actual transformation rules to be applied. Even rather complex transformations occurring in reallife applications, such as the PullUpMethod refactoring operation, can be specified by a single generic rule.
Termgraph rewriting via explicit paths
"... Abstract. The notion of path is classical in graph theory but not directly used in the term rewriting community. The main idea of this work is to raise the notion of path to the level of firstorder terms, i.e. paths become part of the terms and not just metainformation about them. These paths are ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. The notion of path is classical in graph theory but not directly used in the term rewriting community. The main idea of this work is to raise the notion of path to the level of firstorder terms, i.e. paths become part of the terms and not just metainformation about them. These paths are represented by words of integers (positive or negative) and are interpreted as relative addresses in terms. In this way, paths can also be seen as a generalization of the classical notion of position for the firstorder terms and are inspired by de Bruijn indexes. In this paper, we define an original framework called Referenced Term Rewriting where paths are used to represent pointers between subterms. Using this approach, any termgraph rewriting systems can be simulated using a term rewritebased environment. 1
Transformation of Type Graphs with Inheritance for Ensuring Security in EGovernment Networks
"... Abstract. Egovernment services usually process large amounts of confidential data. Therefore, security requirements for the communication between components have to be adhered in a strict way. Hence, it is of main interest that developers can analyze their modularized models of actual systems and t ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. Egovernment services usually process large amounts of confidential data. Therefore, security requirements for the communication between components have to be adhered in a strict way. Hence, it is of main interest that developers can analyze their modularized models of actual systems and that they can detect critical patterns. For this purpose, we present a general and formal framework for critical pattern detection and userdriven correction as well as possibilities for automatic analysis and verification at metamodel level. The technique is based on the formal theory of graph transformation, which we extend to transformations of type graphs with inheritance within a type graph hierarchy. We apply the framework to specify relevant security requirements. The extended theory is shown to fulfil the conditions of a weak adhesive HLR category allowing us to transfer analysis techniques and results shown for this abstract framework of graph transformation. In particular, we discuss how confluence analysis and parallelization can be used to enable parallel critical pattern detection and elimination. 1
Graphs, Rewriting and Pathway Reconstruction for RuleBased Models
"... In this paper, we introduce a novel way of constructing concise causal histories (pathways) to represent how specified structures are formed during simulation of systems represented by rulebased models. This is founded on a new, clean, graphbased semantics introduced in the first part of this paper ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this paper, we introduce a novel way of constructing concise causal histories (pathways) to represent how specified structures are formed during simulation of systems represented by rulebased models. This is founded on a new, clean, graphbased semantics introduced in the first part of this paper for Kappa, a rulebased modelling language that has emerged as a natural description of proteinprotein interactions in molecular biology [1]. The semantics is capable of capturing the whole of Kappa, including subtle sideeffects on deletion of structure, and its structured presentation provides the basis for the translation of techniques to other models. In particular, we give a notion of trajectory compression, which restricts a trace culminating in the production of a given structure to the actions necessary for the structure to occur. This is central to the reconstruction of biochemical pathways due to the failure of traditional techniques to provide adequately concise causal histories, and we expect it to be applicable in a range of other modelling situations.
Frm Ptr Nts t Grph Trnsfrmtn Sstms ⋆ A Contribution in Honour of HansJörg Kreowski
"... Abstract. HansJörg Kreowski was among the first researchers to point out that P/T Petri nets can be interpreted as instances of Graph Transformation Systems, a fact now considered folklore. We elaborate on this observation, discussing how several different models of Petri nets can be encoded faithf ..."
Abstract
 Add to MetaCart
Abstract. HansJörg Kreowski was among the first researchers to point out that P/T Petri nets can be interpreted as instances of Graph Transformation Systems, a fact now considered folklore. We elaborate on this observation, discussing how several different models of Petri nets can be encoded faithfully into Graph Transformation Systems. The key idea we pursue is that the net encoding is uniquely determined, and distinct net models are mapped to alternative approaches to graph transformation. 1
Target Languages
"... Îlots formels et certification du filtrage 31 Gestion mémoire et structures de données 61 Applications 121 Extensions aux antipatterns et aux graphes 155Présentations de Tom ..."
Abstract
 Add to MetaCart
Îlots formels et certification du filtrage 31 Gestion mémoire et structures de données 61 Applications 121 Extensions aux antipatterns et aux graphes 155Présentations de Tom
Termgraph rewriting via explicit paths
, 2008
"... The notion of path is classical in graph theory but not directly used in the term rewriting community. The main idea of this work is to raise the notion of path to the level of firstorder terms, i.e. paths become part of the terms and not just metainformation about them. These paths are represent ..."
Abstract
 Add to MetaCart
The notion of path is classical in graph theory but not directly used in the term rewriting community. The main idea of this work is to raise the notion of path to the level of firstorder terms, i.e. paths become part of the terms and not just metainformation about them. These paths are represented by words of integers (positive or negative) and are interpreted as relative addresses in terms. In this way, paths can also be seen as a generalization of the classical notion of position for the firstorder terms and are inspired by de Bruijn indexes. In this paper, we define an original framework called Referenced Term Rewriting where paths are used to represent pointers between subterms. Using this approach, any termgraph rewriting systems can be simulated using a term rewritebased environment.
From Petri Nets to Graph Transformation Systems ∗
"... Abstract: HansJörg Kreowski was among the first researchers to point out that Place/Transition Petri nets can be interpreted as instances of Graph Transformation Systems, a fact now considered folklore. We elaborate on this observation, discussing how several different models of Petri nets can be e ..."
Abstract
 Add to MetaCart
Abstract: HansJörg Kreowski was among the first researchers to point out that Place/Transition Petri nets can be interpreted as instances of Graph Transformation Systems, a fact now considered folklore. We elaborate on this observation, discussing how several different models of Petri nets can be encoded faithfully into Graph Transformation Systems. The key idea we pursue is that the net encoding is uniquely determined, and distinct net models are mapped to alternative approaches to graph transformation.
Graph rewriting with . . .
, 2010
"... We tackle the problem of graph transformation with a particular focus on node cloning. We propose a graph rewriting framework where nodes can be cloned zero, one or more times. A node can be cloned together with all its incident edges, with only the outgoing edges, with only the incoming edges or w ..."
Abstract
 Add to MetaCart
We tackle the problem of graph transformation with a particular focus on node cloning. We propose a graph rewriting framework where nodes can be cloned zero, one or more times. A node can be cloned together with all its incident edges, with only the outgoing edges, with only the incoming edges or without any of the incident edges. We thus subsume previous works such as the sesquipushout, the heterogeneous pushout and the adaptive star grammars approaches. A rule is defined as a span L l ← K r → R where the righthand side R is a multigraph, the lefthand side L and the interface K are polarized multigraphs. A polarized multigraph is a multigraph endowed with some cloning annotations on nodes and edges. We introduce the notion of polarized multigraphs and define a rewriting step as pushback followed by a pushout in the same way as in the sesquipushout approach.