The Causal Graph Revisited for Directed Model Checking
Directed model checking is a well-established technique to tackle the state explosion problem when the aim is to find error states in large systems. In this approach, the state space traversal is guided through a function that estimates the distance to nearest error states. States with lower estimates are preferably expanded during the search. Obviously, the challenge is to develop distance functions that are efficiently computable on the one hand and as informative as possible on the other hand. In this paper, we introduce the causal graph structure to the context of directed model checking. Based on causal graph analysis, we first adapt a distance estimation function from AI planning to directed model checking. Furthermore, we investigate an abstraction that is guaranteed to preserve error states. The experimental evaluation shows the practical potential of these techniques.
Unable to display preview. Download preview PDF.
- 2.Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. The MIT Press, Cambridge (2000)Google Scholar
- 7.Helmert, M.: A planning heuristic based on causal graph analysis. In: Zilberstein, S., Koehler, J., Koenig, S. (eds.) Proceedings of the 14th International Conference on Automated Planning and Scheduling (ICAPS 2004), pp. 161–170. AAAI Press, Menlo Park (2004)Google Scholar
- 9.Helmert, M., Geffner, H.: Unifying the causal graph and additive heuristics. In: Rintanen, J., Nebel, B., Beck, J.C., Hansen, E. (eds.) Proceedings of the 18th International Conference on Automated Planning and Scheduling (ICAPS 2008). AAAI Press, Menlo Park (2008)Google Scholar
- 17.Pearl, J.: Heuristics: Intelligent search strategies for computer problem solving. Addison-Wesley, Reading (1984)Google Scholar
- 19.Seitz, C.L.: Ideas about arbiters. Lambda 1, 10–14 (1980)Google Scholar