Sciweavers

4 search results - page 1 / 1
» Deriving Bisimulation Congruences in the DPO Approach to Gra...
Sort
View
FOSSACS
2004
Springer
14 years 4 months ago
Deriving Bisimulation Congruences in the DPO Approach to Graph Rewriting
Abstract. Motivated by recent work on the derivation of labelled transitions and bisimulation congruences from unlabelled reaction rules, we show how to solve this problem in the D...
Hartmut Ehrig, Barbara König
GG
2008
Springer
13 years 12 months ago
Parallel and Sequential Independence for Borrowed Contexts
Parallel and sequential independence are central concepts in the concurrency theory of the double pushout (dpo) approach to graph rewriting. However, so far those same notions were...
Filippo Bonchi, Fabio Gadducci, Tobias Heindel
FOSSACS
2008
Springer
14 years 11 days ago
Deriving Bisimulation Congruences in the Presence of Negative Application Conditions
In recent years there have been several approaches for the automatic derivation of labels from an unlabeled reactive system. This can be done in such a way that the resulting bisim...
Guilherme Rangel, Barbara König, Hartmut Ehri...
GG
2008
Springer
13 years 12 months ago
Behavior Preservation in Model Refactoring Using DPO Transformations with Borrowed Contexts
Behavior preservation, namely the fact that the behavior of a model is not altered by the transformations, is a crucial property in refactoring. The most common approaches to behav...
Guilherme Rangel, Leen Lambers, Barbara König...