Sciweavers

3 search results - page 1 / 1
» Algebraic High-Level Nets as Weak Adhesive HLR Categories
Sort
View
ECEASST
2006
123views more  ECEASST 2006»
13 years 10 months ago
Algebraic High-Level Nets as Weak Adhesive HLR Categories
Abstract. Adhesive high-level replacement (HLR) system have been recently introduced as a new categorical framework for graph transformation in the double pushout approach [1, 2]. ...
Ulrike Prange
GG
2008
Springer
13 years 12 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
ENTCS
2008
97views more  ENTCS 2008»
13 years 11 months ago
An Algorithm for Approximating the Satisfiability Problem of High-level Conditions
The satisfiability problem is the fundamental problem in proving the conflict-freeness of specifications, or in finding a counterexample for an invalid statement. In this paper, w...
Karl-Heinz Pennemann