References

  1. C.S. Althoff, W. Thomas & N. Wallmeier (2005): Observations on determinization of Büchi automata. In: ICALP, doi:10.1016/j.tcs.2006.07.026.
  2. R. Alur, T. A. Henzinger & O. Kupferman (2002): Alternating-time temporal logic. J. ACM, doi:10.1145/585265.585270.
  3. J.R. Büchi (1962): On a decision method in restricted second order arithmetic. In: ICLMPS.
  4. C. Courcoubetis & M. Yannakakis (1995): The complexity of probabilistic verification. J. ACM, doi:10.1145/210332.210339.
  5. L. Doyen & J.-F. Raskin (2007): Improved algorithms for the automata-based approach to model-checking. In: TACAS, doi:10.1007/978-3-540-71209-1_34.
  6. S. Fogarty, O. Kupferman, M.Y. Vardi & Th. Wilke (2011): Unifying Büchicomplementation constructions. In: CSL, doi:10.4230/LIPIcs.CSL.2011.248.
  7. S. Fogarty & M.Y. Vardi (2010): Efficient Büchi universality checking. In: TACAS, doi:10.1007/978-3-642-12002-2_17.
  8. E. Friedgut, O. Kupferman & M.Y. Vardi (2006): Büchi complementation made tighter. IJFCS, doi:10.1142/S0129054106004145.
  9. D. Kähler & Th. Wilke (2008): Complementation, disambiguation, and determinization of Büchi automata unified. In: ICALP, doi:10.1007/978-3-540-70575-8_59.
  10. J. Kretínský & J. Esparza (2012): Deterministic automata for the (F, G)-fragment of LTL. In: CAV, doi:10.1007/978-3-642-31424-7_7.
  11. O. Kupferman & M.Y. Vardi (2001): Weak alternating automata are not that weak. TOCL, doi:10.1145/377978.377993.
  12. O. Kupferman & M.Y. Vardi (2005): Safraless decision procedures. In: FOCS, doi:10.1109/SFCS.2005.66.
  13. L.H. Landweber (1969): Decision problems for ω–automata. MST, doi:10.1007/BF01691063.
  14. C. Löding (1999): Optimal bounds for the transformation of omega-automata. In: FSTTCS, doi:10.1007/3-540-46691-6_8.
  15. R. McNaughton (1966): Testing and generating infinite sequences by a finite automaton. ICONT, doi:10.1016/S0019-9958(66)80013-X.
  16. D.E. Muller & P.E. Schupp (1995): Simulating alternating tree automata by nondeterministic automata: new results and new proofs of theorems of Rabin, McNaughton and Safra. TCS, doi:10.1016/0304-3975(94)00214-4.
  17. N. Piterman (2006): From nondeterministic Büchi and Streett automata to deterministic parity automata. In: LICS, doi:10.2168/LMCS-3(3:5)2007.
  18. A. Pnueli & R. Rosner (1989): On the synthesis of a reactive module. In: POPL, doi:10.1145/75277.75293.
  19. M.O. Rabin & D. Scott (1959): Finite automata and their decision problems. IBM JRD, doi:10.1147/rd.32.0114.
  20. S. Safra (1988): On the complexity of ω-automata. In: FOCS, doi:10.1109/SFCS.1988.21948.
  21. S. Schewe (2009): Büchi complementation made tight. In: STACS, doi:10.4230/LIPIcs.STACS.2009.1854.
  22. S. Schewe (2009): Tighter bounds for the determinisation of Büchi automata. In: FOSSACS, doi:10.1007/978-3-642-00596-1_13.
  23. S. Tasiran, R. Hojati & R.K. Brayton (1995): Language containment of non-deterministic omega-automata. In: CHARME, doi:10.1007/3-540-60385-9_16.
  24. M.-H. Tsai, S. Fogarty, M. Y. Vardi & Y.-K. Tsay (2010): State of Büchi complementation. In: CIAA, doi:10.1007/978-3-642-18098-9_28.
  25. M.Y. Vardi (1985): Automatic verification of probabilistic concurrent finite-state programs. In: FOCS, doi:10.1109/SFCS.1985.12.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org