Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2013 (2013), Article ID 462532, 12 pages
http://dx.doi.org/10.1155/2013/462532
Research Article

Bounded Model Checking of ETL Cooperating with Finite and Looping Automata Connectives

College of Computer Science, National University of Defense Technology, Changsha, Hunan 410073, China

Received 8 March 2013; Accepted 14 June 2013

Academic Editor: Xiaoyu Song

Copyright © 2013 Rui Wang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. R. E. Bryant, “Graph-based algorithms for Boolean function manipulation,” IEEE Transactions on Computers C, vol. 35, no. 8, pp. 677–691, 1986. View at Google Scholar · View at Scopus
  2. K. L. McMillan, Symbolic model checking, an approach to the state explosion problem [Ph.D. thesis], Carnegie Mellon University, Pittsburgh, Pa, USA; Kluwer Academic, Boston, Mass, USA, 1993.
  3. A. Biere, A. Cimatti, E. M. Clarke, and Y. Zhu, “Symbolic model checking without BDDs,” in Proceedings of the 5th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS '99), vol. 1579 of Lecture Notes in Computer Science, pp. 193–207, Springe, Berlin, Germany, 1999. View at Google Scholar
  4. P. Wolper, “Temporal logic can be more expressive,” Information and Control, vol. 56, no. 1-2, pp. 72–99, 1983. View at Publisher · View at Google Scholar · View at MathSciNet
  5. A. Pnueli, “Linear and branching structures in the semantics and logics of reactive systems,” in International Colloquium on Automata, Language and Programming, W. Brauer, Ed., vol. 194 of Lecture Notes in Computer Science, pp. 15–32, Springer, Berlin, Germany, 1985. View at Publisher · View at Google Scholar · View at MathSciNet
  6. O. Lichtenstein, A. Pnueli, and L. Zuck, “The glory of the past,” in Proceedings of the Workshop on Logics of Programs, vol. 193 of Lecture Notes in Computer Science, pp. 97–107, Springer, Brooklyn, NY, USA, 1985.
  7. Accellera, “Accellera property languages reference manual,” June 2004, http://www.eda.org/vfv/docs/PSL-v1.1.pdf.
  8. B. Banieqbal and H. Barringer, “Temporal logic with fixed points,” in Temporal Logic in Specification, vol. 398 of Lecture Notes in Computer Science, pp. 62–74, Springer, Berlin, Germany, 1987. View at Google Scholar · View at MathSciNet
  9. A. P. Sistla, M. Y. Vardi, and P. Wolper, “The complementation problem for Büchi automata with applications to temporal logic,” Theoretical Computer Science, vol. 49, no. 2-3, pp. 217–237, 1987. View at Publisher · View at Google Scholar · View at MathSciNet
  10. M. Leucker and C. Sanchez, “Regular linear temporal logic,” in Proceedings of the 4th International Conference on Theoretical Aspects of Computing, vol. 4711 of Lecture Notes in Computer Science, pp. 291–305, Springer, Berlin, Germany, 2007. View at Google Scholar
  11. R. Armoni, L. Fix, A. Flaisher et al., “The ForSpec temporal logic: a new temporal property-specification language,” in Proceedings of the International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS '02), vol. 2280 of Lecture Notes in Computer Science, pp. 296–311, Springer, Berlin, Germany, 2002. View at Google Scholar
  12. I. Beer, S. Ben-David, C. Eisner, D. Fisman, A. Gringauze, and Y. Rodeh, “The temporal logic sugar,” in Proceedings of the 13th International Conference on Computer Aided Verification, G. Berry, H. Comon, and A. Frinkel, Eds., vol. 2102 of Lecture Notes in Computer Science, pp. 363–367, Springer, London, UK, 2001. View at Google Scholar
  13. M. Y. Vardi and P. Wolper, “Reasoning about infinite computations,” Information and Computation, vol. 115, no. 1, pp. 1–37, 1994. View at Publisher · View at Google Scholar · View at MathSciNet
  14. J. R. Büchi, “On a decision method in restricted second order arithmetic,” in Proceedings of the International Congresses in Logic, Methodology and Philosophy of Science 1960, pp. 1–12, Stanford University Press, Palo Alto, Calif, USA, 1962.
  15. W. Liu, J. Wang, and Z. Wang, “Symbolic model checking of ETL,” Journal of Software, vol. 20, no. 8, pp. 2015–2025, 2009. View at Publisher · View at Google Scholar · View at MathSciNet
  16. W. Liu, J. Wang, H. Chen, X. Ma, and Z. Wang, “Symbolic model checking APSL,” Frontiers of Computer Science in China, vol. 3, no. 1, pp. 130–141, 2009. View at Publisher · View at Google Scholar · View at Scopus
  17. M. Jehle, J. Johannsen, M. Lange, and N. Rachinsky, “Bounded model checking for all regular properties,” Electronic Notes in Theoretical Computer Science, vol. 144, no. 1, pp. 3–18, 2006. View at Publisher · View at Google Scholar · View at Scopus
  18. A. Pnueli and A. Zaks, “PSL model checking and run-time verification via testers,” Formal Methods, Springer, Berlin, Germany, vol. 4085, pp. 573–586, 2006. View at Google Scholar · View at Scopus
  19. A. Cimatti, M. Roveri, S. Semprini, and S. Tonetta, “From PSL to NBA: a modular symbolic encoding,” in Formal Methods in Computer Aided Design (FMCAD '06), Lecture Notes in Computer Science, pp. 125–133, Springer, 2006. View at Publisher · View at Google Scholar · View at Scopus
  20. E. M. Clarke, O. Grumberg, and K. Hamaguchi, “Another look at LTL model checking,” in Computer Aided Verification, 6th International Conference (CAV '94), vol. 818 of Lecture Notes in Computer Science, pp. 415–427, Springer, Berlin, Germany, 1994. View at Google Scholar
  21. A. Biere, K. Heljanko, T. Junttila, T. Latvala, and V. Schuppan, “Linear encodings of bounded LTL model checking,” Logical Methods in Computer Science, vol. 2, no. 5, article 5, 2006. View at Publisher · View at Google Scholar · View at MathSciNet
  22. E. Clarke, D. Kroening, J. Ouaknine, and O. Strichman, “Completeness and complexity of bounded model checking,” in Verification, Model Checking, and Abstract Interpretation (VMCAI '04), vol. 2937 of Lecutre Notes in Computer Science, pp. 85–96, Springer, Berlin, Germany, 2004. View at Publisher · View at Google Scholar · View at MathSciNet
  23. T. Latvala, A. Biere, K. Heljanko, and T. Junttila, “Simple bounded LTL model checking,” in Formal Methods in Computer-Aided Design (FMCAD '04), A. Hu and A. Martin, Eds., vol. 3312 of Lecture Notes in Computer Science, pp. 186–200, Springer, Berlin, Germany, 2004. View at Google Scholar
  24. T. Latvala, A. Biere, K. Heljanko, and T. Junttila, “Simple is better: efficient bounded model checking for past LTL,” in Verification, Model Checking, and Abstract Interpretation (VMCAI '05), vol. 3385 of Lecture Notes in Computer Science, pp. 380–395, Springer, Berlin, Germany, 2005. View at Publisher · View at Google Scholar · View at MathSciNet
  25. R. Cavada, A. Cimatti, C. A. Jochim et al., “NuSMV 2. 5 user manual,” April 2010, http://nusmv.fbk.eu/NuSMV/userman/v25/nusmv.pdf.
  26. K. Heljanko, T. Junttila, and T. Latvala, “Incremental and complete bounded model checking for full PLTL,” in Proceedings of the 17th International Conference of Computer Aided Verification (CAV '05), K. Etessami and S. K. Rajamani, Eds., vol. 3576 of Lecture Notes in Computer Science, pp. 98–111, Springer, Berlin, Germany, 2005. View at Google Scholar · View at MathSciNet
  27. Q. Yan, “Lower bounds for complementation of ω-automata via the full automata technique,” Journal of Logical Methods in Computer Science, vol. 4, no. 1, article 5, 2008. View at Publisher · View at Google Scholar · View at MathSciNet
  28. O. Kupferman and M. Y. Vardi, “Weak alternating automata are not that weak,” ACM Transactions on Computational Logic, vol. 2, no. 3, pp. 408–429, 2001. View at Publisher · View at Google Scholar · View at MathSciNet
  29. E. Friedgut, O. Kupferman, and M. Y. Vardi, “Büchi complementation made tighter,” in Automated Technology for Verification and Analysis (ATVA '06), vol. 3299 of Lecture Notes in Computer Science, pp. 64–78, Springer, Berlin, Germany, 2004. View at Google Scholar
  30. S. Schewe, “Büchi complementation made tight,” in STACS 2009: 26th International Symposium on Theoretical Aspects of Computer Science, vol. 3, pp. 661–672, IBFI, 2009. View at Google Scholar · View at MathSciNet