.png){kind=icon}
返回
Counterexample Generation in Probabilistic Model Checking
.png){kind=icon}
OA
AI
DOI：10.1109/TSE.2009.5.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Providing evidence for the refutation of a property is an essential, if not the most important, feature of model checking. This paper considers algorithms for counterexample generation for probabilistic CTL formulas in discrete-time Markov chains. Finding the strongest evidence (i.e., the most probable path) violating a (bounded) until-formula is shown to be reducible to a single-source (hop-constrained) shortest path problem. Counterexamples of smallest size that deviate most from the required probability bound can be obtained by applying (small amendments to) k-shortest (hop-constrained) paths algorithms. These results can be extended to Markov chains with rewards, to LTL model checking, and are useful for Markov decision processes. Experimental results show that, typically, the size of a counterexample is excessive. To obtain much more compact representations, we present a simple algorithm to generate (minimal) regular expressions that can act as counterexamples. The feasibility of our approach is illustrated by means of two communication protocols: leader election in an anonymous ring network and the Crowds protocol.
Keyword:
Diagnostic feedback
Markov chain
model checking
regular expression
shortest path
期刊
IF:
5.6
论文数:
2.8K
被引数:
1.1W
机构
引用论文
CANDIDA INFECTION OF LOCAL NECROSIS IN SEVERE ACUTE PANCREATITIS IS ASSOCIATED WITH INCREASED MORTALITY.png)
Shock
OAAI
ShockIF0
OAAI分享收藏Mechanical alloyed Ho3+ doping in CoFe2O4 spinel ferrite and understanding of magnetic nanodomains
PREAI
分享收藏Nanostructured hybrid NiFeOOH/CNT electrocatalysts for oxygen evolution reaction with low overpotentialRSC Advances
RSC AdvancesIF0
PREAI
分享收藏Biodiesel Production From the Microalgae Nannochloropsis by Microwave Using CaO and MgO CatalystsOAAI
OAAI分享收藏
查看更多内容