Alternating Nonzero Automata
Logic in Computer Science
2018-02-13 v1 Formal Languages and Automata Theory
Abstract
We introduce a new class of automata on infinite trees called \emph{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*.
Cite
@article{arxiv.1802.04067,
title = {Alternating Nonzero Automata},
author = {Paulin Fournier and Hugo Gimbert},
journal= {arXiv preprint arXiv:1802.04067},
year = {2018}
}