Results 1  10
of
202
InductiveDataType Systems
, 2002
"... In a previous work ("Abstract Data Type Systems", TCS 173(2), 1997), the leI two authors presented a combined lmbined made of a (strongl normal3zG9 alrmal rewrite system and a typed #calA#Ik enriched by patternmatching definitions folnitio a certain format,calat the "General Schem ..."
Abstract

Cited by 811 (24 self)
 Add to MetaCart
In a previous work ("Abstract Data Type Systems", TCS 173(2), 1997), the leI two authors presented a combined lmbined made of a (strongl normal3zG9 alrmal rewrite system and a typed #calA#Ik enriched by patternmatching definitions folnitio a certain format,calat the "General Schema", whichgeneral39I theusual recursor definitions fornatural numbers and simil9 "basic inductive types". This combined lmbined was shown to bestrongl normalIk39f The purpose of this paper is toreformul33 and extend theGeneral Schema in order to make it easil extensibl3 to capture a more general cler of inductive types, cals, "strictly positive", and to ease the strong normalgAg9Ik proof of theresulGGg system. Thisresul provides a computation model for the combination of anal"DAfGI specification language based on abstract data types and of astrongl typed functional language with strictly positive inductive types.
Algebraic Approaches to Graph Transformation, Part I: Basic Concepts and Double Pushout Approach
 HANDBOOK OF GRAPH GRAMMARS AND COMPUTING BY GRAPH TRANSFORMATION, VOLUME 1: FOUNDATIONS
, 1996
"... ..."
Modeling Languages: Syntax, Semantics and All That Stuff Part I: The Basic Stuff
, 2000
"... The motivation for this paper, the first in a planned series of three parts, is the multitude of concepts surrounding the proper definition of complex modeling languages for systems and software, and the confusion that this often causes. ..."
Abstract

Cited by 73 (1 self)
 Add to MetaCart
(Show Context)
The motivation for this paper, the first in a planned series of three parts, is the multitude of concepts surrounding the proper definition of complex modeling languages for systems and software, and the confusion that this often causes.
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 68 (13 self)
 Add to MetaCart
(Show Context)
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.
Defining and Parsing Visual Languages with Layered Graph Grammars
 JOURNAL OF VISUAL LANGUAGES AND COMPUTING
, 1997
"... ..."
Adhesive categories
, 2004
"... Abstract. We introduce adhesive categories, which are categories with structure ensuring that pushouts along monomorphisms are wellbehaved. Many types of graphical structures used in computer science are shown to be examples of adhesive categories. Doublepushout graph rewriting generalises well to ..."
Abstract

Cited by 58 (7 self)
 Add to MetaCart
(Show Context)
Abstract. We introduce adhesive categories, which are categories with structure ensuring that pushouts along monomorphisms are wellbehaved. Many types of graphical structures used in computer science are shown to be examples of adhesive categories. Doublepushout graph rewriting generalises well to rewriting on arbitrary adhesive categories.
Contextual Nets
 Acta Informatica
"... We propose a new kind of nets, called contextual nets, where events may have both preconditions and postconditions, as in the classical case, and also positive or negative context conditions. Positive context conditions are to be interpreted as elements which are needed for the event to occur, but w ..."
Abstract

Cited by 57 (23 self)
 Add to MetaCart
(Show Context)
We propose a new kind of nets, called contextual nets, where events may have both preconditions and postconditions, as in the classical case, and also positive or negative context conditions. Positive context conditions are to be interpreted as elements which are needed for the event to occur, but which are not affected by the occurring of the event. Instead, negative context conditions are elements which must not be present for the event to take place. The importance of an explicit representation of positive context elements is twofold. Firstly, it allows a faithful representation of systems where the notion of "reading without consuming" is commonly used, like database systems, concurrent constraint programming, or any computation framework based on shared memory. Secondly, it allows to specify directly and naturally a level of concurrency greater than in classical nets. In fact, two events with different preconditions but with the same positive context may occur both in any order an...
A Static Analysis Technique for Graph Transformation Systems
 In Proc. of CONCUR ’01
, 2001
"... In this paper we introduce a static analysis technique for graph transformation systems. We present an algorithm which, given a graph transformation system and a start graph, produces a nite structure consisting of a hypergraph decorated with transitions (Petri graph) which can be seen as an app ..."
Abstract

Cited by 56 (22 self)
 Add to MetaCart
(Show Context)
In this paper we introduce a static analysis technique for graph transformation systems. We present an algorithm which, given a graph transformation system and a start graph, produces a nite structure consisting of a hypergraph decorated with transitions (Petri graph) which can be seen as an approximation of the Winskel style unfolding of the graph transformation system. The fact that any reachable graph has an homomorphic image in the Petri graph and the additional causal information provided by transitions allow us to prove several interesting properties of the original system. As an application of the proposed technique we show how it can be used to verify the absence of deadlocks in an innitestate Dining Philosophers system.
Ensuring Consistency of Conditional Graph Grammars  A Constructive Approach
 Proc. of SEGRAGRA'95 &quot;Graph Rewriting and Computation&quot;, Electronic Notes of TCS
, 1995
"... Consistency conditions describe basic properties of graphs as e.g. the existence or uniqueness of certain elements. A graph grammar is consistent if the start graph satisfies the consistency condition and the rules preserve this property. We propose a general construction that transforms global cons ..."
Abstract

Cited by 55 (9 self)
 Add to MetaCart
(Show Context)
Consistency conditions describe basic properties of graphs as e.g. the existence or uniqueness of certain elements. A graph grammar is consistent if the start graph satisfies the consistency condition and the rules preserve this property. We propose a general construction that transforms global consistency conditions into preconditions for individual rules. A soconstructed rule is applicable to a consistent graph if and only if the derived graph is consistent, too. The relevance of this result is motivated by an example specification of a safetycritical system that is, a roundabout. 1 Introduction Formal methods enjoy an increasing interest, especially in the area of safetycritical systems. In order to ensure that an application meets a certain security standard it has to be verified w.r.t. pregiven safety requirements. In the beginning these requirements are specified independently of the functional behavior of the system: A functional specification describes how the system shoul...
Shapely Hierarchical Graph Transformation
 Journal of Computer and System Sciences
, 2001
"... Diagrams can be represented by graphs, and the animation and transformation of diagrams can be modeled by graph transformation. This paper studies extensions of graphs and graph transformation that are important for programming with graphs: ..."
Abstract

Cited by 52 (11 self)
 Add to MetaCart
Diagrams can be represented by graphs, and the animation and transformation of diagrams can be modeled by graph transformation. This paper studies extensions of graphs and graph transformation that are important for programming with graphs: