Notes on Generative Probabilistic Bisimulation

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 consider any process algebra giving rise to a Probabilistic Transition System satisfying the condition of regularity and offering prefixing, interleaving, and guarded recursion, then the coarsest congruence that is contained in weak bisimulation is strong bisimulation.

• Type: Journal
• Year: 2007
• Where: ENTCS
• Authors: Simone Tini
• Keywords: ENTCS 2007, Generative Probabilistic Transition, Probabilistic Transition System, Weak Bisimulation