Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Alternating Tree Automata with Qualitative Semantics

Alternating Tree Automata with Qualitative Semantics We study alternating automata with qualitative semantics over infinite binary trees: Alternation means that two opposing players construct a decoration of the input tree called a run, and the qualitative semantics says that a run of the automaton is accepting if almost all branches of the run are accepting. In this article, we prove a positive and a negative result for the emptiness problem of alternating automata with qualitative semantics. The positive result is the decidability of the emptiness problem for the case of Büchi acceptance condition. An interesting aspect of our approach is that we do not extend the classical solution for solving the emptiness problem of alternating automata, which first constructs an equivalent non-deterministic automaton. Instead, we directly construct an emptiness game making use of imperfect information. The negative result is the undecidability of the emptiness problem for the case of co-Büchi acceptance condition. This result has two direct consequences: the undecidability of monadic second-order logic extended with the qualitative path-measure quantifier and the undecidability of the emptiness problem for alternating tree automata with non-zero semantics, a recently introduced probabilistic model of alternating tree automata. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM Transactions on Computational Logic (TOCL) Association for Computing Machinery

Alternating Tree Automata with Qualitative Semantics

Download PDF
24 pages

Loading next page...
 
/lp/association-for-computing-machinery/alternating-tree-automata-with-qualitative-semantics-R2PTTTbE70
Publisher
Association for Computing Machinery
Copyright
Copyright © 2020 ACM
ISSN
1529-3785
eISSN
1557-945X
DOI
10.1145/3431860
Publisher site
See Article on Publisher Site

Abstract

We study alternating automata with qualitative semantics over infinite binary trees: Alternation means that two opposing players construct a decoration of the input tree called a run, and the qualitative semantics says that a run of the automaton is accepting if almost all branches of the run are accepting. In this article, we prove a positive and a negative result for the emptiness problem of alternating automata with qualitative semantics. The positive result is the decidability of the emptiness problem for the case of Büchi acceptance condition. An interesting aspect of our approach is that we do not extend the classical solution for solving the emptiness problem of alternating automata, which first constructs an equivalent non-deterministic automaton. Instead, we directly construct an emptiness game making use of imperfect information. The negative result is the undecidability of the emptiness problem for the case of co-Büchi acceptance condition. This result has two direct consequences: the undecidability of monadic second-order logic extended with the qualitative path-measure quantifier and the undecidability of the emptiness problem for alternating tree automata with non-zero semantics, a recently introduced probabilistic model of alternating tree automata.

Journal

ACM Transactions on Computational Logic (TOCL) – Association for Computing Machinery

Published: Dec 17, 2020

Keywords: -regular conditions

References

  • Probabilistic ω-automata
    Baier, Christel; Größer, Marcus; Bertrand, Nathalie
  • Expressing cardinality quantifiers in monadic second-order logic over trees
    Bárány, Vince; Kaiser, Łukasz; Rabinovich, Alex
  • Monadic second-order logic with path-measure quantifier is undecidable
    Berthon, Raphaël; Filiot, Emmanuel; Guha, Shibashis; Maubert, Bastien; Murano, Nello; Pinault, Laureline; Raskin, Jean-François; Rubin, Sasha
  • Qualitative determinacy and decidability of stochastic games with signals
    Bertrand, Nathalie; Genest, Blaise; Gimbert, Hugo
  • Thin MSO with a probabilistic path quantifier
    Bojańczyk, Mikołaj
  • Emptiness of zero automata is decidable
    Bojańczyk, Mikołaj; Gimbert, Hugo; Kelmendi, Edon
  • MSO+∇ is undecidable
    Bojańczyk, Mikołaj; Kelmendi, Edon; Skrzypczak, Michal
  • Randomization in automata on infinite trees
    Carayol, Arnaud; Haddad, Axel; Serre, Olivier
  • Pure strategies in imperfect information stochastic games
    Carayol, Arnaud; Löding, Christof; Serre, Olivier
  • Partial-observation stochastic games: How to win when belief fails
    Chatterjee, Krishnendu; Doyen, Laurent
  • Algorithms for omega-regular games with imperfect information
    Chatterjee, Krishnendu; Doyen, Laurent; Henzinger, Thomas A.; Raskin, Jean-François
  • Markov decision processes and regular events (extended abstract)
    Courcoubetis, Costas; Yannakakis, Mihalis
  • The verification of probabilistic systems under memoryless partial-information policies is hard
    de Alfaro, Luca
  • Moses, and Moshe Y
    Fagin, Ronald; Halpern, Joseph Y.; Yoram,
  • Undecidability results for probabilistic automata
    Fijalkow, Nathanaël
  • Deciding the value 1 problem for probabilistic leaktight automata
    Fijalkow, Nathanaël; Gimbert, Hugo; Kelmendi, Edon; Oualhadj, Youssouf
  • Emptiness of alternating tree automata using games with imperfect information
    Fijalkow, Nathanaël; Pinchinat, Sophie; Serre, Olivier
  • Emptiness of Alternating Tree Automata Using Games with Imperfect Information
    Fijalkow, Nathanaël; Pinchinat, Sophie; Serre, Olivier
  • Alternating nonzero automata
    Fournier, Paulin; Gimbert, Hugo
  • Probabilistic automata on finite words: Decidable and undecidable problems
    Gimbert, Hugo; Oualhadj, Youssouf
  • Perfect information stochastic priority games
    Gimbert, Hugo; Zielonka, Wiesław
  • Qualitative concurrent stochastic games with imperfect information
    Gripon, Vincent; Serre, Olivier
  • Turn-based stochastic games
    Kučera, Antonín
  • Measure quantifier in monadic second order logic
    Michalewski, Henryk; Mio, Matteo
  • Monadic second order logic with measure and category quantifiers
    Mio, Matteo; Skrzypczak, Michał; Michalewski, Henryk
  • Introduction to Probabilistic Automata
    Paz, Azaria
  • Markov Decision Processes: Discrete Stochastic Dynamic Programming
    Puterman, Martin L.
  • Probabilistic automata
    Rabin, Michael O.
  • Decidability of second-order theories and automata on infinite trees
    Rabin, Michael O.
  • Universal games of incomplete information
    Reif, J. H.
  • The complexity of two-player games of incomplete information
    Reif, J. H.
  • Languages, automata, and logic
    Thomas, Wolfgang
  • Infinite games on finitely coloured graphs with applications to automata on infinite trees
    Zielonka, Wiesław