A Decision Procedure for Probabilistic Kleene Algebra with Angelic Nondeterminism
In Ong et al.~(2025), a new finite automaton model with probabilistic and nondeterministic transitions was introduced, along with a corresponding regular expression language. The key difference from previous approaches is that nondeterminism is formalized in terms of multisets instead of powersets. Automata and expressions are interpreted over the space of probability distributions over multisets of strings with finite multiplicities. The main result of that paper was a full Kleene theorem showing that the two formalisms are equally expressive. In this paper we give a decision procedure for the semantic equivalence of two automata or expressions. The algorithm is based on polyomial algebra and makes use of Gröbner basis techniques for ideal membership testing.