A Discrete Stratety Improvement Algorithm for Solving Parity Games

@article{Jurdzinski2000ADS,
  title={A Discrete Stratety Improvement Algorithm for Solving Parity Games},
  author={Marcin Jurdzinski and Jens V{\"o}ge},
  journal={BRICS Report Series},
  year={2000},
  volume={7}
}
A discrete strategy improvement algorithm is given for constructing winning strategies in parity games, thereby providing also a new solution of the model-checking problem for the modal -calculus. Known strategy improvement algorithms, as proposed for stochastic games by Homan and Karp in 1966, and for discounted payoff games and parity games by Puri in 1995, work with real numbers and require solving linear programming instances involving high precision arithmetic. In the present algorithm for… 
10 Citations

Fatal Attractors in Parity Games: Building Blocks for Partial Solvers

TLDR
New forms of attractors are proposed that are monotone in that they are aware of specific static patterns of colors encountered in reaching a given node set in alternating fashion and can be embedded within greatest fixed-point computations to design solvers of parity games that run in polynomial time but are partial in thatthey may not decide the winning status of all nodes in the input game.

Efficient Guiding Towards Cost-Optimality in UPPAAL

TLDR
An algorithm for efficiently computing the minimum cost of reaching a goal state in the model of Uniformly Priced Timed Automata (UPTA) is presented, based on a symbolic semantics of UTPA, and an efficient representation and operations based on difference bound matrices.

Minimum-Cost Reachability for Priced Timed Automata

TLDR
This paper proves decidability of the minimum-cost reachability problem by offering an algorithmic solution, which is based on a combination of branch-and-bound techniques and a new notion of priced regions, which allows symbolic representation and manipulation of reachable states together with the cost of reaching them.

Higher Order Reverse Mathematics

TLDR
It is shown that the class of principles equivalent to Feferman's nonconstructive mu-operator forms a mathematically rich and very robust class over RCA^omega_0 of the second order base system RCA_0.

The Complexity of Constructing Evolutionary Trees Using Experiments

TLDR
An algorithm which constructs an evolutionary tree of n species in time O(nd logd n) using at most n⌈d/2⌉(log2ċd/ 2ċ 1 n+O(1)) experiments for d = 2, and improves the previous best upper bound by a factor Θ(log d).

Optimal time-space trade-offs for non-comparison-based sorting

TLDR
The results imply that recent space lower bounds for deciding element distinctness in time are nearly tight, which implies that existing priority queues and sorting algorithms can deterministically sort time-space optimally in time.

Modularity in Meta-Languages

TLDR
Here, most of the main meta-languages for operational, denotational, and hybrid styles of semantics are compared regarding their modularity.

How to Convert the Flavor of a Quantum Bit Commitment

In this paper we show how to convert a statistically binding but computationally concealing quantum bit commitment scheme into a computationally binding but statistically concealing QBC scheme. For a

A Discrete Strategy Improvement Algorithm for Solving Parity Games

A discrete strategy improvement algorithm is given for constructing winning strategies in parity games, thereby providing also a new solution of the model-checking problem for the modal μ-calculus.

CASL for CafeOBJ Users

TLDR
This paper presents Casl for users of the cafeOBJ framework, focusing on the relationship between the two languages, and motivates various Casl constructs that are not provided by CafeOBJ.