From complementation to certification

Theoretical Computer Science

Volumn 345, Issue 1, 2005, Pages 83-100

  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; CODES (SYMBOLS); COMPUTER SCIENCE; INFORMATION TECHNOLOGY; MATHEMATICAL MODELS; SPECIFICATIONS; WORD PROCESSING;

AUTOMATA-THEORETIC PROBLEMS; AUTOMATON; SYMBOLIC EMPTINESS ALGORITHM; WORD AUTOMATA;

AUTOMATA THEORY;

EID: 27644516416     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.07.021     Document Type: Conference Paper

References (38)

1. R. Bahar, E. Frohm, C. Gaona, G. Hachtel, E. Macii, A. Pardo, and F. Somenzi Algebraic decision diagrams and their applications FMSD 10 2/3 1997 171 206
2. I. Beer, S. Ben-David, D. Geist, R. Gewirtzman, M. Yoeli, Methodology and system for practical formal verification of reactive hardware, in: Proc. sixth CAV, Lecture Notes in Computer Science, Vol. 818, 1994, pp. 182-193.
3. R. Bloem, H.N. Gabow, F. Somenzi, An algorithm for strongly connected component analysis in n log n symbolic steps, in: Proc. FMCAD, Lecture Notes in Computer Science, Vol. 1954, 2000, pp. 37-54.
4. J.R. Büchi, On a decision method in restricted second order arithmetic, in: Proc. Internat. Congr. Logic, Method and Philosophical Sciences, Vol. 1960, Stanford University Press, Stanford, 1962, pp. 1-12.
5. J.R. Burch, E.M. Clarke, K.L. McMillan, D.L. Dill, and L.J. Hwang Symbolic model checking 1020 states and beyond Inform. and Comput. 98 2 1992 142 170
6. Y. Choueka Theories of automata on ω -tapes a simplified approach J. Comput. System Sci. 8 1974 117 141
7. E.A. Emerson, C.-L. Lei, Efficient model checking in fragments of the propositional μ -calculus, in: Proc. 1st LICS, 1986, pp. 267-278.
8. K. Fisler, R. Fraer, G. Kamhi, M.Y. Vardi, Z. Yang, Is there a best symbolic cycle-detection algorithm? in: Proc. seventh TACAS, Lecture Notes in Computer Science, Vol. 2031, 2001, pp. 420-434.
9. R. Gentilini, C. Piazza, A. Policriti, Computing strongly connected components in a linear number of symbolic steps, in: Proc. 14th SODA, 2003, pp. 573-582.
10. R. Gerth, D. Peled, M.Y. Vardi, P. Wolper, Simple on-the-fly automatic verification of linear temporal logic, in: Protocol Specification, Testing, and Verification, August 1995, Chapman & Hall, London, pp. 3-18.
11. G. De Giacomo, M.Y. Vardi, Automata-theoretic approach to planning for temporally extended goals, in: Proc. fifth ECP, Lecture Notes in Artificial Intelligence, Vol. 1809, 2000, pp. 226-238.
12. S. Gurumurthy, O. Kupferman, F. Somenzi, M.Y. Vardi, On complementing nondeterministic Büchi automata, in: Proc. 12th CHARME, Lecture Notes in Computer Science, 2003.
13. R.H. Hardin, R.P. Kurshan, S.K. Shukla, M.Y. Vardi, A new heuristic for bad cycle detection using BDDs, in: Proc. ninth CAV, Lecture Notes in Computer Science, Vol. 1254, 1997, pp. 268-278.
14. R. Hojati, H. Touati, R. Kurshan, R. Brayton, Efficient ω -regula language containment, in: Proc. fourth CAV, Lecture Notes in Computer Science, Vol. 663, 1992.
15. Y. Kesten, A. Pnueli, L. Raviv, Algorithmic verification of linear temporal logic specifications, in: Proc. 25th ICALP, Lecture Notes in Computer Science, Vol. 1443, 1998, pp. 1-16.
16. N. Klarlund, Progress measures for complementation of ω -automata with applications to temporal logic, in: Proc. 32nd FOCS, 1991, pp. 358-367.
17. O. Kupferman, and M.Y. Vardi Weak alternating automata are not that weak ACM Trans. Comput. Logic 2001 2 2001 408 429
18. O. Kupferman, and M.Y. Vardi Model checking of safety properties Formal Methods System Design 19 3 2001 291 314
19. R.P. Kurshan, The complexity of verification, in: 26th STOC, 1994, pp. 365-371.
20. R.P. Kurshan Computer Aided Verification of Coordinating Processes 1994 Princeton University Press Princeton, NJ
21. Z. Manna, A. Pnueli, Specification and verification of concurrent programs by ∀ -automata, in: Proc. 14th POPL, 1987, pp. 1-12.
22. Z. Manna, A. Pnueli, The Temporal Logic of Reactive and Concurrent Systems: Specification, Berlin, January 1992.
23. Z. Manna, and P. Wolper Synthesis of communicating processes from temporal logic specifications ACM TOPLAS 6 1 1984 68 93
24. S. Merz, Weak alternating automata in Isabelle/HOL, in: Theorem Proving in Higher Order Logics: 13th International Conference, Lecture Notes in Computer Science, Vol. 1869, 2000, pp. 423-440.
25. M. Michel, Complementation is more difficult with automata on infinite words, CNET, Paris, 1988.
26. S. Miyano, and T. Hayashi Alternating finite automata on ω -words Theoret. Comput. Sci. 32 1984 321 330
27. K.S. Namjoshi, Certifying model checkers, in: Proc. 13th CAV, Lecture Notes in Computer Science, Vol. 2102, 2001, pp. 2-13.
28. G.C. Necula, Proof-carrying code, in: Proc. 24th POPL, 1997, pp. 106-119.
29. D. Peled, A. Pnueli, L.D. Zuck, From falsification to verification, in: Proc. 21st FST&TCS, Lecture Notes in Computer Science, Vol. 2245, 2001, pp. 292-304.
30. D. Peled, L.D. Zuck, From model checking to a temporal proof. in: Proc. eighth SPIN Workshop on Model Checking of Software, Lecture Notes in Computer Science, Vol. 2057, 2001, pp. 1-14.
31. K. Ravi, R. Bloem, F. Somenzi, A comparative study of symbolic algorithms for the computation of fair cycles, in: Proc. FMCAD, Lecture Notes in Computer Science, Vol. 1954, 2000, pp. 143-160.
32. S. Safra, On the complexity of ω -automata, in: 29th FOCS, 1988, pp. 319-327.
33. A.P. Sistla Safety, liveness and fairness in temporal logic Formal Aspects Comput. 6 1994 495 511
34. A.P. Sistla, M.Y. Vardi, and P. Wolper The complementation problem for Büchi automata with applications to temporal logic Theoret. Comput. Sci. 49 1987 217 237
35. F. Somenzi, R. Bloem, Efficient Büchi automata from LTL formulae, in: Proc. 12th CAV, Lecture Notes in Computer Science, Vol. 1855, 2000, pp. 248-263.
36. S. Tasiran, R. Hojati, R.K. Brayton, Language containment using non-deterministic ω -automata, in: Proc. eighth CHARME, Lecture Notes in Computer Science, Vol. 987, 1995, pp. 261-277.
37. M.Y. Vardi, and P. Wolper Reasoning about infinite computations Inform. and Comput. 115 1 1994 1 37
38. P. Wolper Temporal logic can be more expressive Inform. and Control 56 1-2 1983 72 99