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...
Príomhchruthaitheoirí: | Kiefer, S, Tang, Q |
---|---|
Formáid: | Conference item |
Teanga: | English |
Foilsithe / Cruthaithe: |
Schloss Dagstuhl
2021
|
Míreanna comhchosúla
Míreanna comhchosúla
-
Approximating Bisimulation in One-counter Nets
de réir: V. A. Bashkin
Foilsithe / Cruthaithe: (2011-12-01) -
Compositionality of Approximate Bisimulation for Probabilistic Systems
de réir: Daniel Gebler, et al.
Foilsithe / Cruthaithe: (2013-07-01) -
Sound approximate and asymptotic probabilistic bisimulations for PCTL
de réir: Massimo Bartoletti, et al.
Foilsithe / Cruthaithe: (2023-03-01) -
Minimising the probabilistic bisimilarity distance
de réir: Kiefer, S, et al.
Foilsithe / Cruthaithe: (2024) -
Bisimulation learning
de réir: Abate, A, et al.
Foilsithe / Cruthaithe: (2024)