Two Recursively Inseparable Problems for Probabilistic Automata

Nathanaël Fijalkow (1) , Hugo Gimbert (2) , Florian Horn (1) , Youssouf Oualhadj (2, 3)

1 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications
2 LaBRI - Laboratoire Bordelais de Recherche en Informatique
3 Institut de Mathématiques [Mons]

This paper introduces and investigates decision problems for numberless probabilistic automata, i.e. probabilistic automata where the support of each probabilistic transitions is specified, but the exact values of the probabilities are not. A numberless probabilistic automaton can be instantiated into a probabilistic automaton by specifying the exact values of the non-zero probabilistic transitions. We show that the two following properties of numberless probabilistic automata are recursively inseparable: * all instances of the numberless automaton have value 1, * no instance of the numberless automaton has value 1.

Domaines: Informatique et théorie des jeux [cs.GT]

Nathanaël Fijalkow, Hugo Gimbert, Florian Horn, Youssouf Oualhadj. Two Recursively Inseparable Problems for Probabilistic Automata. MFCS 2014, Aug 2014, Budapest, Hungary. Paper 168. ⟨hal-01007706⟩