Journal of Computer and System Sciences - 26th IEEE Conference on Foundations of Computer Science, October 21-23, 1985
Integer programming vs. expert systems: an experimental comparison
Communications of the ACM
On total functions, existence theorems and computational complexity
Theoretical Computer Science
Tree automata, Mu-Calculus and determinacy
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
The complexity of stochastic games
Information and Computation
On the complexity of the parity argument and other inefficient proofs of existence
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
Artificial intelligence: a modern approach
Artificial intelligence: a modern approach
Theory of hybrid systems and discrete event systems
Theory of hybrid systems and discrete event systems
Deciding the winner in parity games is in UP ∩ co-UP
Information Processing Letters
Model checking
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
A Discrete Strategy Improvement Algorithm for Solving Parity Games
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
On Model-Checking for Fragments of µ-Calculus
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
A deterministic subexponential algorithm for solving parity games
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
The NP-completeness column: Finding needles in haystacks
ACM Transactions on Algorithms (TALG)
Simple stochastic games and p-matrix generalized linear complementarity problems
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
| Hi-index | 0.00 |
No matter from the theoretical or practical perspective, solving parity game plays a very important role. On one side, this problem possesses some amazing properties of computational complexity, and people are still searching for a polynomial time algorithm. On the other side, solving it and modal mu-calculus are almost the same in nature, so any efficient algorithm concerning this topic can be applied to model checking problem of modal mu-calculus. Considering the importance of modal mu-calculus in the automatic verification field, a series of model checkers will benefit from it. The main purpose of our study is to use constraints satisfaction problem (CSP), a deeply-studied and widely-accepted method, to settle parity game. The significance lies in that we can design efficient model checker through introducing various CSP algorithms, hence open a door to explore this problem of practical importance from a different viewpoint. In the paper, we propose a CSP-based algorithm and the related experimental results are presented.