State space reduction techniques have been developed to increase the efficiency of model checking in the context of imperative programming languages. Unfortunately, these techniques cannot straightforwardly be applied to agents: the nature of states in the two programming paradigms differs too much for this to be possible. To resolve this, we adapt core definitions on which existing reduction algorithms are based to agents. Moreover, the framework that we introduce is such that different reduction algorithms can be defined in terms of the same relations. This is beneficial because it enables the reuse of code and reduces computation time when different techniques are used simultaneously. Specifically, we adapt and combine two known techniques: property-based slicing and partial order reduction. We exemplify our work with the GOAL agent programming language, and implement the theory that we present for GOAL. Several experiments with this implementation show that performance is in line with known results from traditional model checking.
Additional Metadata
THEME Software (theme 1)
Publisher Springer
Editor L. Dennis , O. Boissier , R.H. Bordini (Rafael)
Series Lecture Notes in Computer Science
Conference International Workshop on Programming Multi-Agent Systems
Citation
Jongmans, S.-S.T.Q, Hindriks, K.V, & van Riemsdijk, M.B. (2012). State Space Reduction for Model Checking Agent Programs. In L Dennis, O Boissier, & R.H Bordini (Eds.), Programming Multi-Agent Systems (pp. 133–151). Springer.