Incremental bisimulation abstraction refinement
文献类型：会议论文
| 作者 | Song, Lei (1) ; Zhang, Lijun (2) ; Hermanns, Holger (1) ; Godskesen, Jens Chr. (3) |
| 出版日期 | 2013 |
| 会议名称 | 2013 13th International Conference on Application of Concurrency to System Design, ACSD 2013 |
| 会议日期 | July 8, 2013 - July 10, 2013 |
| 会议地点 | Barcelona, Spain |
| 关键词 | Algorithms Experimentation Verification Bisimulation CEGAR probabilistic automata |
| 页码 | 11-20 |
| 中文摘要 | Abstraction refinement techniques in probabilistic model checking are prominent approaches to the verification of very large or infinite-state probabilistic concurrent systems. At the core of the refinement step lies the implicit or explicit analysis of a counterexample. This paper proposes an abstraction refinement approach for the probabilistic computation tree logic (PCTL), which is based on incrementally computing a sequence of may- and must-quotient automata. These are induced by depth-bounded bisimulation equivalences of increasing depth. The approach is both sound and complete, since the equivalences converge to the genuine PCTL equivalence. Experimental results with a prototype implementation show the effectiveness of the approach. © 2013 IEEE. |
| 英文摘要 | Abstraction refinement techniques in probabilistic model checking are prominent approaches to the verification of very large or infinite-state probabilistic concurrent systems. At the core of the refinement step lies the implicit or explicit analysis of a counterexample. This paper proposes an abstraction refinement approach for the probabilistic computation tree logic (PCTL), which is based on incrementally computing a sequence of may- and must-quotient automata. These are induced by depth-bounded bisimulation equivalences of increasing depth. The approach is both sound and complete, since the equivalences converge to the genuine PCTL equivalence. Experimental results with a prototype implementation show the effectiveness of the approach. © 2013 IEEE. |
| 收录类别 | SCI ; EI |
| 会议录出版地 | Institute of Electrical and Electronics Engineers Inc., 3 Park Avenue, 17th Floor, New York, NY 10016-5997, United States |
| 语种 | 英语 |
| ISSN号 | 15504808 |
| ISBN号 | 9780769550350 |
| WOS记录号 | WOS:000341390100025 |
| 源URL | [http://ir.iscas.ac.cn/handle/311060/16502]  |
| 专题 | 软件研究所_软件所图书馆_会议论文 |
| 推荐引用方式 GB/T 7714 | Song, Lei ,Zhang, Lijun ,Hermanns, Holger ,et al. Incremental bisimulation abstraction refinement[C]. 见:2013 13th International Conference on Application of Concurrency to System Design, ACSD 2013. Barcelona, Spain. July 8, 2013 - July 10, 2013. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。