2026-07-30T00:20:41Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:9551 2024-03-06T10:44:42Z ddc:004 open_access

Alternating Nonzero Automata Fournier, Paulin Gimbert, Hugo zero-automata probabilities temporal logics We introduce a new class of automata on infinite trees called alternating nonzero automata, which extends the class of non-deterministic nonzero automata. The emptiness problem for this class is still open, however we identify a subclass, namely limited choice, for which we reduce the emptiness problem for alternating nonzero automata to the same problem for non-deterministic ones, which implies decidability. We obtain, as corollaries, algorithms for the satisfiability of a probabilistic temporal logic extending both CTL* and the qualitative fragment of pCTL*. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Paulin Fournier and Hugo Gimbert 2018 Is Part Of LIPIcs, Volume 118, 29th International Conference on Concurrency Theory (CONCUR 2018) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.CONCUR.2018.13 urn:nbn:de:0030-drops-95517 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2018.13 eng https://creativecommons.org/licenses/by/3.0/legalcode