Wimmer, Ralf and Jansen, Nils and Ã?brahÃ?m, Erika and Katoen, Joost-Pieter - High-level Counterexamples for Probabilistic Automata

lmcs:945 - Logical Methods in Computer Science, March 31, 2015, Volume 11, Issue 1
High-level Counterexamples for Probabilistic Automata

Authors: Wimmer, Ralf and Jansen, Nils and Ã?brahÃ?m, Erika and Katoen, Joost-Pieter

Providing compact and understandable counterexamples for violated system properties is an essential task in model checking. Existing works on counterexamples for probabilistic systems so far computed either a large set of system runs or a subset of the system's states, both of which are of limited use in manual debugging. Many probabilistic systems are described in a guarded command language like the one used by the popular model checker PRISM. In this paper we describe how a smallest possible subset of the commands can be identified which together make the system erroneous. We additionally show how the selected commands can be further simplified to obtain a well-understandable counterexample.


Source : oai:arXiv.org:1305.5055
DOI : 10.2168/LMCS-11(1:15)2015
Volume: Volume 11, Issue 1
Published on: March 31, 2015
Submitted on: January 6, 2014
Keywords: Computer Science - Software Engineering,Computer Science - Logic in Computer Science


Share

Consultation statistics

This page has been seen 136 times.
This article's PDF has been downloaded 59 times.