thesis
An O(n2) time algorithm for alternating Büchi games
IST Austria Technical Report
published
Krishnendu
Chatterjee
author 2E5DCA20-F248-11E8-B48F-1D18A9856A870000-0002-4561-241X
Monika
Henzinger
author
KrCh
department
Computing the winning set for Büchi objectives in alternating games on graphs is a central problem in computer aided verification with a large number of applications. The long standing best known upper bound for solving the problem is ̃O(n·m), where n is the number of vertices and m is the number of edges in the graph. We are the first to break the ̃O(n·m) boundary by presenting a new technique that reduces the running time to O(n2). This bound also leads to O(n2) time algorithms for computing the set of almost-sure winning vertices for Büchi objectives (1) in alternating games with probabilistic transitions (improving an earlier bound of O(n·m)), (2) in concurrent graph games with constant actions (improving an earlier bound of O(n3)), and (3) in Markov decision processes (improving for m > n4/3 an earlier bound of O(min(m1.5, m·n2/3)). We also show that the same technique can be used to compute the maximal end-component decomposition of a graph in time O(n2), which is an improvement over earlier bounds for m > n4/3. Finally, we show how to maintain the winning set for Büchi objectives in alternating games under a sequence of edge insertions or a sequence of edge deletions in O(n) amortized time per operation. This is the first dynamic algorithm for this problem.
https://research-explorer.app.ist.ac.at/download/5379/5504/IST-2011-0009_IST-2011-0009.pdf
application/pdfno
IST Austria2011
eng
2664-169010.15479/AT:IST-2011-0009
20
https://research-explorer.app.ist.ac.at/record/3165
Chatterjee, Krishnendu, and Monika Henzinger. <i>An O(N2) Time Algorithm for Alternating Büchi Games</i>. IST Austria, 2011. <a href="https://doi.org/10.15479/AT:IST-2011-0009">https://doi.org/10.15479/AT:IST-2011-0009</a>.
Chatterjee K, Henzinger M. 2011. An O(n2) time algorithm for alternating Büchi games, IST Austria, 20p.
Chatterjee, Krishnendu, and Monika Henzinger. <i>An O(N2) Time Algorithm for Alternating Büchi Games</i>. IST Austria, 2011, doi:<a href="https://doi.org/10.15479/AT:IST-2011-0009">10.15479/AT:IST-2011-0009</a>.
K. Chatterjee and M. Henzinger, <i>An O(n2) time algorithm for alternating Büchi games</i>. IST Austria, 2011.
Chatterjee, K., & Henzinger, M. (2011). <i>An O(n2) time algorithm for alternating Büchi games</i>. IST Austria. <a href="https://doi.org/10.15479/AT:IST-2011-0009">https://doi.org/10.15479/AT:IST-2011-0009</a>
Chatterjee K, Henzinger M. <i>An O(N2) Time Algorithm for Alternating Büchi Games</i>. IST Austria; 2011. doi:<a href="https://doi.org/10.15479/AT:IST-2011-0009">10.15479/AT:IST-2011-0009</a>
K. Chatterjee, M. Henzinger, An O(N2) Time Algorithm for Alternating Büchi Games, IST Austria, 2011.
53792018-12-12T11:38:59Z2021-01-12T08:01:32Z