Mario Román

Home

❯

notes

❯

pieces

❯

Probabilistic bisimulation

Probabilistic bisimulation

Apr 29, 20251 min read

probabilistic-bisimulation

  • monoidal Mealy machine
  • bisimulation
  • Functional morphisms of probabilistic automata are bisimulations

There are results on characterizing logics for probabilistic bisimulation.

References

  • compare with Bisimulation Through Probabilistic Testing (Larsen, Skou, 1991).
  • compare with the concept of “lumpability”.

Graph View

Backlinks

  • Functional morphisms of probabilistic automata are bisimulations

Mario Román, CC-BY-SA. Built with Quartz © 2025.

  • GitHub
  • ArXiv
  • OrcID