A randomized protocol for signing contracts
Communications of the ACM
Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Symmetry breaking in distributed networks
Information and Computation
Efficient generation of counterexamples and witnesses in symbolic model checking
DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
Dynamic variable ordering for ordered binary decision diagrams
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Bounded Model Checking Using Satisfiability Solving
Formal Methods in System Design
Multi-Terminal Binary Decision Diagrams: An Efficient DataStructure for Matrix Representation
Formal Methods in System Design
Tree-Like Counterexamples in Model Checking
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
BDD-Based Debugging Of Design Using Language Containment and Fair CTL
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Analysis of probabilistic contract signing
Journal of Computer Security
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Regular Expressions for PCTL Counterexamples
QEST '08 Proceedings of the 2008 Fifth International Conference on Quantitative Evaluation of Systems
Probabilistic Model Checking and Reliability of Results
DDECS '08 Proceedings of the 2008 11th IEEE Workshop on Design and Diagnostics of Electronic Circuits and Systems
Counterexamples in probabilistic model checking
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Counterexamples for timed probabilistic reachability
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
Extended directed search for probabilistic timed reachability
FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
PRISM: a tool for automatic verification of probabilistic systems
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Counterexamples in Probabilistic LTL Model Checking for Markov Chains
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Dependability Engineering of Silent Self-stabilizing Systems
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Counterexample generation for Markov chains using SMT-based bounded model checking
FMOODS'11/FORTE'11 Proceedings of the joint 13th IFIP WG 6.1 and 30th IFIP WG 6.1 international conference on Formal techniques for distributed systems
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
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
| Hi-index | 0.00 |
Since its introduction in 1999, bounded model checking has gained industrial relevance for detecting errors in digital and hybrid systems. One of the main reasons for this is that it always provides a counterexample when an erroneous execution trace is found. Such a counterexample can guide the designer while debugging the system. In this paper we are investigating how bounded model checking can be applied to generate counterexamples for a different kind of model--namely discrete-time Markov chains. Since in this case counterexamples in general do not consist of a single path to a safety-critical state, but of a potentially large set of paths, novel optimization techniques like loop-detection are applied not only to speed-up the counterexample computation, but also to reduce the size of the counterexamples significantly. We report on some experiments which demonstrate the practical applicability of our method.