Precise Interval Analysis vs. Parity Games

8 years 4 months ago
Precise Interval Analysis vs. Parity Games
In [?], a practical algorithm for precise interval analysis is provided for which, however, no non-trivial upper complexity bound is known. Here, we present a lower bound by showing that precise interval analysis is at least as hard as computing the sets of winning positions in parity games. Our lower-bound proof relies on an encoding of parity games into systems of particular integer equations. Moreover, we present a simplification of the algorithm for integer systems from [?]. For the given encoding of parity games, the new algorithm provides another algorithm for parity games which is almost as efficient as the discrete strategy improvement algorithm by V
Thomas Gawlitza, Helmut Seidl
Added 26 Oct 2010
Updated 26 Oct 2010
Type Conference
Year 2008
Where FM
Authors Thomas Gawlitza, Helmut Seidl
Comments (0)