Tableau-based model checking in the propositional mu-calculus
Acta Informatica
Tree automata, Mu-Calculus and determinacy
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Symbolic model checking: 1020 states and beyond
Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
A subexponential randomized algorithm for the simple stochastic game problem
Information and Computation
The complexity of mean payoff games on graphs
Theoretical Computer Science
Theory of hybrid systems and discrete event systems
Theory of hybrid systems and discrete event systems
Fast and simple nested fixpoints
Information Processing Letters
Deciding the winner in parity games is in UP ∩ co-UP
Information Processing Letters
On model checking for the &mgr;-calculus and its fragments
Theoretical Computer Science
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Bounded Model Checking Using Satisfiability Solving
Formal Methods in System Design
Extending and implementing the stable model semantics
Artificial Intelligence
Modal µ-Calculus, Model Checking and Gauß Elimination
TACAS '95 Proceedings of the First International Workshop on Tools and Algorithms for Construction and Analysis of Systems
A Discrete Subexponential Algorithm for Parity Games
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Small Progress Measures for Solving Parity Games
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Implementation of a Strategy Improvement Algorithm for Finite-State Parity Games
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
A Discrete Strategy Improvement Algorithm for Solving Parity Games
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Faster Model Checking for the Modal Mu-Calculus
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
A deterministic subexponential algorithm for solving parity games
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Bounded Model Checking for All Regular Properties
Electronic Notes in Theoretical Computer Science (ENTCS)
Bounded model checking for weak alternating büchi automata
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
DPLL(T) with exhaustive theory propagation and its application to difference logic
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Solving alternating boolean equation systems in answer set programming
INAP'04/WLP'04 Proceedings of the 15th international conference on Applications of Declarative Programming and Knowledge Management, and 18th international conference on Workshop on Logic Programming
Hi-index | 0.00 |
This paper presents a reduction from the problem of solving parity games to the satisfiability problem in propositional logic (SAT). The reduction is done in two stages, first into difference logic, i.e. SAT combined with the theory of integer differences, an instance of the SAT modulo theories (SMT) framework. In the second stage the integer variables and constraints of the difference logic encoding are replaced with a set of Boolean variables and constraints on them, giving rise to a pure SAT encoding of the problem. The reduction uses Jurdzinski@?s characterisation of winning strategies via progress measures. The reduction is motivated by the success of SAT solvers in symbolic verification, bounded model checking in particular. The paper reports on prototype implementations of the reductions and presents some experimental results.