Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1007/s11432-017-9133-4 | SCIENCE CHINA Information Sciences |
Keywords | DocType | Volume |
model checking, refinement, anti-chain, timed automata, markov decision process | Journal | 61 |
Issue | ISSN | Citations |
5 | 1674-733X | 0 |
PageRank | References | Authors |
0.34 | 26 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ting Wang | 1 | 664 | 65.43 |
| Tieming Chen | 2 | 29 | 5.11 |
| Yang Liu | 3 | 2194 | 188.81 |
| Ye Wang | 4 | 26 | 3.59 |