Results 1 
8 of
8
Confluence of Typed Attributed Graph Transformation Systems
 In: Proc. ICGT 2002. Volume 2505 of LNCS
, 2002
"... The issue of confluence is of major importance for the successful application of attributed graph transformation, such as automated translation of UML models into semantic domains. Whereas termination is undecidable in general and must be established by carefully designing the rules, local confl ..."
Abstract

Cited by 38 (6 self)
 Add to MetaCart
The issue of confluence is of major importance for the successful application of attributed graph transformation, such as automated translation of UML models into semantic domains. Whereas termination is undecidable in general and must be established by carefully designing the rules, local confluence can be shown for term rewriting and graph rewriting using the concept of critical pairs. In this paper, we discuss typed attributed graph transformation using a new simplified notion of attribution. For this kind of attributed graph transformation systems we establish a definition of critical pairs and prove a critical pair lemma, stating that local confluence follows from confluence of all critical pairs.
A BiCategorical Axiomatisation of Concurrent Graph Rewriting
, 1999
"... In this paper the concurrent semantics of doublepushout (DPO) graph rewriting, which is classically defined in terms of shiftequivalence classes of graph derivations, is axiomatised via the construction of a free monoidal bicategory. In contrast to a previous attempt based on 2categories, the us ..."
Abstract

Cited by 18 (10 self)
 Add to MetaCart
In this paper the concurrent semantics of doublepushout (DPO) graph rewriting, which is classically defined in terms of shiftequivalence classes of graph derivations, is axiomatised via the construction of a free monoidal bicategory. In contrast to a previous attempt based on 2categories, the use of bicategories allows to define rewriting on concrete graphs. Thus, the problem of composition of isomorphism classes of rewriting sequences is avoided. Moreover, as a first step towards the recovery of the full expressive power of the formalism via a purely algebraic description, the concept of disconnected rules is introduced, i.e., rules whose interface graphs are made of disconnected nodes and edges only. It is proved that, under reasonable assumptions, rewriting via disconnected rules enjoys similar concurrency properties like in the classical approach.
Concatenable graph processes: relating processes and derivation traces
 IN PROCEEDINGS OF ICALP’98, VOLUME 1443 OF LNCS
, 1998
"... Several formal concurrent semantics have been proposed for graph rewriting, a powerful formalism for the specification of concurrent and distributed systems which generalizes P/T Petri nets. In this paper we relate two such semantics recently proposed for the algebraic doublepushout approach to gra ..."
Abstract

Cited by 17 (13 self)
 Add to MetaCart
Several formal concurrent semantics have been proposed for graph rewriting, a powerful formalism for the specification of concurrent and distributed systems which generalizes P/T Petri nets. In this paper we relate two such semantics recently proposed for the algebraic doublepushout approach to graph rewriting, namely the derivation trace and the graph process semantics. The notion of concatenable graph process is
Concurrent Computing: from Petri Nets to Graph Grammars
 Electronic Notes in Theoretical Computer Science
