Results 11  20
of
25
Abstraction and control for shapely nested graph transformation
 Fundamenta Informaticae
"... Abstract. Shapely nested graph transformation is the computational model for DiaPlan, a language for programming with graphs that represent diagrams. It supports nested structuring of graphs, structural graph types (shapes), and graph variables. In this paper, we extend the model by two concepts th ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
(Show Context)
Abstract. Shapely nested graph transformation is the computational model for DiaPlan, a language for programming with graphs that represent diagrams. It supports nested structuring of graphs, structural graph types (shapes), and graph variables. In this paper, we extend the model by two concepts that are essential for programming: abstraction allows compound transformations to be named and parameterized, and control allows the order of rule application to be specified. These concepts combine neatly with the underlying computational model, and preserve its rulebased and graphical nature. 1
Describing Policies with Graph Constraints and Rules
 IN: PROC. ICGT02
, 2002
"... Policies are used to control the behavior of complex systems. In order to support reasoning about the behavior, it is necessary to have a precise specification of the policy, better if described in an intuitive visual formalism. Graphical constraints and graph transformation rules provide such a ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
Policies are used to control the behavior of complex systems. In order to support reasoning about the behavior, it is necessary to have a precise specification of the policy, better if described in an intuitive visual formalism. Graphical constraints and graph transformation rules provide such a combination of a natural yet semantically sound formalization. Furthermore, the evolution of policies, the combination of policies and the stepwise development of policies can be given a solid foundation and their analysis and verification can benefit from the use of existing general graph transformation engines.
Recursive Graph Pattern Matching ⋆ With Magic Sets and Global Search Plans
"... Abstract. We present core data structures and algorithms for matching graph patterns with general recursion. Our approach uses magic sets, a wellknown technique from deductive databases, which combines fixpointbased bottomup query evaluation with topdown handling of input parameters. Furthermore ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
(Show Context)
Abstract. We present core data structures and algorithms for matching graph patterns with general recursion. Our approach uses magic sets, a wellknown technique from deductive databases, which combines fixpointbased bottomup query evaluation with topdown handling of input parameters. Furthermore, this technique is enhanced with the global search plans, thus nonrecursive calls are always flattened before elementary pattern matching operations are initiated in order to improve performance. Our approach is exemplified using VIATRA2. 1
Typing of Graph Transformation Units
, 2003
"... The concept of graph transformation units in its original sense is a structuring principle for graph transformation systems which allows the interleaving of rule applications with calls of imported units in a controlled way. The semantics of a graph transformation unit is a binary relation on an un ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
(Show Context)
The concept of graph transformation units in its original sense is a structuring principle for graph transformation systems which allows the interleaving of rule applications with calls of imported units in a controlled way. The semantics of a graph transformation unit is a binary relation on an underlying type of graphs. In order to get a flexible typing mechanism for transformation units and a high degree of parallelism this paper introduces typed graph transformation units that transform ktuples of typed input graphs into ltuples of typed output graphs in a controlled and structured way. The transformation of the typed graph tuples is performed with actions that apply graph transformation rules and imported typed units simultaneously to the graphs of a tuple. The transformation process is controlled with control conditions and with graph tuple class expressions. The new concept of typed graph transformation units is illustrated with examples from the area of string parsing with finite automata.
Some essentials of graph transformation
 RECENT ADVANCES IN FORMAL LANGUAGES AND APPLICATIONS. STUDIES IN COMPUTATIONAL INTELLIGENCE
, 2006
"... This chapter introduces rulebased graph transformation, which constitutes a wellstudied research area in computer science. The chapter presents the most fundamental definitions and illustrates them with some selected examples. It presents also the concept of transformation units, which makes pure ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
This chapter introduces rulebased graph transformation, which constitutes a wellstudied research area in computer science. The chapter presents the most fundamental definitions and illustrates them with some selected examples. It presents also the concept of transformation units, which makes pure graph transformation more feasible for specification and modeling aspects. Moreover, a translation of Chomsky grammars into graph grammars is given and the main theorems concerning parallelism and concurrency are presented. Finally, an introduction to hyperedge replacement is given, a concept which has nice properties because it transforms hypergraphs in a contextfree way.
Rulebased transformation of graphs and the product type
 Handbook on Transformation of Knowledge, Information, and Data. Toappear
