More Anti-chain Based Refinement Checking
Refinement checking plays an important role in system verification. It establishes properties of an implementation by showing a refinement relationship between the implementation and a specification. Recently, it has been shown that anti-chain based approaches increase the efficiency of trace refinement checking significantly. In this work, we study the problem of adopting anti-chain for stable failures refinement checking, failures-divergence refinement checking and probabilistic refine checking (i.e., a probabilistic implementation against a non-probabilistic specification). We show that the first two problems can be significantly improved, because the state space of the product model may be reduced dramatically. Though applying anti-chain for probabilistic refinement checking is more complicated, we manage to show improvements in some cases. We have integrated these techniques into the PAT model checking framework. Experiments are conducted to demonstrate the efficiency of our approach.
KeywordsModel Check Label Transition System Check Algorithm Tree Automaton Synchronous Product
Unable to display preview. Download preview PDF.
- 1.Roscoe, A.W.: Model-checking CSP, ch. 21. Prentice-Hall (1994)Google Scholar
- 4.Attiya, H., Welch, J.: Distributed Computing: Fundamentals, Simulations, and Advanced Topics, 2nd edn. The Oxford University Press (2004)Google Scholar
- 5.Baier, C., Katoen, J.: Principles of Model Checking. The MIT Press (2008)Google Scholar
- 9.Ellen, F., Lev, Y., Luchangco, V., Moir, M.: SNZI: Scalable nonzero indicators. In: PODC, pp. 13–22. ACM (2007)Google Scholar
- 11.Hoare, C.: Communicating Sequential Processes. Prentice-Hall (1985)Google Scholar
- 15.Treiber, R.K.: Systems programming: Coping with parallelism. Technical report, IBM Almaden Research Center (1986)Google Scholar