More Anti-chain Based Refinement Checking

  • Ting Wang
  • Songzheng Song
  • Jun Sun
  • Yang Liu
  • Jin Song Dong
  • Xinyu Wang
  • Shanping Li
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7635)


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.


Model Check Label Transition System Check Algorithm Tree Automaton Synchronous Product 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Roscoe, A.W.: Model-checking CSP, ch. 21. Prentice-Hall (1994)Google Scholar
  2. 2.
    Abdulla, P.A., Chen, Y.-F., Holík, L., Mayr, R., Vojnar, T.: When Simulation Meets Antichains. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol. 6015, pp. 158–174. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  3. 3.
    Aguilera, M.K., Gafni, E., Lamport, L.: The Mailbox Problem. In: Taubenfeld, G. (ed.) DISC 2008. LNCS, vol. 5218, pp. 1–15. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  4. 4.
    Attiya, H., Welch, J.: Distributed Computing: Fundamentals, Simulations, and Advanced Topics, 2nd edn. The Oxford University Press (2004)Google Scholar
  5. 5.
    Baier, C., Katoen, J.: Principles of Model Checking. The MIT Press (2008)Google Scholar
  6. 6.
    Bouajjani, A., Habermehl, P., Holík, L., Touili, T., Vojnar, T.: Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata. In: Ibarra, O.H., Ravikumar, B. (eds.) CIAA 2008. LNCS, vol. 5148, pp. 57–67. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  7. 7.
    Chatterjee, K., Doyen, L., Henzinger, T.A., Raskin, J.-F.: Algorithms for Omega-Regular Games with Imperfect Information. In: Ésik, Z. (ed.) CSL 2006. LNCS, vol. 4207, pp. 287–302. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  8. 8.
    Doyen, L., Raskin, J.F.: Antichains for the automata-based approach to model checking. Logical Methods in Computer Science 5(1:5), 1–20 (2009)MathSciNetGoogle Scholar
  9. 9.
    Ellen, F., Lev, Y., Luchangco, V., Moir, M.: SNZI: Scalable nonzero indicators. In: PODC, pp. 13–22. ACM (2007)Google Scholar
  10. 10.
    Filiot, E., Jin, N., Raskin, J.-F.: An Antichain Algorithm for LTL Realizability. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 263–277. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  11. 11.
    Hoare, C.: Communicating Sequential Processes. Prentice-Hall (1985)Google Scholar
  12. 12.
    Roscoe, A.W.: On the expressive power of CSP refinement. Formal Aspects of Computing 17(2), 93–112 (2005)zbMATHCrossRefGoogle Scholar
  13. 13.
    Sun, J., Liu, Y., Dong, J.S., Pang, J.: PAT: Towards Flexible Verification under Fairness. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 709–714. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  14. 14.
    Sun, J., Song, S., Liu, Y.: Model Checking Hierarchical Probabilistic Systems. In: Dong, J.S., Zhu, H. (eds.) ICFEM 2010. LNCS, vol. 6447, pp. 388–403. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  15. 15.
    Treiber, R.K.: Systems programming: Coping with parallelism. Technical report, IBM Almaden Research Center (1986)Google Scholar
  16. 16.
    De Wulf, M., Doyen, L., Henzinger, T.A., Raskin, J.-F.: Antichains: A New Algorithm for Checking Universality of Finite Automata. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 17–30. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  17. 17.
    De Wulf, M., Doyen, L., Maquet, N., Raskin, J.-F.: Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 63–77. Springer, Heidelberg (2008)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Ting Wang
    • 1
  • Songzheng Song
    • 2
  • Jun Sun
    • 3
  • Yang Liu
    • 2
  • Jin Song Dong
    • 2
  • Xinyu Wang
    • 1
  • Shanping Li
    • 1
  1. 1.College of Computer Science and TechnologyZhejiang UniversityChina
  2. 2.National University of SingaporeSingapore
  3. 3.Singapore University of Technology and DesignSingapore

Personalised recommendations