Probabilistic bisimulation (original) (raw)

In theoretical computer science, probabilistic bisimulation is an extension of the concept of bisimulation for fully probabilistic transition systems first described by and . A discrete probabilistic transition system is a triple The definition of a probabilistic bisimulation on a system S is an equivalence relation R on the state space St, such that for every pair s,t in St with sRt and for every action a in Act and for every equivalence class C of R Two states are said to be probabilistically bisimilar if there is some such R relating them.