Safraless decision procedures

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn 2005, Issue , 2005, Pages 531-540

  Kupferman, Orna ^a   Vardi, Moshe Y ^b,c  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b RICE UNIVERSITY   (United States)

^c Rice University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PARITY TREE AUTOMATA; SYMBOLIC IMPLEMENTATION; TREE MODELS;

AUTOMATA THEORY; COMPUTATIONAL METHODS; COMPUTER SCIENCE; FORMAL LOGIC; INFORMATION SCIENCE; MATHEMATICAL MODELS;

DECISION THEORY;

EID: 33748585198     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.2005.66     Document Type: Conference Paper

References (51)

1. J. Büchi. Weak second-order arithmetic and fi nite automata. Zeit. Math. Logik und Grundl. Math., 6:66-92, 1960.
2. J. Büchi. On a decision method in restricted second order arithmetic. In Proc. Internat. Congr. Logic, Method, and Philos. Sci. 1960, pages 1-12, Stanford, 1962.
3. D. Bustan, O. Kupferman, and M. Vardi. A measured collapse of the modal μ-calculus alternation hierarchy. In Proc. 21st STACS, LNCS 2996, pages 522-533, 2004.
4. Y. Choueka. Theories of automata on ω-tapes: A simplifi ed approach. JCSS, 8:117-141, 1974.
5. J. Elgaard, N. Klarlund, and A. Möller. Mona 1.x: new techniques for WS1S and WS2S. In Proc. 10th CAV, LNCS 1427, pages 516-520, 1998.
6. C. Elgot. Decision problems of fi nite-automata design and related arithmetics. Trans. Amer. Math. Soc., 98:21-51, 1961.
7. E. Emerson. Automata, tableaux, and temporal logics. In Proc. WLOP, LNCS 193, pages 79-87, 1985.
8. E. Emerson and C. Jutla. The complexity of tree automata and logics of programs. In 29th FOCS, pages 328-337, 1988.
9. E. Emerson and C. Jutla. Tree automata, μ-calculus and determinacy. In Proc. 32nd FOCS, pages 368-377, 1991.
10. B. Finkbeiner. Symbolic refi nement checking with nondeterministic BDDs. In Proc. 7th TACAS, LNCS 2031, 2001.
11. E. Friedgut, O. Kupferman, and M. Vardi. Büchi complementation made tighter. In Proc. 2nd ATVA, LNCS 3299, pages 64-78, 2004.
12. C. Fritz. Constructing Büchi automata from linear temporal logic using simulation relations for alternating bchi automata. In Proc. 8th Intl. Conference on Implementation and Application of Automata, LNCS 2759, pages 35-48, 2003.
13. C. Fritz and T. Wilke. State space reductions for alternating Büchi automata: Quotienting by simulation equivalences. In Proc. 22th FST&TCS, LNCS 2556, pages 157-169, 2002.
14. D. Gabbay. Applications of trees to intermediate logics i. J. Symbolic Logic, 37:135-138, 1972.
15. G. D. Giacomo and M. Lenzerini. Concept languages with number restrictions and fi xpoints, and its relationship with μ-calculus. In Proc. 11th ECAI-94, pages 411-415. John Wiley and Sons, 1994.
16. S. Gurumurthy, O. Kupferman, F. Somenzi, and M. Vardi. On complementing nondeterministic Büchi automata. In 12th CHARME, LNCS 2860, pages 96-110, 2003.
17. A. Harding, M. Ryan, and P. Schobbens. A new algorithm for strategy synthesis in 111 games. In Proc. 11th TACAS, LNCS 3440, pages 477-492, 2005.
18. M. Jurdzinski. Small progress measures for solving parity games. In 17th STACS, LNCS 1770, pages 290-301, 2000.
19. D. Kozen. Results on the prepositional/μ-calculus. Theoretical Computer Science, 27:333-354, 1983.
20. D. Kozen and R. Parikh. A decision procedure for the propositional μ-calculus. In Logics of Programs, LNCS 164, pages 313-325, 1984.
21. O. Kupferman and M. Vardi. Weak alternating automata and tree automata emptiness. In Proc. 30th STOC, pages 224-233, 1998.
22. O. Kupferman, M. Vardi, and P. Wolper. An automatatheoretic approach to branching-time model checking. Journal of the ACM, 47(2):312-360, March 2000.
23. O. Kupferman and M. Vardi. Weak alternating automata are not that weak. ACM TOCL, 2(3):408-429, 2001.
24. O. Kupferman and M. Vardi. Complementation constructions for nondeterministic automata on infi nite words. In Proc. 11th TACAS, LNCS 3440, pages 206-221, 2005.
25. S. Merz. Weak alternating automata in Isabelle/HOL. In Proc. 13th TPHOL, LNCS 1869, pages 423-440, 2000.
26. A. R. Meyer. Weak monadic second order theory of successor is not elementary recursive. In Proc. Logic Colloquium, LNM 453, pages 132-154, 1975.
27. S. Miyano and T. Hayashi. Alternating finite automata on ω-words. Theoretical Computer Science, 32:321-330, 1984.
28. A. Mostowski. Regular expressions for infi nite trees and a standard form of automata. In Computation Theory, LNCS 208, pages 157-168, 1984.
29. D. Muller, A. Saoudi, and P. Schupp. Alternating automata, the weak monadic theory of the tree and its complexity. In Proc. 13th ICALP, LNCS 226, 1986.
30. D. Muller, A. Saoudi, and P. E. Schupp. Weak alternating automata give a simple explanation of why most temporal and dynamic logics are decidable in exponential time. In Proc. 3rd LICS, pages 422-427, Edinburgh, July 1988.
31. D. Muller and P. Schupp. Alternating automata on infi nite trees. In Automata on Infi nite Words, LNCS 192, pages 100-107, 1985.
32. D. Muller and P. Schupp. Simulating alternating tree automata by nondeterministic automata: New results and new proofs of theorems of Rabin, McNaughton and Safra. TCS, 141:69-107, 1995.
33. A. Pnueli and R. Rosner. On the synthesis of a reactive module. In Proc. 16th POPL, pages 179-190, 1989.
34. M. Rabin. Decidability of second order theories and automata on infi nite trees. Trans. of the AMS, 141:1-35, 1969.
35. M. Rabin. Weakly defi nable relations and special automata. In Proc. Symp. Math. Logic and Foundations of Set Theory, pages 1-23. North Holland, 1970.
36. R. Rosner. Modular Synthesis of Reactive Systems. PhD thesis, Weizmann Institute of Science, Rehovot, Israel, 1992.
37. S. Safra. On the complexity of ω-automata. In Proc. 29th FOCS, pages 319-327, White Plains, October 1988.
38. R. Street and E. Emerson. An elementary decision procedure for the μ-calculus. In Proc. 11th ICALP, LNCS 172, pages 465-472, July 1984.
39. R. Streett. Propositional dynamic logic of looping and converse. Information and Control, 54:121-141, 1982.
40. R. Sebastiani and S. Tonetta. 'more deterministic" vs. Smaller" büchi automata for efficient ltl model checking. In 12th CHARME, LNCS 2860, pages 126-140, 2003.
41. S. Tasiran, R. Hojati, and R. Brayton. Language containment using non-deterministic omega-automata. In Proc. 8th CHARME, LNCS 987, pages 261-277, 1995.
42. W.Thomas. Complementation of Büchi automata revisited. Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa, pages 109-122, 1998.
43. J. Thatcher and J. Wright. Generalized fi nite automata theory with an application to a decision problem of second-order logic. Mathematical System Theory, 2:57-81, 1968.
44. B. Trakhtenbrot. Finite automata and monadic second order logic. Siberian Math. J, 3:101-131, 1962. Russian;
45. English translation in: AMS Transl. 59 (1966), 23-55.
46. I. Vardi. Computational Recreations in Mathematica. Addison-Wesley, Redwood City, CA, 1991.
47. M. Vardi. What makes modal logic so robustly decidable? In Descriptive Complexity and Finite Models, pages 149-183. American Mathematical Society, 1997.
48. M. Vardi. Reasoning about the past with two-way automata. In Proc. 25th ICALP, LNCS 1443, pages 628-641, 1998.
49. M. Vardi and P. Wolper. Automata-theoretic techniques for modal logics of programs. Journal of Computer and System Science, 32(2): 182-221, April 1986.
50. M. Vardi and P. Wolper. Reasoning about infi nite computations. I& C, 115(1):1-37, November 1994.
51. G. Wang, A. Mishchenko, R. Brayton, and A. Sangiovanni-Vincentelli. Synthesizing FSMs according to co-Büchi properties. Technical Report UC BErkeley, 2005.