Complementation constructions for nondeterministic automata on infinite words

Lecture Notes in Computer Science

Volumn 3440, Issue , 2005, Pages 206-221

  Kupferman, Orna ^a   Vardi, Moshe Y ^b  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b Rice University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; COMPUTER SOFTWARE; OPTIMIZATION; PROBLEM SOLVING; SYSTEMS ANALYSIS;

COMPLEMENTATION CONSTRUCTIONS; NONDETERMINISTIC AUTOMATA; VERIFICATION PROBLEMS;

AUTOMATA THEORY;

EID: 24644516273     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31980-1_14     Document Type: Conference Paper

References (36)

1. [AL91] M. Abadi and L. Lamport. The existence of refinement mappings. TCS, 82(2):253-284, 1991.
2. [Att99] P. Attie. Liveness-preserving simulation relations. In Proc. 18th PODC, pages 63-72, 1999.
3. [Buc62] J.R. 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.
4. [Cho74] Y. Choueka. Theories of automata on ω-tapes: A simplified approach. Journal of CSS, 8:117-141, 1974.
5. [DHW91] D.L. Dill, A.J. Hu, and H. Wong-Toi. Checking for language inclusion using simulation relations. In Proc. 3rd CAV, LNCS 575, pages 255-265, 1991
6. [EJ91] E.A. Emerson and C. Jutla. Tree automata, μ-calculus and determinacy. In Proc. 32nd FOCS pages 368-377, 1991.
7. [EKM98] 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.
8. [FKV04] E. Friedgut, O. Kupferman, and M.Y. Vardi. Büchi complementation made tighter. In Proc. 2nd ATVA, LNCS 3299, pages 64-78, 2004.
9. [GBS02] S. Gurumurthy, R. Bloem, and F. Somenzi. Fair simulation minimization. In Proc. 14th CAV, LNCS 2404, pages 610-623, 2002.
10. [GKSV03] S. Gurumurthy, O. Kupferman, F Somenzi, and M.Y. Vardi. On complementing nondeterministic Büchi automata. In Proc. 12th CHARME, LNCS 2860, pages 96-110, 2003.
11. [HHK95] M.R. Henzinger, T.A. Henzinger, and P.W. Kopke. Computing simulations on finite and infinite graphs. In Proc. 36th FOCS, pages 453-462, 1995.
12. [HHK96] R.H. Hardin, Z. Har'el, and R.P. Kurshan. COSPAN. In Proc. 8th CAV, LNCS 1102, pages 423-427, 1996.
13. [HK02] D. Harel and O. Kupferman. On the behavioral inheritance of state-based objects. IEEE TSE, 28(9):889-903, 2002.
14. [HKR02] T.A. Henzinger, O. Kupferman, and S. Rajamani. Fair simulation. I&C, 173(1):64-81, 2002.
15. [Hol97] G.J. Holzmann. The model checker SPIN. IEEE TSE, 23(5):279-295, May 1997.
16. [Kla90] N. Klarlund. Progress Measures and finite arguments for infinite computations. PhD thesis, Cornell University, 1990.
17. [Kla91] N. Klarlund. Progress measures for complementation of ω-automata with applications to temporal logic. In Proc. 32nd FOCS, pages 358-367, 1991.
18. [KP00] Y. Kesten and A. Pnueli. Verification by augmented finitary abstraction. I&C, 163(1):203-243, 2000.
19. [KPP03] Y. Kesten, N. Piterman, and A. Pnueli. Bridging the gap between fair simulation and trace containment. In Proc. 15th CAV, LNCS 2725, pages 381-393, 2003.
20. [KPSZ02] Y. Kesten, A. Pnueli, E. Shahar, and L. Zuck. Network invariant in action. In Proc. 13th CONCUR, LNCS 2421, pages 101-115, 2002.
21. [Kur87] R.P. Kurshan. Complementing deterministic Büchi automata in polynomial time. Journal of CSS, 35:59-71, 1987.
22. [Kur94] R.P. Kurshan. Computer Aided Verification of Coordinating Processes. Princeton Univ. Press, 1994.
23. [KV01] O. Kupferman and M.Y. Vardi. Weak alternating automata are not that weak. ACM ToCL, 2001(2):408-429, 2001.
24. [KV04] O. Kupferman and M.Y. Vardi. From complementation to certification. In 10th TACAS, LNCS 2988, pages 591-606, 2004.
25. [LPS81] D. Lehman, A. Pnueli, and J. Stavi. Impartiality, justice, and fairness - the ethics of concurrent termination. In Proc. 8th ICALP, LNCS 115, pages 264-277, 1981.
26. [LT87] N. A. Lynch and M.R. Tuttle. Hierarchical correctness proofs for distributed algorithms. In Proc. 6th PODC, pages 137-151, 1987.
27. [Mer00] S. Merz. Weak alternating automata in Isabelle/HOL. In Proc. 13th TPiHOL, LNCS 1869, pages 423-440, 2000.
28. [Mic88] M. Michel. Complementation is more difficult with automata on infinite words. CNET, Paris, 1988.
29. [MS73] A.R. Meyer and L.J. Stockmeyer. Word problems requiring exponential time: Preliminary report. In Proc. 5th STOC, pages 1-9, 1973.
30. [MS87] D.E. Muller and P.E. Schupp. Alternating automata on infinite trees. TCS, 54:267-276, 1987.
31. [RS59] M.O. Rabin and D. Scott. Finite automata and their decision problems. IBM Journal of Research and Development, 3:115-125, 1959.
32. [Saf88] S. Safra. On the complexity of ω-automata. In 29th FOCS, pages 319-327, 1988.
33. [Saf92] S. Safra. Exponential determinization for ω-automata with strong-fairness acceptance condition. In Proc. 24th STOC, 1992.
34. [SV89] S. Safra and M.Y. Vardi. On ω-automata and temporal logic. In Proc. 21st STOC, pages 127-137, 1989.
35. [THB95] S. Tasiran, R. Hojati, and R.K. Brayton. Language containment using non-deterministic ω-automata. In Proc. 8th CHARME, LNCS 987, pages 261-277, 1995.
36. [VW94] M.Y. Vardi and P. Wolper. Reasoning about infinite computations. I&C, 115(1):l-37, November 1994.