Bu̧chi complementation made tighter

International Journal of Foundations of Computer Science

Volumn 17, Issue 4, 2006, Pages 851-867

  Friedgut, Ehud ^a   Kupferman, Orna ^a   Vardi, Moshe Y ^b  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b Rice University   (United States)

Author keywords

Complementation; Nondeterministic B chi Automata

Indexed keywords

EID: 33746927210     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054106004145     Document Type: Conference Paper

References (24)

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 ForSpec 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. 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.
5. 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.
6. S. Gurumurthy, R. Bloem, and P. Somenzi. Fair simulation minimization. In Computer Aided Verification, Proc. 14th International Conference, volume 2404 of Lecture Notes in Computer Science, pages 610-623. Springer-Verlag, 2002.
7. 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.
8. T.A. Henzinger, O. Kupferman, and S. Rajamani. Fair simulation. Information and Computation, 173(1):64-81, 2002.
9. 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.
10. 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.
11. N. Klarlund. Progress measures for complementation of ω-automata with applications to temporal logic. In Proc. 32nd IEEE Symp. on Foundations of Computer Science, pages 358-367, San Juan, October 1991.
12. O. Kupferman and M.Y. Vardi. Weak alternating automata are not that weak. ACM Trans. on Computational Logic, 2(2):408-429, July 2001.
13. R.P. Kurshan. Computer Aided Verification of Coordinating Processes. Princeton Univ. Press, 1994.
14. C. Löding and W. Thomas. Alternating automata and logics over infinite words. In Theoretical Compter Science - Exploring New Frontiers of Theoretical Informatics, volume 1872 of Lecture Notes in Computer Science, pages 521-535. Springer-Verlag, 2000.
15. M. Michel. Complementation is more difficult with automata on infinite words. CNET, Paris, 1988.
16. D.E. Muller and P.E. Schupp. Alternating automata on infinite trees. Theoretical Computer Science, 54:267-276, 1987.
17. M.O. Rabin and D. Scott. Finite automata and their decision problems. IBM Journal of Research and Development, 3:115-125, 1959.
18. S. Safra. On the complexity of ω-automata. In Proc. 29th IEEE Symp. on Foundations of Computer Science, pages 319-327, White Plains, October 1988.
19. 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.
20. 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.
21. 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.
22. N.M. Temme. Asimptotic estimates of Stirling numbers. Stud. Appl. Math., 89:233-243, 1993.
23. M.Y. Vardi and P. Wolper. Reasoning about infinite computations. Information and Computation, 115(1):1-37, November 1994.
24. P. Wolper. Temporal logic can be more expressive. Information and Control, 56(1-2):72-99, 1983.