- 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”.