Efficient Analysis of Unambiguous Automata Using Matrix Semigroup Techniques

Abstract

We introduce a novel technique to analyse unambiguous Büchi automata quantitatively, and apply this to the model checking problem. It is based on linear-algebra arguments that originate from the analysis of matrix semigroups with constant spectral radius. This method can replace a combinatorial procedure that dominates the computational complexity of the existing procedure by Baier et al. We analyse the complexity in detail, showing that, in terms of the set $Q$ of states of the automaton, the new algorithm runs in time $O(|Q{|}^4)$, improving on an efficient implementation of the combinatorial algorithm by a factor of $|Q|$.

Technical report for an MFCS'19 paper. This version fixes a bug in Appendix A