The Büchi complementation saga

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4393 LNCS, Issue , 2007, Pages 12-22

  Vardi, Moshe Y ^a  

^a Rice University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LANGUAGES; PROBLEM SOLVING; VERIFICATION;

FORMAL VERIFICATION; LIVENESS PROPERTIES;

FINITE AUTOMATA;

EID: 38049162142     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70918-3_2     Document Type: Conference Paper

References (39)

1. R. Armoni, L. Fix, A. Flaisher, R. Gerth, B. Ginsburg, T. Kanza, A. Landver, S. Mador-Haim, E. Singerman, A. Tiemeyer, M.Y. Vardi, and Y. Zbar. The For-Spec temporal logic: A new temporal property-specification logic. In Proc. 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, volume 2280 of Lecture Notes in Computer Science, pages 296-211, Grenoble, France, April 2002. Springer-Verlag.
2. J.C. Birget. Partial orders on words, minimal elements of regular languages, and state complexity. Theoretical Computer Science, 119:267-291, 1993.
3. J.R. Büchi. On a decision method in restricted second order arithmetic. In Proc. International Congress on Logic, Method, and Philosophy of Science. 1960, pages 1-12, Stanford, 1962. Stanford University Press.
4. 20 states and beyond. Information and Computation, 98(2): 142-170, June 1992.
5. N. Daniele, F. Guinchiglia, and M.Y. Vardi. Improved automata generation for linear temporal logic. In Computer Aided Verification, Proc. 11th International Conference, volume 1633 of Lecture Notes in Computer Science, pages 249-260. Springer-Verlag, 1999.
6. E.A. Emerson and E.M. Clarke. Characterizing correctness properties of parallel programs using fixpoints. In Proc. 7th InternationalColloq. on Automata, Languages and Programming, pages 169-181, 1980.
7. E.A. Emerson and C-L. Lei. Temporal model checking under generalized fairness constraints. In Proc. 18th Hawaii International Conference on System Sciences, North Holywood, 1985. Western Periodicals Company.
8. K. Fisler, R. Fraer, G. Kamhi, M.Y. Vardi, and Z. Yang. Is there a best symbolic cycle-detection algorithm? In 7th International Conference on Tools and algorithms for the construction and analysis of systems, number 2031 in Lecture Notes in Computer Science, pages 420-434. Springer-Verlag, 2001.
9. E. Friedgut, O. Kupferman, and M.Y. Vardi. Büchi complementation made tighter. Int'l J. of Foundations of Computer Science, 17(4):851-867, 2006.
10. P. Gastin and D. Oddoux. Fast LTL to büchi automata translation. In Computer Aided Verification, Proc. 13th International Conference, volume 2102 of Lecture Notes in Computer Science, pages 53-65. Springer-Verlag, 2001.
11. S. Gurumurthy, R. Bloem, and F. Somenzi. Fair simulation minimization. In Computer Aided Verification, Proc. 14-th International Conference, volume 2404 of Lecture Notes in Computer Science, pages 610-623. Springer-Verlag, 2002.
12. S. Gurumurthy, O. Kupferman, F. Somenzi, and M.Y. Vardi. On complementing nondeterministic Büchi automata. In 12th Advanced Research Working Conference on Correct Hardware Design and Verification Methods, volume 2860 of Lecture Notes in Computer Science, pages 96-110. Springer-Verlag, 2003.
13. T.A. Henzinger, O. Kupferman, and S. Rajamani. Fair simulation. Information and Computation, 173(1):64-81, 2002.
14. G.J. Holzmann. The model checker SPIN. IEEE Trans. on Software Engineering, 23(5):279-295, May 1997. Special issue on Formal Methods in Software Practice.
15. Y. Kesten, N. Piterman, and A. Pnueli. Bridging the gap between fair simulation and trace containment. In Computer Aided Verification, Proc. 15th International Conference, volume 2725 of Lecture Notes in Computer Science, pages 381-393. Springer-Verlag, 2003.
16. N. Klarlund. Progress measures for complementation of w-automata with applications to temporal logic. In Proc. 32nd IEEE Symp. on Foundations of Computer Science, pages 358-367, San Juan, October 1991.
17. O. Kupferman and M.Y. Vardi. Weak alternating automata are not that weak. In Proc. 5th Israeli Symp. on Theory of Computing and Systems, pages 147-158. IEEE Computer Society Press, 1997.
18. O. Kupferman and M.Y. Vardi. Weak alternating automata are not that weak. ACM Trans. on Computational Logic, 2(2):408-429, July 2001.
19. O. Kupferman and M.Y. Vardi. Complementation constructions for nondeterministic automata on infinite words. In Proc. 11th International Conf. on Tools and Algorithms for The Construction and Analysis of Systems, volume 3440 of Lecture Notes in Computer Science, pages 206-221. Springer-Verlag, 2005.
20. O. Kupferman and M.Y. Vardi. From complementation to certification. Theoretical Computer Science, 305:591-606, 2005.
21. R.P. Kurshan. Computer Aided Verification of Coordinating Processes. Princeton Univ. Press, 1994.
22. C. Löding. Optimal bounds for the transformation of omega-automata. In Proc. 19th Conference on the Foundations of Software Technology and Theoretical Computer Science, volume 1738 of Lecture Notes in Computer Science, pages 97-109, December 1999.
23. M. Michel. Complementation is more difficult with automata on infinite words. CNET, Paris, 1988.
24. S. Miyano and T. Hayashi. Alternating finite automata on ω-words. Theoretical Computer Science, 32:321-330, 1984.
25. D.E. Muller. Infinite sequences and finite machines. In Proc. 4th IEEE Symp. on Switching Circuit Theory and Logical design, pages 3-16, 1963.
26. D.E. Muller and P.E. Schupp. Alternating automata on infinite trees. Theoretical Computer Science, 54:267-276, 1987.
27. J.P. Pécuchet. On the complementation of büchi automata. Theor. Comput. Sci., 47(3):95-98, 1986.
28. M.O. Rabin and D. Scott. Finite automata and their decision problems. IBM Journal of Research and Development, 3:115-125, 1959.
29. S. Safra. On the complexity of ω-automata. In Proc. 29th IEEE Symp. on Foundations of Computer Science, pages 319-327, White Plains, October 1988.
30. S. Safra. Exponential determinization for ω-automata with strong-fairness acceptance condition. In Proc. 24th ACM Symp. on Theory of Computing, Victoria, May 1992.
31. W. Sakoda and M. Sipser. Non-determinism and the size of two-way automata. In Proc. 10th ACM Symp. on Theory of Computing, pages 275-286, 1978.
32. A.P. Sistla, M.Y. Vardi, and P. Wolper. The complementation problem for Büchi automata with applications to temporal logic. Theoretical Computer Science, 49:217-237, 1987.
33. F. Somenzi and R. Bloem. Efficient Büchi automata from LTL formulae. In Computer Aided Verification, Proc. 12th International Conference, volume 1855 of Lecture Notes in Computer Science, pages 248-263. Springer-Verlag, 2000.
34. N.M. Temme. Asimptotic estimates of Stirling numbers. Stud. Appl. Math., 89:233-243, 1993.
35. W. Thomas. Complementation of Büchi automata revised. In J. Karhumäki, H. A. Maurer, G. Paun, and G. Rozenberg, editors, Jewels are Forever, pages 109-120. Springer, 1999.
36. M.Y. Vardi. Verification of concurrent programs - the automata-theoretic framework. Annals of Pure and Applied Logic, 51:79-98, 1991.
37. M.Y. Vardi and P. Wolper. Reasoning about infinite computations. Information and Computation, 115(1):1-37, November 1994.
38. P. Wolper. Temporal logic can be more expressive. Information and Control, 56(1-2):72-99, 1983.
39. Q. Yan. Lower bounds for complementation of ω-automata via the full automata technique. In Proc. 33rd Intl. Colloq. on Automata, Languages and Pr ogramming, volume 4052 of Lecture Notes in Computer Science, pages 589-600. Springer-Verlag, 2006.