Abstract
Box-pushing games are a challenging problem for both man and machine since it is not easy to find out a minimal solution for the games. This paper describes a formal framework for solving the games via symbolic model checking techniques. Since our method is automatic and sound, it gives a minimal solution if model checking succeeds. However, this framework is not complete so that it fails to find an answer in case the state explosion problem occurs. Push-Push chosen as a case game consists of 50 games. 43 games are solved with NuSMV but 7 failed due to the state explosion problem. Thus we devise several optimization techniques for the games to mitigate the state explosion problem such as abstraction, relay model checking, and efficient counterexample generations. As a result, we solve all games with minimal solution.
This work was supported by grant No.R05-2004-000-10612-0 from Ministry of Science & Technology.
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
Clarke, E.M., Grumberg, O., Peled, D.: Model Checking. MIT Press, Cambridge (1999)
Cimatti, A., Clarke, E.M., Giunchiglia, E., Giunchiglia, F., Pistore, M., Roveri, M., Sebastiani, R., Tacchella, A.: NuSMV 2: An openSource tool for symbolic model checking. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, p. 359. Springer, Heidelberg (2002)
Junghanns, A., Schaeffer, J.: Sokoban: Evaluating single search agent search techniques in the presence of deadlock. In: Proceedings of CSCSI 1998 (1998)
Edelkamp, S., Reffel, F.: OBDDs in Heuristic Search. In: Herzog, O. (ed.) KI 1998. LNCS, vol. 1504, pp. 81–92. Springer, Heidelberg (1998)
Junghanns, A., Schaeffer, J.: Sokoban: A Challenging Single-Agent Search Problem. Games in AI Research (1999)
Clarke, E.M., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Progress on the State Explosion Problem in Model Checking. In: Wilhelm, R. (ed.) Informatics: 10 Years Back, 10 Years Ahead. LNCS, vol. 2000, pp. 154–169. Springer, Heidelberg (2000)
Lu, Y.: Automatic Abstraction in Model Checking. Ph.D. thesis, Carnegie Mellon University, Department of Electrical and Computer Engineering (2000)
Kwon, G.: Abstraction of Models with State Projections in Model Checking. Journal of Korea Information Processing Society (December 2004) (to be published)
Lee, T., Kwon, G.: Relay Model checking for Avoiding The State Explosion Problem. In: Proceedings of SERA 2004, pp. 305–310 (2004)
Kwon, G.: Efficient Counterexample Generations for Solving Reachability Games.In: Proceedings of SERA 2004, pp. 8–13 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kwon, G., Lee, T. (2004). Solving Box-Pushing Games via Model Checking with Optimizations. In: Wang, F. (eds) Automated Technology for Verification and Analysis. ATVA 2004. Lecture Notes in Computer Science, vol 3299. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30476-0_43
Download citation
DOI: https://doi.org/10.1007/978-3-540-30476-0_43
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23610-8
Online ISBN: 978-3-540-30476-0
eBook Packages: Springer Book Archive