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...
主要な著者: | Kiefer, S, Tang, Q |
---|---|
フォーマット: | Conference item |
言語: | English |
出版事項: |
Schloss Dagstuhl
2021
|
類似資料
-
Approximating Bisimulation in One-counter Nets
著者:: V. A. Bashkin
出版事項: (2011-12-01) -
Compositionality of Approximate Bisimulation for Probabilistic Systems
著者:: Daniel Gebler, 等
出版事項: (2013-07-01) -
Sound approximate and asymptotic probabilistic bisimulations for PCTL
著者:: Massimo Bartoletti, 等
出版事項: (2023-03-01) -
Minimising the probabilistic bisimilarity distance
著者:: Kiefer, S, 等
出版事項: (2024) -
Bisimulation learning
著者:: Abate, A, 等
出版事項: (2024)