10 search results - page 1 / 2 » Weak Bisimulation for Fully Probabilistic Processes |
CAV
1997
Springer
13 years 9 months ago
1997
Springer
CALCO
2009
Springer
13 years 12 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...
ENTCS
2007
13 years 5 months ago
2007
In this notes we consider the model of Generative Probabilistic Transition Systems, and Baier and Hermanns’ notion of weak bisimulation defined over them. We prove that, if we ...
QEST
2007
IEEE
13 years 11 months ago
2007
IEEE
The paper introduces symbolic bisimulations for a simple probabilistic π-calculus to overcome the infinite branching problem that still exists in checking ground bisimulations b...
LICS
2002
IEEE
13 years 10 months ago
2002
IEEE
We observe that equivalence is not a robust concept in the presence of numerical information - such as probabilities - in the model. We develop a metric analogue of weak bisimulat...