98 search results - page 5 / 20 » Weak Bisimulation for Probabilistic Systems |
ICALP
2011
Springer
13 years 1 months ago
2011
Springer
Markov automata describe systems in terms of events which may be nondeterministic, may occur probabilistically, or may be subject to time delays. We define a novel notion of weak ...
FORTE
2008
13 years 11 months ago
2008
Abstract. Our concrete objective is to present both ordinary bisimulations and probabilistic bisimulations in a common coalgebraic framework based on multiset bisimulations. For th...
CONCUR
2005
Springer
14 years 3 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...
CONCUR
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. In this paper, we provide a transformation from the branching bisimulation problem for infinite, concurrent, data-intensive systems in linear process format, into solving...
VMCAI
2012
Springer
12 years 5 months ago
2012
Springer
Abstract. Recently, a general framework on characteristic formulae was proposed by Aceto et al. It offers a simple theory that allows one to easily obtain characteristic formulae o...