Approximate bisimulation minimisation
We propose polynomial-time algorithms to minimise labelled Markov chains whose transition probabilities are not known exactly, have been perturbed, or can only be obtained by sampling. Our algorithms are based on a new notion of an approximate bisimulation quotient, obtained by lumping together stat...
Prif Awduron: | Kiefer, S, Tang, Q |
---|---|
Fformat: | Conference item |
Iaith: | English |
Cyhoeddwyd: |
Schloss Dagstuhl
2021
|
Eitemau Tebyg
-
Approximating Bisimulation in One-counter Nets
gan: V. A. Bashkin
Cyhoeddwyd: (2011-12-01) -
Compositionality of Approximate Bisimulation for Probabilistic Systems
gan: Daniel Gebler, et al.
Cyhoeddwyd: (2013-07-01) -
Sound approximate and asymptotic probabilistic bisimulations for PCTL
gan: Massimo Bartoletti, et al.
Cyhoeddwyd: (2023-03-01) -
Minimising the probabilistic bisimilarity distance
gan: Kiefer, S, et al.
Cyhoeddwyd: (2024) -
Bisimulation learning
gan: Abate, A, et al.
Cyhoeddwyd: (2024)