, 1995
"... Petri nets are widely accepted as a specification formalism for concurrent and distributed systems. One of the reasons of their success is the fact that they are equipped with a rich theory, including wellunderstood concurrent semantics; they also provide an interesting benchmark for tools and tech ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
Petri nets are widely accepted as a specification formalism for concurrent and distributed systems. One of the reasons of their success is the fact that they are equipped with a rich theory, including wellunderstood concurrent semantics; they also provide an interesting benchmark for tools and techniques for the description of concurrent systems. Graph grammars can be regarded as a proper generalization of Petri nets, where the current state of a system is described by a graph instead as by a collection of tokens. In this tutorial paper I will review some basic definitions and constructions concerning the concurrent semantics of nets, and I will show to what extent corresponding notions have been developed for graph grammars. Most of such results come out from a joint research by the Berlin and Pisa COMPUGRAPH groups. 1 Introduction The nets which owe their name to Carl Adam Petri [28,29] have been the first formal tool proposed for the specification of the behaviour of systems which...
Subobject Transformation Systems
, 2008
"... Subobject transformation systems (STS) are proposed as a novel formal framework for the analysis of derivations of transformation systems based on the algebraic, doublepushout (DPO) approach. They can be considered as a simplified variant of DPO rewriting, acting in the distributive lattice of subo ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
Subobject transformation systems (STS) are proposed as a novel formal framework for the analysis of derivations of transformation systems based on the algebraic, doublepushout (DPO) approach. They can be considered as a simplified variant of DPO rewriting, acting in the distributive lattice of subobjects of a given object of an adhesive category. This setting allows a direct analysis of all possible notions of dependency between any two productions without requiring an explicit match. In particular, several equivalent characterizations of independence of productions are proposed, as well as a local Church–Rosser theorem in the setting of STS. Finally, we show how any derivation tree in an ordinary DPO grammar leads to an STS via a suitable construction and show that relational reasoning in the resulting STS is sound and complete with respect to the independence in the original derivation tree.
Term Rewriting with Sharing and Memoïzation
 Algebraic and Logic Programming: Proc. of the Third International Conference
, 1992
"... Jungle evaluation is an approach to define term rewriting with sharing based on graph grammars. This approach preserves important properties of term rewriting like termination, and confluence for terminating systems (under mild restrictions). In this paper, term rewriting with sharing is further acc ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Jungle evaluation is an approach to define term rewriting with sharing based on graph grammars. This approach preserves important properties of term rewriting like termination, and confluence for terminating systems (under mild restrictions). In this paper, term rewriting with sharing is further accelerated, by memoization known from functional programming languages: The result of evaluating a function with some arguments is tabulated so that it can be looked up later on when the function is reapplied to the same arguments. We show that term rewriting with sharing and memoization is correct and complete w.r.t. jungle evaluation if the rules are nonoverlapping and nonlooping. Redundant reevaluation of functions is avoided, independent of a particular strategy for applying evaluation rules. 1 Introduction Term rewriting is a basis for prototyping algebraic specifications of abstract data types, and a foundation of functional programming languages (see [DJ90] and [Klo90] for overvie...
GTVMT 2006 Towards a Notion of Transaction in Graph Rewriting 1
"... We define transactional graph transformation systems (tgtss), a mild extension of the ordinary framework for the doublepushout approach to graph transformation, which allows to model transactional activities. Generalising the work on zerosafe nets, the new graphical formalism is based on a typing ..."
Abstract
 Add to MetaCart
We define transactional graph transformation systems (tgtss), a mild extension of the ordinary framework for the doublepushout approach to graph transformation, which allows to model transactional activities. Generalising the work on zerosafe nets, the new graphical formalism is based on a typing discipline which induces a distinction between stable and unstable items. A transaction is then a suitably defined minimal computation which starts and ends in stable states. After providing the basics of tgtss, we illustrate the expected results, needed to bring the theory to full maturity, and some possible future developments. Key words: Graph transformations, zerosafe nets, transactions. 1
Concurrency for Graph Grammars in a Petri net shell
"... Graph grammars are a powerful model of concurrent and distributed systems which can be seen as a proper extension of Petri nets. Inspired by this correspondence we develop truly concurrent semantics for dpo graph grammars based on (deterministic) processes and on a Winskel’s style unfolding construc ..."
Abstract
 Add to MetaCart
Graph grammars are a powerful model of concurrent and distributed systems which can be seen as a proper extension of Petri nets. Inspired by this correspondence we develop truly concurrent semantics for dpo graph grammars based on (deterministic) processes and on a Winskel’s style unfolding construction, and we show that the two approaches can be reconciled. A basic role is played by the study of contextual and inhibitor nets, two extensions of ordinary nets which can be seen as intermediate models between graph grammars and ordinary Petri nets. Keywords: domains.