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

Degeneralization Algorithm for Generation of Büchi Automata Based on Contented Situation

1School of Software, Tsinghua University, Beijing 100084, China
2Credit Reference Center, People’s Bank of China, Beijing 100800, China
3Department of Mathematical Sciences, Tsinghua University, Beijing 100084, China

Received 7 September 2014; Revised 15 December 2014; Accepted 16 December 2014

Academic Editor: Carlos Conca

Copyright © 2015 Laixiang Shan 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. E. M. Clarke, O. Grumberg, and D. A. Peled, Model Checking, MIT Press, 1999.
  2. T. Babiak, M. Ketnsk, V. ehk et al., “LTL to Büchi automata translation: fast and more deterministic,” in Tools and Algorithms for the Construction and Analysis of Systems, vol. 7214, pp. 95–109, Springer, Berlin, Germany, 2012. View at Google Scholar
  3. P. Gastin and D. Oddoux, “Fast LTL to Büchi automata translation,” in Computer Aided Verification, G. Berry, H. Comon, and A. Finkel, Eds., vol. 2102 of Lecture Notes in Computer Science, pp. 53–65, Springer, 2001. View at Publisher · View at Google Scholar
  4. U. Boker, O. Kupferman, and A. Rosenberg, “Alternation removal in buchi automata,” in Automata, Languages and Programming, pp. 76–87, Springer, 2010. View at Google Scholar
  5. A. Duret-Lutz, “Ltl translation improvements in spot,” in Proceedings of the 5th International Conference on Verification and Evaluation of Computer and Communication Systems (VECoS '11), pp. 72–83, British Computer Society, 2011.
  6. J. M. Couvreur, “On-the-fly verification of linear temporal logic,” in FM99, Formal Methods, vol. 1708 of Lecture Notes in Computer Science, pp. 253–271, Springer, Berlin, Germany, 1999. View at Publisher · View at Google Scholar
  7. R. Gerth, D. Peled, M. Y. Vardi, and P. Wolper, “Simple on-the-fly automatic verification of linear temporal logic,” in Proceedings of the 15th IFIP WG6 International Symposium on Protocol Specification, Testing and Verification (IFIP '95), 1995.
  8. G. J. Holzmann, “The model checker SPIN,” IEEE Transactions on Software Engineering, vol. 23, no. 5, pp. 279–295, 1997. View at Publisher · View at Google Scholar · View at Scopus
  9. D. Giannakopoulou and F. Lerda, “From states to transitions: improving translation of LTL formulae to Büchi automata,” in Formal Techniques for Networked and Distributed Sytems—FORTE 2002, vol. 2529 of Lecture Notes in Computer Science, pp. 308–326, Springer, Berlin, Germany, 2002. View at Publisher · View at Google Scholar
  10. T. Babiak, T. Badie, A. Duret-Lutz et al., “Compositional approach to suspension and other improvements to LTL translation,” in Model Checking Software, pp. 81–98, Springer, Berlin, Germany, 2013. View at Google Scholar
  11. K. Chatterjee, A. Gaiser, and J. Ketnsk, “Automata with generalized Rabin pairs for probabilistic model checking and LTL synthesis,” in Computer Aided Verification, pp. 559–575, Springer, Berlin, Germany, 2013. View at Google Scholar
  12. E. Renault, A. Duret-Lutz, F. Kordon, and D. Poitrenaud, “Three SCC-based emptiness checks for generalized Büchi automata,” in Logic for Programming, Artificial Intelligence, and Reasoning, vol. 8312 of Lecture Notes in Computer Science, pp. 668–682, Springer, Berlin, Germany, 2013. View at Publisher · View at Google Scholar
  13. A. Duret-Lutz and D. Poitrenaud, “SPOT: an extensible model checking library using transition-based generalized Büchi automata,” in Proceedingsof the IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, 2004. (MASCOTS '04), pp. 76–83, IEEE, 2004.
  14. R. E. Bryant, “Graph-based algorithms for boolean funct ion manipulation,” IEEE Transactions on Computers, vol. C-35, no. 8, pp. 677–691, 1986. View at Publisher · View at Google Scholar · View at Scopus
  15. H. Tauriainen and K. Heljanko, “Testing LTL formula translation into Büchi automata,” International Journal on Software Tools for Technology Transfer, vol. 4, no. 1, pp. 57–70, 2002. View at Publisher · View at Google Scholar · View at Scopus