Sciweavers

1357 search results - page 33 / 272
» Compositionality in Graph Transformation
Sort
View
TAGT
1998
Springer
250views Graph Theory» more  TAGT 1998»
15 years 6 months ago
Double-Pushout Approach with Injective Matching
Abstract. We investigate and compare four variants of the doublepushout approach to graph transformation. Besides the traditional approach with arbitrary matching and injective rig...
Annegret Habel, Jürgen Müller, Detlef Pl...
ACS
2000
15 years 2 months ago
Free Adjunction of Morphisms
Abstract. We develop a general setting for the treatment of extensions of categories by means of freely adjoined morphisms. To this end, we study what we call composition graphs, i...
Lutz Schröder, Horst Herrlich
CCE
2006
15 years 2 months ago
New approaches for representing, analyzing and visualizing complex kinetic transformations
Complex kinetic mechanisms involving thousands of reacting species and tens of thousands of reactions are currently required for the rational analysis of modern combustion systems...
Ioannis P. Androulakis
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
16 years 2 months ago
The PCP theorem by gap amplification
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
Irit Dinur
HICSS
2007
IEEE
140views Biometrics» more  HICSS 2007»
15 years 8 months ago
Design Pattern Evolution and Verification Using Graph Transformation
This paper presents a graph transformation based approach to design pattern evolution. An evolution of a design pattern includes modifications of pattern elements, such as classes...
Chunying Zhao, Jun Kong, Kang Zhang