Sciweavers

17 search results - page 1 / 4
» Parallel Independence in Hierarchical Graph Transformation
Sort
View
GG
2004
Springer
13 years 10 months ago
Parallel Independence in Hierarchical Graph Transformation
Abstract. Hierarchical graph transformation as defined in [1, 2] extends double-pushout graph transformation in the spirit of term rewriting: Graphs are provided with hierarchical...
Annegret Habel, Berthold Hoffmann
ECEASST
2008
110views more  ECEASST 2008»
13 years 4 months ago
Independence Analysis of Firing and Rule-based Net Transformations in Reconfigurable Object Nets
: The main idea behind Reconfigurable Object Nets (RONs) is to support the visual specification of controlled rule-based net transformations of place/transition nets (P/T nets). RO...
Enrico Biermann, Tony Modica
ASAP
2010
IEEE
143views Hardware» more  ASAP 2010»
13 years 6 months ago
Loop transformations for interface-based hierarchies IN SDF graphs
Data-flow has proven to be an attractive computation model for programming digital signal processing (DSP) applications. A restricted version of data-flow, termed synchronous data...
Jonathan Piat, Shuvra S. Bhattacharyya, Mickaë...
CAI
2007
Springer
13 years 11 months ago
From Algebraic Graph Transformation to Adhesive HLR Categories and Systems
In this paper, we present an overview of algebraic graph transformation in the double pushout approach. Basic results concerning independence, parallelism, concurrency, embedding, ...
Ulrike Prange, Hartmut Ehrig
CORR
2010
Springer
102views Education» more  CORR 2010»
13 years 4 months ago
Detecting Weak but Hierarchically-Structured Patterns in Networks
The ability to detect weak distributed activation patterns in networks is critical to several applications, such as identifying the onset of anomalous activity or incipient conges...
Aarti Singh, Robert D. Nowak, A. Robert Calderbank