返回
Anti-chain based algorithms for timed/probabilistic refinement checking
DOI:10.1007/s11432-017-9133-4.png)
摘要
En 中文
Refinement checking answers the question on whether an implementation model is a refinement of a specification model, which is of great value for system verification. Some refinement relationships, e.g., trace refinement and failures/divergence refinement, have been recognized for different verification purposes. In general, refinement checking algorithms often rely on subset construction, which incurs in the state space explosion problem. Recently the anti-chain based approach has been suggested for trace refinement checking, and the results show a significant improvement. In this paper, we investigate the problems of applying the anti-chain approach to timed refinement checking (a timed implementation vs. a timed or untimed specification) and probabilistic refinement checking (a probabilistic implementation vs. a non-probabilistic specification), and show that the state space can be reduced considerably by employing the anti-chain approach. All the algorithms have been integrated into the model checking tool PAT, and the experiments have been conducted to show the efficiency of the application of anti-chains.
Keyword:
model checking
refinement
anti-chain
timed automata
markov decision process
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
4.9K
被引数:
8.9K
机构
引用论文
Concentrations and origin of polycyclic aromatic hydrocarbons in sediments of the Middle Adriatic Sea亚得里亚海中部沉积物中多环芳烃的浓度和来源
Magnetic properties of CoFe1.9RE0.1O4 nanoparticles (RE=La, Ce, Nd, Sm, Eu, Gd, Tb, Ho) prepared in polyol在多元醇中制备的CoFe1.9RE0.1O4纳米颗粒 (RE = La,Ce,Nd,Sm,Eu,Gd,Tb,Ho) 的磁性能

