Avoiding determinization

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2006, Pages 243-252

  Kupferman, Orna ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

DETERMINIZATION; NONDETERMINISTIC AUTOMATA; SYSTEM SPECIFICATION;

MODEL CHECKING; OPTIMAL SYSTEMS; SPECIFICATIONS; STATE SPACE METHODS; SYSTEMS ANALYSIS;

AUTOMATA THEORY;

EID: 34547293275     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2006.15     Document Type: Conference Paper

References (54)

1. M. Abadi, L. Lamport, and P. Wolper. Realizable and unrealizable concurrent program specifications. In Proc. 16th ICALP, LNCS 372, pages 1-17, 1989.
2. C. Schulte Althoff, W Thomas, and N. Wallmeier. Observations on determinization of Büchi automata. In Proc. 10th ICIAA, LNCS 3845, pages 262-272, 2005.
3. 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 TACAS, LNCS 2280, pages 296-211, 2002.
4. 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.
5. A. Church. Logic, arithmetics, and automata. In Proc. International Congress of Mathematicians, 1962, pages 23-35. Institut Mittag-Leffler, 1963.
6. D.L. Dill. Trace theory for automatic hierarchical verification of speed independent circuits. MIT Press, 1989.
7. J. Elgaard, N. Klarlund, and A. Möller. Mona 1.x: new techniques for WSIS and WS2S. In Proc. 10th CAV, LNCS 1427, pages 516-520, 1998.
8. E. A. Emerson and C. Jutla. The complexity of tree automata and logics of programs. In Proc. 29th FOCS, pages 328-337, White Plains, October 1988.
9. E.A. Emerson and C. Jutla. Tree automata, μ-calculus and determinacy. In Proc. 32nd FOCS, pages 368-377, 1991.
10. E. Friedgut, O. Kupferman, and M.Y Vardi. Büchi complementation made tighter. In Proc. 2nd ATVA, LNCS 3299, pages 64-78, 2004.
11. 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.
12. G. De Giacomo and M. Lenzerini. Concept languages with number restrictions and fixpoints, and its relationship with μ-calculus. In Proc. 11th ECAI-94, pages 411-415, 1994.
13. 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.
14. TA. Henzinger and N. Piterman. Solving games without determinization, Submitted, 2006.
15. A. Harding, M. Ryan, and P. Schobbens. A new algorithm for strategy synthesis in ltl games. In Proc. 11th TACAS, LNCS 3440, pages 477-492, 2005.
16. G. Holzmann. Design and Validation of Computer Protocols. Prentice-Hall International Editions, 1991.
17. M. Jurdzinski. Small progress measures for solving parity games. In 17th STACS, LNCS 1770, pages 290-301, 2000.
18. N. Klarlund. Progress measures for complementation of ω-automata with applications to temporal logic. In Proc. 32nd FOCS, pages 358-367, 1991.
19. D. Kozen. Results on the propositional μ-calculus. Theoretical Computer Science, 27:333-354, 1983.
20. O. Kupferman, N. Piterman, and M.Y. Vardi. Safraless compositional synthesis. In Proc. 18th CAV, LNCS, 2006.
21. O. Kupferman and M.Y. Vardi. Weak alternating automata are not that weak. ACM TOCL, 2(2):408-429, July 2001.
22. O. Kupferman and M.Y. Vardi. From complementation to certification. In Proc. 10th TACAS, LNCS 2988, pages 591-606, 2004.
23. O. Kupferman and M.Y. Vardi. Complementation constructions for nondeterministic automata on infinite words. In Proc. 11th TACAS, LNCS 3440, pages 206-221, 2005.
24. O. Kupferman and M.Y. Vardi. Safraless decision procedures. In Proc. 46th FOCS, pages 531-540, 2005.
25. O. Kupferman, M.Y. Vardi, and P. Wolper. An automatatheoretic approach to branching-time model checking. Journal of the ACM, 47(2):312-360, March 2000.
26. R.P. Kurshan. Complementing deterministic Büchi automata in polynomial time. Journal of Computer and System Science, 35:59-71, 1987.
27. R.P. Kurshan. Computer Aided Verification of Coordinating Processes. Princeton Univ. Press, 1994.
28. R. McNaughton. Testing and generating infinite sequences by a finite automaton. I & C, 9:521-530, 1966.
29. A. R. Meyer. Weak monadic second order theory of successor is not elementary recursive. In Proc. ICALP, LNCS 453, pages 132-154, 1975.
30. M. Michel. Complementation is more difficult with automata on infinite words. CNET, Paris, 1988.
31. D.E. Muller and P.E. Schupp. Alternating automata on infinite trees. In Automata on Infinite Words, LNCS 192, pages 100-107, 1985.
32. D.E. Muller and P.E. Schupp. Alternating automata on infinite trees. Theoretical Computer Science, 54:267-276, 1987.
33. D.E. Muller and P.E. Schupp. Simulating alternating tree automata by nondeterministic automata: New results and new proofs of theorems of Rabin, McNaughton and Safra. Theoretical Computer Science, 141:69-107, 1995.
34. N. Piterman. From nondeterministic Büchi and Streett automata to deterministic parity automata. In 25th LICS, 2006.
35. A. Pnueli and R. Rosner. On the synthesis of a reactive module. In Proc. 16th POPL, pages 179-190, 1989.
36. M.O. Rabin. Decidability of second order theories and automata on infinite trees. Trans. AMS, 141:1-35, 1969.
37. M.O. Rabin. Weakly definable relations and special automata. In Proc. Symp. Math. Logic and Foundations of Set Theory, pages 1-23, 1970.
38. M.O. Rabin. Automata on infinite objects and Church's problem. Amer. Mathematical Society, 1972.
39. R. Rosner. Modular Synthesis of Reactive Systems. PhD thesis, Weizmann Institute of Science, Rehovot, Israel, 1992.
40. S. Safra. On the complexity of w-automata. In Proc. 29th FOCS, pages 319-327, 1988.
41. R. Sebastiani and S. Tonetta. "more deterministic" vs. "smaller" büchi automata for efficient ltl model checking. In Proc. 12th CHARME, LNCS 2860, pages 126-140, 2003.
42. 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.
43. F. Somenzi and R. Bloem. Efficient Büchi automata from LTL formulae. In Proc. 12th CAV, LNCS 1855, pages 248-263, 2000.
44. R.S. Street and E.A. Emerson. An elementary decision procedure for the μ-calculus. In Proc. 11th ICALP, LNCS 172, pages 465-472, 1984.
45. R.S. Streett. Propositional dynamic logic of looping and converse. Information and Control, 54:121-141, 1982.
46. S. Tasiran, R. Hojati, and R.K. Brayton. Language containment using non-deterministic omega-automata. In Proc. 8th CHARME, LNCS 987, pages 261-277, 1995.
47. W Thomas. Automata on infinite objects. Handbook of Theoretical Computer Science, pages 133-191, 1990.
48. M.Y. Vardi. Reasoning about the past with two-way automata. In Proc. 25th ICALP, LNCS 1443, pages 628-641, 1998.
49. M.Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Proc. 1st LICS, pages 332-344, 1986.
50. M.Y. Vardi and P. Wolper. Automata-theoretic techniques for modal logics of programs. Journal of Computer and System Science, 32(2):182-221, April 1986.
51. M.Y. Vardi and P. Wolper. Reasoning about infinite computations. I & C, 115(1):l-37, November 1994.
52. G. Wang, A. Mishchenko, R. Brayton, and A. SangiovanniVincentelli. Synthesizing FSMs according to co-Büchi properties. Technical report, UC Berkeley, 2005.
53. P. Wolper. Temporal logic can be more expressive. I & C, 56(1-2):72-99, 1983.
54. Q. Yan. Lower bounds for complementation of ω-automata via the full automata technique. In Proc. 33rd ICALP, LNCS 4052, pages 589-600, 2006.