On Regularity of unary Probabilistic Automata

Sundararaman Akshay (1) , Blaise Genest (2) , Bruno Karelovic (3) , Nikhil Vyas (1)

1 Department of Computer Science and Engineering [Bombay]
2 SUMO - SUpervision of large MOdular and distributed systems
3 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications

The quantitative verification of Probabilistic Automata (PA) is undecidable in general. Unary PA are a simpler model where the choice of action is fixed. Still, the quantitative verification problem is open and known to be as hard as Skolem's problem, a problem on linear recurrence sequences, whose decidability is open for at least 40 years. In this paper, we approach this problem by studying the languages generated by unary PAs (as defined below), whose regularity would entail the decidability of quantitative verification. Given an initial distribution, we represent the trajectory of a unary PA over time as an infinite word over a finite alphabet, where the n th letter represents a probability range after n steps. We extend this to a language of trajectories (a set of words), one trajectory for each initial distribution from a (possibly infinite) set. We show that if the eigenvalues of the transition matrix associated with the unary PA are all distinct positive real numbers, then the language is effectively regular. Further, we show that this result is at the boundary of regularity, as non-regular languages can be generated when the restrictions are even slightly relaxed. The regular representation of the language allows us to reason about more general properties, e.g., robustness of a regular property in a neighbourhood around a given distribution.

Domaines: Autre [cs.OH]

Sundararaman Akshay, Blaise Genest, Bruno Karelovic, Nikhil Vyas. On Regularity of unary Probabilistic Automata. STACS 2016, 2016, Orléans, France. pp.8:1-8:14. ⟨hal-01245037v2⟩