.png){kind=icon}
返回
Backward bisimulation in Markov chain model checking
.png){kind=icon}
OA
AI
DOI：10.1109/TSE.2006.74.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Equivalence relations can be used to reduce the state space of a system model, thereby permitting more efficient analysis. We study backward stochastic bisimulation in the context of model checking continuous-time Markov chains against Continuous Stochastic Logic (CSL) properties. While there are simple CSL properties that are not preserved when reducing the state space of a continuous-time Markov chain using backward stochastic bisimulation, we show that the equivalence can nevertheless be used in the verification of a practically significant class of CSL properties. We consider an extension of these results to Markov reward models and Continuous Stochastic Reward Logic. Furthermore, we identify the logical properties for which the requirement on the equality of state-labeling sets ( normally imposed on state equivalences in a model-checking context) can be omitted from the definition of the equivalence, resulting in a better state-space reduction.
Keyword:
Markov processes
model checking
temporal logic
verification
期刊
IF:
5.6
论文数:
2.9K
被引数:
1.1W
机构
暂无机构信息
引用论文
Synthesis, Characterisation and Catalytic Application of Oxidorhenium Complexes Bearing H‐Spirophosphorane Ligands含h-螺膦配体的氧化铼配合物的合成，表征及催化应用
PREAI
分享收藏Multi-stage kimberlite evolution tracked in zoned olivine from the Benfontein sill, South Africa.png)
Lithos
OAAI
LithosIF0
OAAI分享收藏
查看更多内容