Sciweavers

4074 search results - page 11 / 815
» Abstract Graph Transformation
Sort
View
SYNASC
2008
IEEE
284views Algorithms» more  SYNASC 2008»
15 years 4 months ago
Graph Rewriting in Computational Origami
We formalize paper fold (origami) by graph rewriting. Origami tion is abstractly described by a rewrite system (O, ), where set of abstract origami’s and is a binary relation on ...
Tetsuo Ida
AGTIVE
1999
Springer
15 years 2 months ago
Support for Design Patterns Through Graph Transformation Tools
A suitable software architecture –for example in the area of distributed application– can be composed of known-to-work solutions. These are also known as design patterns. Howev...
Ansgar Radermacher
FASE
2007
Springer
15 years 3 months ago
Information Preserving Bidirectional Model Transformations
Abstract. Within model-driven software development, model transformation has become a key activity. It refers to a variety of operations modifying a model for various purposes such...
Hartmut Ehrig, Karsten Ehrig, Claudia Ermel, Frank...
GG
2004
Springer
15 years 3 months ago
Constraints and Application Conditions: From Graphs to High-Level Structures
Abstract. Graph constraints and application conditions are most important for graph grammars and transformation systems in a large variety of application areas. Although different...
Hartmut Ehrig, Karsten Ehrig, Annegret Habel, Karl...
GG
2008
Springer
14 years 10 months ago
Network Applications of Graph Bisimulation
Abstract Synchronising Graphs is a system of parallel graph transformation designed for modeling process interaction in a network environment. We propose a theory of context-free s...
Pietro Cenciarelli, Daniele Gorla, Emilio Tuosto