Antichains for the automata-based approach to model-checking

Logical Methods in Computer Science

Volumn 5, Issue 1, 2009, Pages 1-20

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

^a EPFL   (Switzerland)

^b UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

Alternating b uchi automata; Antichains; Emptiness; Language inclusion; Nondeterministic b uchi automata; Universality

Indexed keywords

AUTOMATA THEORY;

ALTERNATING B̈UCHI AUTOMATON; ANTICHAIN; EMPTINESS; EMPTINESS PROBLEM; LANGUAGE INCLUSION; LANGUAGE INCLUSION PROBLEMS; MODELS CHECKING; NONDETERMINISTIC B̈UCHI AUTOMATON; PRE ORDERINGS; UNIVERSALITY;

MODEL CHECKING;

EID: 77951573543     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-5(1:5)2009     Document Type: Article

References (23)

1. R. Bloem, H. N. Gabow, and F. Somenzi. An algorithm for strongly connected component analysis in log symbolic steps. In Proceedings of FMCAD: Formal Methods in Computer- Aided Design, Lecture Notes in Computer Science 1954, pages 37-54. Springer, 2000.
2. J. Richard B̈uchi. On a decision method in restricted second order arithmetic. In Proc. International Congress on Logic, Method, and Philosophy of Science, pages 1-12. Stanford University Press, 1962.
3. K. Chatterjee, L. Doyen, T. A. Henzinger, and J.-F. Raskin. Algorithms for omega-regular games of incomplete information. Logical Methods in Computer Science, 3(3:4), 2007.
4. 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: Computer-Aided Verification, Lecture Notes in Computer Science 4144, pages 17-30. Springer-Verlag, 2006.
5. M. DeWulf, L. Doyen, N. Maquet, and J.-F. Raskin. Alaska: Antichains for logic, automata and symbolic kripke structures analysis. In Proceedings of ATVA 2008: Automated Technology for Verification and Analysis, Lecture Notes in Computer Science 5311, pages 240-245. Springer-Verlag, 2008.
6. M. De Wulf, L. Doyen, N. Maquet, and J.-F. Raskin. Antichains: Alternative algorithms for LTL satisfiability and model-checking. In Proceedings of TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Lecture Notes in Computer Science 4963, pages 63-77. Springer-Verlag, 2008.
7. M. De Wulf, L. Doyen, and J.-F. Raskin. A lattice theory for solving games of imperfect information. In Proceedings of HSCC: Hybrid Systems-Computation and Control, Lecture Notes in Computer Science 3927, pages 153-168. Springer-Verlag, 2006.
8. E. A. Emerson and C.-L. Lei. Efficient model checking in fragments of the propositional mucalculus (extended abstract). In Proceedings of LICS: Symposium on Logic in Computer Science, pages 267-278. IEEE Computer Society, 1986.
9. K. Etessami, T. Wilke, and R. A. Schuller. Fair simulation relations, parity games, and state space reduction for B̈uchi automata. SIAM J. Comput., 34(5):1159-1175, 2005.
10. S. Gurumurthy, O. Kupferman, F. Somenzi, and M. Y. Vardi. On complementing nondeterministic B̈uchi automata. In Proceedings of CHARME: Correct Hardware Design and Verification Methods, Lecture Notes in Computer Science 2860, pages 96-110. Springer-Verlag, 2003.
11. P. Gastin and D. Oddoux. Fast LTL to B̈uchi automata translation. In Proceedings of CAV: Computer-Aided Verification, Lecture Notes in Computer Science 2102, pages 53-65. Springer- Verlag, 2001.
12. R. Gentilini, C. Piazza, and A. Policriti. Computing strongly connected components in a linear number of symbolic steps. In Proceedings of SODA: ACM-SIAM Symposium on Discrete Algorithms, pages 573-582, 2003.
13. O. Kupferman and M. Y. Vardi. Weak alternating automata are not that weak. ACM Trans. Comput. Log., 2(3):408-429, 2001.
14. S. Miyano and T. Hayashi. Alternating finite automata on omega-words. In Proceedings of CAAP: Int. Colloquium on Trees in Algebra and Programming, pages 195-210, 1984.
15. M. Michel. Complementation is more difficult with automata on infinite words. CNET, Paris, 1988.
16. K. Ravi, R. Bloem, and F. Somenzi. A comparative study of symbolic algorithms for the computation of fair cycles. In Proceedings of FMCAD: Formal Methods in Computer-Aided Design, Lecture Notes in Computer Science 1954, pages 143-160. Springer, 2000.
17. T. C. Ruys and G. J. Holzmann. Advanced spin tutorial. In SPIN, Lecture Notes in Computer Science 2989, pages 304-305. Springer-Verlag, 2004.
18. S. Safra. On the complexity of!-automata. In Proceedings of FOCS: Foundations of Computer Science, pages 319-327. IEEE, 1988.
19. A. P. Sistla, M. Y. Vardi, and P. Wolper. The complementation problem for B̈uchi automata with applications to temporal logic. Theor. Comput. Sci., 49:217-237, 1987.
20. D. Tabakov and M. Y. Vardi. Experimental evaluation of classical automata constructions. In Proceedings of LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Lecture Notes in Computer Science 3835, pages 396-411. Springer-Verlag, 2005.
21. D. Tabakov and M. Y. Vardi. Model-checking B̈uchi specifications. In Pre-proceedings of LATA: Language and Automata Theory and Applications, 2007.
22. M. Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification (preliminary report). In Proceedings of LICS: Symposium on Logic in Computer Science, pages 332-344. IEEE Computer Society, 1986.
23. M. Y. Vardi and P. Wolper. Reasoning about infinite computations. Inf. Comput., 115(1):1-37, 1994.