4 research outputs found
Power of Randomization in Automata on Infinite Strings
Probabilistic B\"uchi Automata (PBA) are randomized, finite state automata
that process input strings of infinite length. Based on the threshold chosen
for the acceptance probability, different classes of languages can be defined.
In this paper, we present a number of results that clarify the power of such
machines and properties of the languages they define. The broad themes we focus
on are as follows. We present results on the decidability and precise
complexity of the emptiness, universality and language containment problems for
such machines, thus answering questions central to the use of these models in
formal verification. Next, we characterize the languages recognized by PBAs
topologically, demonstrating that though general PBAs can recognize languages
that are not regular, topologically the languages are as simple as
\omega-regular languages. Finally, we introduce Hierarchical PBAs, which are
syntactically restricted forms of PBAs that are tractable and capture exactly
the class of \omega-regular languages
Optimal Strategies in Weighted Limit Games
We prove the existence and computability of optimal strategies in weighted
limit games, zero-sum infinite-duration games with a B\"uchi-style winning
condition requiring to produce infinitely many play prefixes that satisfy a
given regular specification. Quality of plays is measured in the maximal weight
of infixes between successive play prefixes that satisfy the specification.Comment: In Proceedings GandALF 2020, arXiv:2009.09360. Full version at
arXiv:2008.1156