Probabilistic bisimulation

In theoretical computer science, probabilistic bisimulation is an extension of the concept of bisimulation for fully probabilistic transition systems first described by K.G. Larsen and A. Skou. A discrete probabilistic transition system is a triple S = ( St , Act , τ : St × Act × St → [ 0 , 1 ] ) {\displaystyle S=(\operatorname {St} ,\operatorname {Act} ,\tau :\operatorname {St} \times \operatorname {Act} \times \operatorname {St} \rightarrow [0,1])} where τ ( s , a , t ) {\displaystyle \tau (s,a,t)} gives the probability of starting in the state s, performing the action a and ending up in the state t.

Source: Wikipedia — Probabilistic bisimulation (CC BY-SA 4.0)

Probabilistic bisimulation

In theoretical computer science, probabilistic bisimulation is an extension of the concept of bisimulation for fully probabilistic transition systems first described by K.G. Larsen and A. Skou. A discrete probabilistic transition system is a triple S = ( St , Act , τ : St × Act × St → [ 0 , 1 ] ) {\displaystyle S=(\operatorname {St} ,\operatorname {Act} ,\tau :\operatorname {St} \times \operatorname {Act} \times \operatorname {St} \rightarrow [0,1])} where τ ( s , a , t ) {\displaystyle \tau (s,a,t)} gives the probability of starting in the state s, performing the action a and ending up in the state t.

This neuron ends here.

Source: Wikipedia "Probabilistic bisimulation" · CC BY-SA 4.0

Share this article: X · Bluesky
Privacy Policy