Sciweavers

4 search results - page 1 / 1
» Deriving Bisimulation Congruences with Borrowed Contexts
Sort
View
FOSSACS
2004
Springer
13 years 10 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
FOSSACS
2008
Springer
13 years 6 months 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...
CONCUR
2005
Springer
13 years 10 months ago
Deriving Weak Bisimulation Congruences from Reduction Systems
The focus of process calculi is interaction rather than computation, and for this very reason: (i) their operational semantics is conveniently expressed by labelled transition syst...
Roberto Bruni, Fabio Gadducci, Ugo Montanari, Pawe...