32 citations · 35 across the 6 of their papers we have counts for
3 papers · 1 filter
Stability and Complexity of Minimising Probabilistic Automata
Stefan Kiefer, Björn Wachter
We consider the state-minimisation problem for weighted and probabilistic automata. We provide a numerically stable polynomial-time minimisation algorithm for weighted automata, wi…
On the Complexity of Equivalence and Minimisation for Q-weighted Automata
Stefan Kiefer, Andrzej Murawski, Joel Ouaknine +2
This paper is concerned with the computational complexity of equivalence and minimisation for automata with transition weights in the field Q of rational numbers. We use polynomial…
On the Complexity of the Equivalence Problem for Probabilistic Automata
Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine +2
Checking two probabilistic automata for equivalence has been shown to be a key problem for efficiently establishing various behavioural and anonymity properties of probabilistic sy…