Approximate Bisimulation Minimisation

by   Stefan Kiefer, et al.

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 states that are exactly bisimilar in a slightly perturbed system. We present experiments that show that our algorithms are able to recover the structure of the bisimulation quotient of the unperturbed system.


page 1

page 5

page 6

page 9

page 13

page 15

page 21

page 22


Perturbation Bounds for Monte Carlo within Metropolis via Restricted Approximations

The Monte Carlo within Metropolis (MCwM) algorithm, interpreted as a per...

Qualitative Reachability for Open Interval Markov Chains

Interval Markov chains extend classical Markov chains with the possibili...

Escaping Saddle Points for Nonsmooth Weakly Convex Functions via Perturbed Proximal Algorithms

We propose perturbed proximal algorithms that can provably escape strict...

The Big-O Problem for Labelled Markov Chains and Weighted Automata

Given two weighted automata, we consider the problem of whether one is b...

Rate Reduction for State-labelled Markov Chains with Upper Time-bounded CSL Requirements

This paper presents algorithms for identifying and reducing a dedicated ...

Continuous Time Markov Chains for Analysis of Non-Alcoholic Fatty liver Disease Evolution

In the present paper, progression of non-alcoholic fatty liver disease (...

Learning Maximum-A-Posteriori Perturbation Models for Structured Prediction in Polynomial Time

MAP perturbation models have emerged as a powerful framework for inferen...