Counterexample explanation by learning small strategies in Markov decision processes Conference Paper

Author(s): Brázdil, Tomáš; Chatterjee, Krishnendu; Chmelík, Martin; Fellner, Andreas; Křetínský, Jan
Title: Counterexample explanation by learning small strategies in Markov decision processes
Title Series: LNCS
Affiliation IST Austria
Abstract: For deterministic systems, a counterexample to a property can simply be an error trace, whereas counterexamples in probabilistic systems are necessarily more complex. For instance, a set of erroneous traces with a sufficient cumulative probability mass can be used. Since these are too large objects to understand and manipulate, compact representations such as subchains have been considered. In the case of probabilistic systems with non-determinism, the situation is even more complex. While a subchain for a given strategy (or scheduler, resolving non-determinism) is a straightforward choice, we take a different approach. Instead, we focus on the strategy itself, and extract the most important decisions it makes, and present its succinct representation. The key tools we employ to achieve this are (1) introducing a concept of importance of a state w.r.t. the strategy, and (2) learning using decision trees. There are three main consequent advantages of our approach. Firstly, it exploits the quantitative information on states, stressing the more important decisions. Secondly, it leads to a greater variability and degree of freedom in representing the strategies. Thirdly, the representation uses a self-explanatory data structure. In summary, our approach produces more succinct and more explainable strategies, as opposed to e.g. binary decision diagrams. Finally, our experimental results show that we can extract several rules describing the strategy even for very large systems that do not fit in memory, and based on the rules explain the erroneous behaviour.
Conference Title: CAV: Computer Aided Verification
Volume: 9206
Conference Dates: July 18-24, 2015
Conference Location: San Francisco, CA, USA
Publisher: Springer  
Date Published: 2015-07-16
Start Page: 158
End Page: 177
DOI: 10.1007/978-3-319-21690-4_10
Notes: This research was funded in part by Austrian Science Fund (FWF) Grant No P 23499-N23, FWF NFN Grant No S11407-N23 (RiSE) and Z211-N23 (Wittgenstein Award), European Research Council (ERC) Grant No 279307 (Graph Games), ERC Grant No 267989 (QUAREM), the Czech Science Foundation Grant No P202/12/G061, and People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007–2013) REA Grant No 291734.
Open access: yes (repository)
IST Austria Authors
  1. Martin Chmelik
    23 Chmelik
Related IST Austria Work