33 search results - page 3 / 7 » Probabilistic Noninterference through Weak Probabilistic Bis... |
CAV
1997
Springer
13 years 11 months ago
1997
Springer
FOSSACS
2007
Springer
14 years 1 months ago
2007
Springer
We give logical characterizations of bisimulation relations for the probabilistic automata of Segala in terms of three Hennessy-Milner style logics. The three logics characterize s...
IANDC
2010
13 years 6 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...
VMCAI
2012
Springer
12 years 3 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...
CALCO
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Labelled Markov processes are continuous-state fully probabilistic labelled transition systems. They can be seen as co-algebras of a suitable monad on the category of mea...