Paper Info
Title
Alternating Nonzero Automata.
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*.
Year
Venue
DocType
2018
CONCUR
Conference
Volume
Citations 
PageRank 
abs/1802.04067
0
0.34
References 
Authors
0
2
Name
Order
Citations
PageRank
Paulin Fournier1112.57
Hugo Gimbert224921.31