Sciweavers

23 search results - page 2 / 5
» Adhesive Categories
Sort
View
GG
2008
Springer
13 years 6 months ago
Resolution-Like Theorem Proving for High-Level Conditions
The tautology problem is the problem to prove the validity of statements. In this paper, we present a calculus for this undecidable problem on graphical conditions, prove its sound...
Karl-Heinz Pennemann
CALCO
2009
Springer
141views Mathematics» more  CALCO 2009»
14 years 12 hour ago
Unfolding Grammars in Adhesive Categories
We generalize the unfolding semantics, previously developed for concrete formalisms such as Petri nets and graph grammars, to the setting of (single pushout) rewriting over adhesiv...
Paolo Baldan, Andrea Corradini, Tobias Heindel, Ba...
GG
2010
Springer
13 years 6 months ago
Multi-Amalgamation in Adhesive Categories
Abstract. Amalgamation is a well-known concept for graph transformations in order to model synchronized parallelism of rules with shared subrules and corresponding transformations....
Ulrike Golas, Hartmut Ehrig, Annegret Habel
FUIN
2006
132views more  FUIN 2006»
13 years 5 months ago
Adhesive High-Level Replacement Systems: A New Categorical Framework for Graph Transformation
Adhesive high-level replacement (HLR) systems are introduced as a new categorical framework for graph transformation in the double pushout (DPO) approach, which combines the well-k...
Hartmut Ehrig, Julia Padberg, Ulrike Prange, Anneg...
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