Complexity of Model Checking by Iterative Improvement: The Pseudo-Boolean Framework

We present several new algorithms as well as new lower and upper bounds for optimizing functions underlying infinite games pertinent to computer-aided verification.

[1]  E. Allen Emerson,et al.  Tree automata, mu-calculus and determinacy , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[2]  Henrik Björklund,et al.  Algorithms for Combinatorial Optimization and Games Adapted from Linear Programming , 2003 .

[3]  Henrik Björklund,et al.  An Experimental Study of Algorithms for Completely Unimodal Optimization , 2002 .

[4]  Walter Ludwig,et al.  A Subexponential Randomized Algorithm for the Simple Stochastic Game Problem , 1995, Inf. Comput..

[5]  Marcin Jurdzinski,et al.  A Discrete Strategy Improvement Algorithm for Solving Parity Games , 2000, CAV.

[6]  Gil Kalai,et al.  A subexponential randomized simplex algorithm (extended abstract) , 1992, STOC '92.

[7]  Bernd Gärtner.  A Subexponential Algorithm for Abstract Optimization Problems , 1995, SIAM J. Comput..

[8]  Viktor Petersson,et al.  A Randomized Subexponential Algorithm for Parity Games , 2001, Nord. J. Comput..

[9]  E. Allen Emerson,et al.  Model Checking and the Mu-calculus , 1996, Descriptive Complexity and Finite Models.

[10]  Bernd Gärtner.  The Random-Facet simplex algorithm on combinatorial cubes , 2002, Random Struct. Algorithms.

[11]  Micha Sharir,et al.  A subexponential bound for linear programming , 1992, SCG '92.

[12]  Peter L. Hammer,et al.  From Linear Separability to Unimodality: A Hierarchy of Pseudo-Boolean Functions , 1988, SIAM J. Discret. Math..

[13]  Henrik Björklund,et al.  A Discrete Subexponential Algorithm for Parity Games , 2003, STACS.

[14]  J. K. Lenstra,et al.  Local Search in Combinatorial Optimisation. , 1997 .

[15]  Christos H. Papadimitriou,et al.  Algorithms, Games, and the Internet , 2001, ICALP.

[16]  Henrik Björklund,et al.  Optimization on Completely Unimodal Hypercubes , 2002 .

[17]  R. Karp,et al.  On Nonterminating Stochastic Games , 1966 .

[18]  Stephan Merz,et al.  Model Checking , 2000 .

[19]  Yishay Mansour,et al.  On the Complexity of Policy Iteration , 1999, UAI.

[20]  Pierre Hansen,et al.  Constrained Nonlinear 0-1 Programming , 1989 .

[21]  Henrik Björklund,et al.  Experiments with iterative improvement algorithms on completely unimodel hypercubes , 2001 .

[22]  Marcin Jurdzinski,et al.  Small Progress Measures for Solving Parity Games , 2000, STACS.

[23]  Micha Sharir,et al.  A Combinatorial Bound for Linear Programming and Related Problems , 1992, STACS.

[24]  Endre Boros,et al.  Pseudo-Boolean optimization , 2002, Discret. Appl. Math..

[25]  Pierre Hansen,et al.  State-of-the-Art Survey - Constrained Nonlinear 0-1 Programming , 1993, INFORMS J. Comput..

[26]  Uri Zwick,et al.  The Complexity of Mean Payoff Games on Graphs , 1996, Theor. Comput. Sci..

[27]  Anne Condon,et al.  On Algorithms for Simple Stochastic Games , 1990, Advances In Computational Complexity Theory.

[28]  Anne Condon,et al.  The Complexity of Stochastic Games , 1992, Inf. Comput..

[29]  José D. P. Rolim,et al.  Randomization and Approximation Techniques in Computer Science , 2002, Lecture Notes in Computer Science.

[30]  Craig A. Tovey,et al.  3. Local improvement on discrete structures , 2003 .

[31]  Henrik Björklund,et al.  On Combinatorial Structure and Algorithms for Parity Games , 2003 .

[32]  Bernd Gärtner.  Combinatorial Linear Programming: Geometry Can Help , 1998, RANDOM.

[33]  Thomas Wilke,et al.  Automata logics, and infinite games: a guide to current research , 2002 .

[34]  Thomas Wilke,et al.  Automata Logics, and Infinite Games , 2002, Lecture Notes in Computer Science.

[35]  Kathy Williamson Hoke,et al.  Completely unimodal numberings of a simple polytope , 1988, Discret. Appl. Math..