Theory of linear and integer programming
Theory of linear and integer programming
Fast randomized consensus using shared memory
Journal of Algorithms
Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time systems
Probabilistic models for the guarded command language
Science of Computer Programming - Special issue: on formal specifications: foundations, methods, tools and applications: selected papers from the FMTA '95 conference (29–31 May 1995, Konstancin n. Warsaw, Poland)
Guarded commands, nondeterminacy and formal derivation of programs
Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Probabilistic Model Checking of the IEEE 802.11 Wireless Local Area Network Protocol
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
A Compositional Trace-Based Semantics for Probabilistic Automata
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Model Checking of Probabalistic and Nondeterministic Systems
Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
Counterexample-Guided Abstraction Refinement
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Principles of Model Checking (Representation and Mind Series)
Principles of Model Checking (Representation and Mind Series)
25 Years of Model Checking
Automated Assume-Guarantee Reasoning by Abstraction Refinement
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
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
IEEE Transactions on Software Engineering
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
Minimal critical subsystems for discrete-time markov models
TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Assume-guarantee abstraction refinement for probabilistic systems
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
QEST '12 Proceedings of the 2012 Ninth International Conference on Quantitative Evaluation of Systems
Hi-index | 0.00 |
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 the commands can be identified which together already make the system erroneous. We additionally show how the selected commands can be further simplified to obtain a well-understandable counterexample.