Dynamic Bisimilarity for Reconfigurable and Mobile Systems Via Tile Logic
by
Roberto Bruni
,
Ugo Montanari
,
Vladimiro Sassone
BibTeX
@MISC{Bruni_dynamicbisimilarity,
author = {Roberto Bruni and Ugo Montanari and Vladimiro Sassone},
title = {Dynamic Bisimilarity for Reconfigurable and Mobile Systems Via Tile Logic},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
this paper we consider bisimulation equivalences [33, 37] (with bisimilarity meaning the maximal bisimulation), where the entire branching structure of the transition system is accounted for: informally, two states are equivalent if whatever transition one can perform, the other can simulate it via a transition with the same observation, still ending in equivalent states.
Citations
| 426 | The chemical abstract machine - Berry, Boudol - 1990 |
| 169 | Bisimulation Can’t Be Traced - Bloom, Istrael, et al. - 1995 |
| 34 | A congruence theorem for structured operational semantics of higher-order languages - Bernstein - 1998 |
| 32 | Process and term tile logic - Bruni, Meseguer, et al. - 1998 |
| 14 | Normal forms for partitions and relations - Bruni, Gadducci, et al. - 1998 |
| 12 | Bisimilarity congruences for open terms and term graphs via Tile Logic - Bruni, Frutos-Escrig, et al. - 2000 |
| 12 | Executable tile specifications for process calculi - Bruni, Meseguer, et al. - 1999 |
| 3 | Normal forms for algebras of connections. Theoret - Bruni, Gadducci, et al. - 2001 |
