Minimal Critical Subsystems for PCTL

Abstract

Probabilistic counterexamples form a crucial part of model checking probabilistic systems represented as Markov chains. They provide invaluable debugging information. Minimal critical subsystems are known to be succinct representations of these counterexamples. The SAT-modulo theories formulation and the mixed integer linear programming formulation compute… (More)

Topics

16 Figures and Tables

Slides referencing similar topics