Alternating Nonzero Automata

Paulin Fournier (1) , Hugo Gimbert (1, 2, 3)

1 LaBRI - Laboratoire Bordelais de Recherche en Informatique
2 CNRS - Centre National de la Recherche Scientifique
3 UB - Université de Bordeaux

We introduce a new class of automata on infinite trees called alternating nonzero automata, which extends the class of non-deterministic nonzero automata. We reduce the emptiness problem for alternating nonzero automata to the same problem for non-deterministic ones, which implies decidability. We obtain as a corollary algorithms for the satisfiability of a probabilistic temporal logic extending both CTL* and the qualitative fragment of pCTL*.

Domaines: Théorie et langage formel [cs.FL]; Informatique et théorie des jeux [cs.GT]; Logique en informatique [cs.LO]

Paulin Fournier, Hugo Gimbert. Alternating Nonzero Automata. CONCUR, Sep 2018, Beijing, China. ⟨hal-01698519⟩