3 search results - page 1 / 1 » From Parity Games to Circular Proofs |
ENTCS
2002
13 years 8 months ago
2002
FM
2008
Springer
13 years 10 months ago
2008
Springer
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 showin...
CONCUR
2009
Springer
14 years 3 months ago
2009
Springer
We present a new algorithm for computing the winning region of a parity game played over the configuration graph of a pushdown system. Our method gives the first extension of the...