Abstract
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.
Research supported by China Postdoctoral Science Foundation funded project under contract No. 20070420749; the National High-Tech Research and Development Plan of China under contract No.2006AA01Z129; the National High-Tech Research and Development Plan of China under contract No. 2007AA01Z185.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chen, X., Deng, X.: 3-NASH is PPAD-Complete. ECCC (2005) TR05-134
Chen, X., Deng, X.: Settling the Complexity of 2-player Nash Equilibrium. ECCC (2005) TR05-140
Daskalakis, C., Papadimitriou, C. H.: Three-Players Games are Hard. ECCC (2005) TR05-139
Nash, J.F.: Non-cooperative games. Annals of Mathematics (54), 286–295 (1951)
Condon, A.: The complexity of stochastic games. Information and Computation, 203–224 (1992)
David, S.J.: The NP-completeness column: Finding needles in haystacks. ACM Transactions on Algorithms 3(2), 24 (2007)
Emerson, E.A., Jutla, C.S., Sistla, A.P.: On Model-Checking for Fragments of mu-Calculus. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol. 697, pp. 385–396. Springer, Heidelberg (1993)
Gartner, B., Rust, L.: Simple Stochastic Games and P-Matrix Generalized Linear Complementarity Problems. In: Liśkiewicz, M., Reischuk, R. (eds.) FCT 2005. LNCS, vol. 3623, pp. 209–220. Springer, Heidelberg (2005)
Johnson, D.S., Papadimtriou, C.H., Yannakakis, M.: How easy is local search? Journal of Computer and System Sciences 37, 79–100 (1988)
Juba, B.: On the hardness of simple stochastic games (manuscript, 2004)
Jurdzinski, M.: Deciding the winner in parity games is in UP and co-UP. Information Processing Letters 68, 119–124 (1998)
Megiddo, N., Papadimitriou, C.H.: A note on total functions, existence theorems, and computational complexity. Theoretical Computer Science 81, 317–324 (1991)
Papadimitriou, C.H.: On the complexity of the parity argument and other inefficient proofs of existence. Journal of Computer and System Sciences 48, 498–532 (1994)
Hoffman, A.J., Karp, R.M.: On Nonterminating Stochastic Games. Management Science 12, 359–370 (1966)
Bjorklund, H., Sandberg, S., Vorobyov, S.: A discrete subexponential algorithm for parity games. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol. 2607, pp. 663–674. Springer, Heidelberg (2003)
Jurdzinski, M., Paterson, M., Zwick, U.: A deterministic subexponential algorithm for solving parity games. In: SODA 2006, Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, pp. 117–123 (2006)
Jurdzinski, M., Ics, B.R.: Small Progress Measures for Solving Parity Games. In: STACS 2000, 17th Annual Symposium on Theoretical Aspects of Computer Science Lille, France, February 17-19 (2000)
Klarlund, N., Kozen, D.: Rabin measures and their applications to fairness and automatatheory. In: LICS 1991, Proceedings of Sixth Annual IEEE Symposium on Logic in Computer Science, pp. 256–265 (1991)
Puri, A.: Theory of hybrid systems and discrete event systems. Ph.D thesis, University of California, Berkeley (1996)
Voge, J., Jurdziiiski, M.: A Discrete Strategy Improvement Algorithm for Solving Parity Games. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 202–215. Springer, Heidelberg (2000)
Clarke, E.M., Grumberg, O., Peled, D.: Model Checking. MIT Press, Cambridge (1999)
Dhar, V., Ranganathan, N.: Integer Programming vs Expert Systems: An Experimental Comparison. Communications of the ACM, 323–336 (1990)
de Kleer, J., Sussman, G.J.: Propagation of Constraints Applied to Circuit Synthesis. Circuit Theory and Applications, 127–144 (1980)
Davis, A.L., Rosenfeld, A.: Cooperating Processes for Low Level Vision: A Survey. Articial Intelligence, 245–263 (1981)
Russell, S., Norvig, P.: Artificial Intelligence: a Modern Approach. Prentice Hall, Englewood Cliffs (2000)
Emerson, E.A., Jutla, C.S.: Tree automata, mu-calculus and determinacy. In: FOCS 1991, Proceedings of 32nd Annual Symposium on Foundations of Computer Science, pp. 368–377 (1991)
Mostowski, A.W.: Games with forbidden positions. Technical Report 78, University of Gdansk (1991)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jiang, M., Zhou, C., Wu, G., Zhang, F. (2008). A CSP-Based Approach for Solving Parity Game. In: Preparata, F.P., Wu, X., Yin, J. (eds) Frontiers in Algorithmics. FAW 2008. Lecture Notes in Computer Science, vol 5059. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69311-6_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-69311-6_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69310-9
Online ISBN: 978-3-540-69311-6
eBook Packages: Computer ScienceComputer Science (R0)