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

Improved Algorithms for the Automata-Based Approach to Model-Checking

Published: Issue: Volume: Page:451-465
ISSN:
Container-title:Tools and Algorithms for the Construction and Analysis of Systems
language:
Short-container-title:

Author:

Doyen Laurent,Raskin Jean-François

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-71209-1_34.pdf

Reference16 articles.

1. Büchi, J.R., Landweber, L.H.: Definability in the monadic second-order theory of successor. J. Symb. Log. 34(2), 166–170 (1969)

2. Lecture Notes in Computer Science;M. Wulf De,2006

3. Doyen, L., Raskin, J.-F.: 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. Etessami, K., Wilke, T., Schuller, R.A.: Fair simulation relations, parity games, and state space reduction for büchi automata. SIAM J. Comput. 34(5), 1159–1175 (2005)

5. Lecture Notes in Computer Science;S. Gurumurthy,2003

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

1. Accelerate Safety Model Checking Based on Complementary Approximate Reachability;IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems;2023-09

2. Universality of Büchi Automata: Analysis With Graph Neural Networks;IEEE Access;2023

3. Exploiting Anti-scenarios for the Non Realizability Problem;Computer Science – CACIC 2019;2020

4. Coinductive Algorithms for Büchi Automata;Developments in Language Theory;2019

5. Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes;Acta Informatica;2016-02-01