Sciweavers

20 search results - page 1 / 4
» Undecidable Control Conditions in Graph Transformation Units
Sort
View
ENTCS
2008
62views more  ENTCS 2008»
13 years 5 months ago
Undecidable Control Conditions in Graph Transformation Units
Graph transformation units are an approach-independent concept for programming by applying rules and imported transformation units to graphs, starting in an initial and ending in ...
Karsten Hölscher, Renate Klempien-Hinrichs, P...
ECEASST
2008
91views more  ECEASST 2008»
13 years 5 months ago
Graph Transformation Model of a Triangulated Network of Mobile Units
Abstract: A triangulated network of mobile units is modelled by means of a graph transformation system in which graph nodes are labelled with geometric coordinates and edges are la...
Stefan Gruner
ENTCS
2008
97views more  ENTCS 2008»
13 years 5 months ago
An Algorithm for Approximating the Satisfiability Problem of High-level Conditions
The satisfiability problem is the fundamental problem in proving the conflict-freeness of specifications, or in finding a counterexample for an invalid statement. In this paper, w...
Karl-Heinz Pennemann
BIRTHDAY
2005
Springer
13 years 11 months ago
Main Concepts of Networks of Transformation Units with Interlinking Semantics
The aim of this paper is to introduce a modelling concept and structuring principle for rule-based systems the semantics of which is not restricted to a sequential behavior, but ca...
Dirk Janssens, Hans-Jörg Kreowski, Grzegorz R...
ENTCS
2008
119views more  ENTCS 2008»
13 years 5 months ago
An Example of Cloning Graph Transformation Rules for Programming
Graphical notations are already popular for the design of software, as witnessed by the success of the Uniform Modeling Languages (UML). In this paper, we advocate the use of grap...
Mark Minas, Berthold Hoffmann