Improved algorithms for the automata-based approach to model-checking

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4424 LNCS, Issue , 2007, Pages 451-465

  Doyen, Laurent ^a   Raskin, Jean François ^b  

^a EPFL   (Switzerland)

^b UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; MATHEMATICAL MODELS; MODEL CHECKING; PROBLEM SOLVING; AUTOMATA THEORY;

INFINITE WORDS; PROBABILISTIC MODEL; RANDOM AUTOMATON; AUTOMATON MODEL; COMPLEMENTATION; DIFFICULT INSTANCES; FIXED POINTS; INFINITE WORD; LANGUAGE INCLUSION PROBLEMS; ORDERS OF MAGNITUDE; PROBABILISTIC MODELING;

AUTOMATA THEORY; ALGORITHMS;

EID: 37149004079     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71209-1_34     Document Type: Conference Paper

References (16)

1. J. Richard Büchi and Lawrence H. Landweber. Definability in the monadic second-order theory of successor. J. Symb. Log., 34(2): 166-170, 1969.
2. M. De Wulf, L. Doyen, T. A. Henzinger, and J.-F. Raskin. Antichains: A new algorithm for checking universality of finite automata. In Proceedings of CAV 2006, LNCS 4144, pp. 17-30. Springer.
3. L. Doyen and J.-F. Raskin. Improved Algorithms for the Automata-Based Approach to Model-Checking (extended version) Tech. Rep. 76, U.L.B. - Federated Center in Verification, 2006. http://www.ulb.ac.be/di/ssd/cfv/publications.html.
4. K. Etessami, T. Wilke, and R. A. Schuller. Fair simulation relations, parity games, and state space reduction for bu"chi automata. SIAM J. Comput., 34(5): 1159-1175, 2005.
5. S. Gurumurthy, O. Kupferman, F. Somenzi, and M. Y. Vardi. On complementing nondeterministic büchi automata. In Proc. of CHARME 2003, LNCS 2860, pp. 96-110. Springer.
6. P. Gastin and D. Oddoux. Fast LTL to Büchi automata translation. In Proc. of CAV2001, LNCS 2102, pp. 53-65. Springer.
7. O. Kupferman and M. Y. Vardi. Weak alternating automata are not that weak. In Proceedings of ISTCS'97, pp. 147-158. IEEE Computer Society Press.
8. Satoru Miyano and Takeshi Hayashi. Alternating finite automata on omega-words. In CAAP, pages 195-210, 1984.
9. Max Michel. Complementation is more difficult with automata on infinite words. CNET, Paris, 1988.
10. Theo C. Ruys and Gerard J. Holzmann. Advanced spin tutorial. In SPIN, LNCS 2989, pp. 304-305. Springer, 2004.
11. Shmuel Safra. On the complexity of ω-automata. In Proc. of FOCS: Foundations of Computer Science, pages 319-327. IEEE, 1988.
12. A. P. Sistla, M. Y. Vardi and P. Wolper. The Complementation Problem for Büchi Automata with Applications to Temporal Logic. Theor. Comput. Sci, 49:217-237, 1987.
13. D. Tabakov. Experimental evaluation of explicit and symbolic approaches to com-plementation of non-deterministic buechi automata. Talk at "Games and Verification" workshop, Newton Institute for Math. Sciences. July 2006.
14. D. Tabakov and M. Y. Vardi. Experimental evaluation of classical automata constructions. In LPAR 2005, LNCS 3835, pp. 396-411. Springer.
15. M. Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification (prelim, report). In LICS 1986, pp. 332-344. IEEE.
16. Moshe Y. Vardi and Pierre Wolper. Reasoning about infinite computations. Inf. Comput., 115(1): 1-37, 1994.