Minimal critical subsystems for discrete-time markov models

Authors:
Ralf Wimmer;Nils Jansen;Erika Ábrahám;Bernd Becker;Joost-Pieter Katoen
Affiliations:
Albert-Ludwigs-University, Freiburg, Germany;RWTH Aachen University, Germany;RWTH Aachen University, Germany;Albert-Ludwigs-University, Freiburg, Germany;RWTH Aachen University, Germany
Venue:
TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Year:
2012

Citing 18
Cited 3

Theory of linear and integer programming

Theory of linear and integer programming
Symmetry breaking in distributed networks

Information and Computation
Crowds: anonymity for Web transactions

ACM Transactions on Information and System Security (TISSEC)
Principles of Model Checking (Representation and Mind Series)

Principles of Model Checking (Representation and Mind Series)
Probabilistic CEGAR

CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Counterexample Generation for Discrete-Time Markov Chains Using Bounded Model Checking

VMCAI '09 Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation
Counterexample Generation in Probabilistic Model Checking

IEEE Transactions on Software Engineering
Significant Diagnostic Counterexamples in Probabilistic Model Checking

HVC '08 Proceedings of the 4th International Haifa Verification Conference on Hardware and Software: Verification and Testing
Counterexamples in Probabilistic LTL Model Checking for Markov Chains

CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Directed Explicit State-Space Search in the Generation of Counterexamples for Stochastic Model Checking

IEEE Transactions on Software Engineering
Symbolic calculation of k-shortest paths and related measures with the stochastic process algebra tool CASPA

Proceedings of the First Workshop on DYnamic Aspects in DEpendability Models for Fault-Tolerant Systems
Z3: an efficient SMT solver

TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
PCTL model checking of Markov chains: Truth and falsity as winning strategies in games

Performance Evaluation
A counterexample-guided abstraction-refinement framework for markov decision processes

ACM Transactions on Computational Logic (TOCL)
Satisfiability modulo theories: introduction and applications

Communications of the ACM
PRISM 4.0: verification of probabilistic real-time systems

CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Hierarchical counterexamples for discrete-time Markov chains

ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
A fast linear-arithmetic solver for DPLL(T)

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification

The COMICS tool: computing minimal counterexamples for DTMCs

ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
Refinement and difference for probabilistic automata

QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems
High-Level counterexamples for probabilistic automata

QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a new approach to compute counterexamples for violated ω-regular properties of discrete-time Markov chains and Markov decision processes. Whereas most approaches compute a set of system paths as a counterexample, we determine a critical subsystem that already violates the given property. In earlier work we introduced methods to compute such subsystems based on a search for shortest paths. In this paper we use SMT solvers and mixed integer linear programming to determine minimal critical subsystems.