High-Level Counterexamples for Probabilistic Automata

@inproceedings{Wimmer2013HighLevelCF,
  title={High-Level Counterexamples for Probabilistic Automata},
  author={Ralf Wimmer and N. Jansen and Andreas Vorpahl and Erika {\'A}brah{\'a}m and Joost-Pieter Katoen and Bernd Becker},
  booktitle={International Conference on Quantitative Evaluation of Systems},
  year={2013}
}
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 minimal subset of… 

Figures and Tables from this paper

HIGH-LEVEL COUNTEREXAMPLES

This paper describes how a smallest possible subset of the commands can be identified which together make the system erroneous and shows how the selected commands can been further simplified to obtain a well-understandable counterexample.

Fast Debugging of PRISM Models

This work's novel approach to computing a minimal critical command set achieves a speed-up of up to five orders of magnitude over the previously existing technique.

Counterexample Generation for Discrete-Time Markov Models: An Introductory Survey

This paper is an introductory survey of available methods for the computation and representation of probabilistic counterexamples for discrete-time Markov chains and Probabilistic automata, using explicit and symbolic techniques.

Counterexamples in Model Checking - A survey

Algorithms for counterexample generation are surveyed, from classical algorithms in graph theory to novel algorithms for producing small and indicative countserexamples, and how they can benefit from delivering countereXamples for other purposes.

Bounded Model Checking for Probabilistic Programs

This paper proposes an on–the–fly approach where the operational model is successively created and verified via a step–wise execution of the program, enabling to take key features of many probabilistic programs into account: nondeterminism and conditioning.

Counterexample-Driven Synthesis for Probabilistic Program Sketches

This work adopts counterexample-guided inductive synthesis (CEGIS) to automatically synthesise finite-state probabilistic programs to deal with uncertainty in e.g. controller synthesis.

The probabilistic model checker Storm: symbolic methods for probabilistic model checking

The JANI modeling language is proposed to unify the multitude of input languages of probabilistic model checkers and is shown to drastically reduce the sizes of models involving probabilities, continuous time, nondeterminism and rewards.

Debugging of Markov Decision Processes (MDPs) Models

This paper proposes an aided-diagnostic method for probabilistic counterexamples based on the notions of causality, responsibility and blame for Markov Decision Processes (MDPs).

Minimal witnesses for probabilistic timed automata

Using a new operation on difference bounds matrices, it is shown how Farkas certificates of finite-state bisimulation quotients of a PTA can be translated into witnessing subsystems.

On Abstraction of Probabilistic Systems

This paper surveys various abstraction techniques proposed in the past decade and identifies in what sense properties are preserved or provide alternatively suitable boundaries.

References

SHOWING 1-10 OF 44 REFERENCES

High-level Counterexamples for Probabilistic Automata – Extended Version ? –

This paper describes how a minimal subset of the commands can be identified which together already make the system erroneous and shows how the selected commands could be further simplified to obtain a well-understandable counterexample.

Fast Debugging of PRISM Models

This work's novel approach to computing a minimal critical command set achieves a speed-up of up to five orders of magnitude over the previously existing technique.

Minimal counterexamples for linear-time probabilistic verification

Counterexample Generation for Discrete-Time Markov Models: An Introductory Survey

This paper is an introductory survey of available methods for the computation and representation of probabilistic counterexamples for discrete-time Markov chains and Probabilistic automata, using explicit and symbolic techniques.

Minimal Counterexamples for Refuting ω-Regular Properties of Markov Decision Processes – Extended Version –

This paper proposes the usage of minimal critical subsystems of discrete-time Markov chains and Markov decision processes as counterexamples for violated ω-regular properties and shows how to compute such subsystems using mixed integer linear programming.

Counterexample Generation for Discrete-Time Markov Chains Using Bounded Model Checking

This paper is investigating how bounded model checking can be applied to generate counterexamples for a different kind of model--namely discrete-time Markov chains, and novel optimization techniques like loop-detection are applied.

Model Checking of Probabalistic and Nondeterministic Systems

Model-checking algorithms for extensions of pCTL and p CTL* to systems in which the probabilistic behavior coexists with nondeterminism are presented, and it is shown that these algorithms have polynomial-time complexity in the size of the system.

Counterexample-guided abstraction refinement

  • E. Clarke
  • Computer Science
    10th International Symposium on Temporal Representation and Reasoning, 2003 and Fourth International Conference on Temporal Logic. Proceedings.
  • 2003
Counterexample-guided abstraction refinement is an automatic abstraction method where the key step is to extract information from false negatives ("spurious counterexamples") due to over-approximation.

Counterexample Generation in Probabilistic Model Checking

Algorithms for counterexample generation for probabilistic CTL formulae in discrete-time Markov chains and a simple algorithm to generate (minimal) regular expressions that can act as countereXamples are considered.

Assume-Guarantee Abstraction Refinement for Probabilistic Systems

We describe an automated technique for assume-guarantee style checking of strong simulation between a system and a specification, both expressed as non-deterministic Labeled Probabilistic Transition