257 search results - page 1 / 52 » New Bisimulation Semantics for Distributed Systems |
FORTE
2007
13 years 6 months ago
2007
Bisimulation semantics are a very pleasant way to define the semantics of systems, mainly because the simplicity of their definitions and their nice coalgebraic properties. Howev...
QEST
2008
IEEE
13 years 11 months ago
2008
IEEE
We tackle the problem of non robustness of simulation and bisimulation when dealing with probabilistic processes. It is important to ignore tiny deviations in probabilities becaus...
CONCUR
2005
Springer
13 years 11 months ago
2005
Springer
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...
CALCO
2009
Springer
13 years 12 months ago
2009
Springer
d abstract) Sam Staton Computer Laboratory, University of Cambridge Abstract. A labelled transition system can be understood as a coalgebra for a particular endofunctor on the cate...
IANDC
2010
13 years 3 months ago
2010
Abstract. We investigate weak bisimulation of probabilistic systems in the presence of nondeterminism, i.e. labelled concurrent Markov chains (LCMC) with silent transitions. We bui...