"... This chapter presents rulebased graph transformation as a framework for modeling dataprocessing systems. It recalls the structuring concept of graph transformation units which allows for transforming graphs in a rulebased, modularized, and controlled way. In order to get a flexible typing mechanis ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
This chapter presents rulebased graph transformation as a framework for modeling dataprocessing systems. It recalls the structuring concept of graph transformation units which allows for transforming graphs in a rulebased, modularized, and controlled way. In order to get a flexible typing mechanism and a high degree of parallelism, this structuring concept is extended to the product of transformation units. Moreover, it is demonstrated how the product type can be used to transform graph transformation units. The authors advocate rulebased graph transformation for all applications where data, knowledge, and information can be modeled as graphs and their transformation can be specified by means of rules in an adequate way. 1
Suggestions on the Modularization of RuleBased Systems
, 2000
"... Transformation units and transformation modules are structuring concepts for rulebased systems. Their semantics is described by binary relations on configurations which are obtained by the interleaving of rule applications and calls of imported transformation units. The composition of transformatio ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Transformation units and transformation modules are structuring concepts for rulebased systems. Their semantics is described by binary relations on configurations which are obtained by the interleaving of rule applications and calls of imported transformation units. The composition of transformation modules allows the systematic development of large systems from small components. The units and the modules of a system may be based on different semantic domains and different types of rules and rule applications as long as the formats of the configurations are compatible with each other. In this sense, the proposed approach supports the design of modular systems with heterogeneous components.
Appligraph: Applications of Graph Transformation  Fourth Annual Progress Report
, 2001
"... This report summarizes the activities in the fourth year of the ESPRIT Working Group APPLIGRAPH, covering the period from April 1, 2000, to March 31, 2001. The principal objective of this Working Group is to promote applied graph transformation as a rulebased framework for the specication and devel ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This report summarizes the activities in the fourth year of the ESPRIT Working Group APPLIGRAPH, covering the period from April 1, 2000, to March 31, 2001. The principal objective of this Working Group is to promote applied graph transformation as a rulebased framework for the specication and development of systems, languages, and tools and to improve the awareness of its industrial relevance
Graph Multiset Transformation as a Framework for Massively Parallel Computation
, 2008
"... In this paper, graph multiset transformation is introduced and studied as a novel type of parallel graph transformation. The basic idea is that graph transformation rules may be applied to all or at least some members of a multiset of graphs simultaneously providing a computational step with the po ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
In this paper, graph multiset transformation is introduced and studied as a novel type of parallel graph transformation. The basic idea is that graph transformation rules may be applied to all or at least some members of a multiset of graphs simultaneously providing a computational step with the possibility of massive parallelism in this way. As a consequence, graph problems in the class NP can be solved by a single computation of polynomial length for each input graph.
Graph Transactions as Processes
, 2006
"... Transactional graph transformation systems (tgtss) have been recently proposed as a mild extension of the standard dpo approach to graph transformation, equipping it with a suitable notion of atomic execution for computations. A typing mechanism induces a distinction between stable and unstable it ..."
Abstract
 Add to MetaCart
(Show Context)
Transactional graph transformation systems (tgtss) have been recently proposed as a mild extension of the standard dpo approach to graph transformation, equipping it with a suitable notion of atomic execution for computations. A typing mechanism induces a distinction between stable and unstable items, and a transaction is defined as a shiftequivalence class of computations such that the starting and ending states are stable and all the intermediate states are unstable. The paper introduces an equivalent, yet more manageable definition of transaction based on graph processes. This presentation is used to provide a universal characterisation for the class of transactions of a given tgts. More specifically, we show that the functor mapping a tgts to a graph transformation system having as productions exactly the transactions of the original tgts is the right adjoint to an inclusion functor.