Sciweavers

866 search results - page 34 / 174
» Bidirectionalizing graph transformations
Sort
View
AGTIVE
1999
Springer
15 years 4 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
EURODAC
1994
IEEE
129views VHDL» more  EURODAC 1994»
15 years 4 months ago
A general state graph transformation framework for asynchronous synthesis
Abstract -- A general framework for synthesis of asynchronous control circuits at the state graph level is proposed. The framework can consider both concurrency reduction as well a...
Bill Lin, Chantal Ykman-Couvreur, Peter Vanbekberg...
ISCAPDCS
2003
15 years 1 months ago
Optimal Graph Transformation Assuming Alternate Scheduling Models
Many computation-intensive iterative or recursive applications commonly found in digital signal processing and image processing applications can be represented by data-flow graph...
Timothy W. O'Neil
BXML
2003
15 years 1 months ago
Towards Automatic Selection of Web Services Using Graph Transformation Rules
: The Web service architecture promises to be highly dynamic. The idea is that a service requester can discover a needed service at runtime. Due to the fact that this discovery pro...
Jan Hendrik Hausmann, Reiko Heckel, Marc Lohmann
CN
2008
126views more  CN 2008»
14 years 12 months ago
Graph transformation approaches for diverse routing in shared risk resource group (SRRG) failures
Failure resilience is a desired feature of the Internet. Most traditional restoration architectures assume single-failure assumption, which is not adequate in present day WDM opti...
Pallab Datta, Arun K. Somani