Antichains for the Automata-Based Approach to Model-Checking-Reference-Cited by-同舟云学术

Antichains for the Automata-Based Approach to Model-Checking

Published:2009-03-02 Issue:1 Volume:5 Page:
ISSN:1860-5974
Container-title:Logical Methods in Computer Science
language:en
Short-container-title:Log.Meth.Comput.Sci.

Author:

Doyen Laurent,Raskin Jean-François

Publisher

Centre pour la Communication Scientifique Directe (CCSD)

Subject

General Computer Science,Theoretical Computer Science

Reference23 articles.

1. R. Bloem, H. N. Gabow, and F. Somenzi. An algorithm for strongly connected component analysis in it log it symbolic steps. InProceedings of FMCAD: Formal Methods in Computer-Aided Design, Lecture Notes in Computer Science 1954, pages 37-54. Springer, 2000.

2. J. Richard Büchi. On a decision method in restricted second order arithmetic. InProc. International Congress on Logic, Method, and Philosophy of Science, pages 1-12. Stanford University Press, 1962.

3. M. De Wulf, L. Doyen, T. A. Henzinger, and J.-F. Raskin. Antichains: A new algorithm for checking universality of finite automata. InProceedings of CAV: Computer-Aided Verification, Lecture Notes in Computer Science 4144, pages 17-30. Springer-Verlag, 2006.

4. M. De Wulf, L. Doyen, N. Maquet, and J.-F. Raskin. Alaska: Antichains for logic, automata and symbolic kripke structures analysis. InProceedings of ATVA 2008: Automated Technology for Verification and Analysis, Lecture Notes in Computer Science 5311, pages 240-245. Springer-Verlag, 2008.

Cited by 23 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the power of finite ambiguity in Büchi complementation;Information and Computation;2023-06

2. A general language-based framework for specifying and verifying notions of opacity;Discrete Event Dynamic Systems;2022-02-02

3. FORQ-Based Language Inclusion Formal Testing;Computer Aided Verification;2022

4. Coinductive Algorithms for Büchi Automata;Fundamenta Informaticae;2021-06-30

5. On the Power of Unambiguity in Büchi Complementation;Electronic Proceedings in Theoretical Computer Science;2020-09-20