When Simulation Meets Antichains-Reference-Cited by-同舟云学术

When Simulation Meets Antichains

Published:2010 Issue: Volume: Page:158-174
ISSN:0302-9743
Container-title:Tools and Algorithms for the Construction and Analysis of Systems
language:
Short-container-title:

Author:

Abdulla Parosh Aziz,Chen Yu-Fang,Holík Lukáš,Mayr Richard,Vojnar Tomáš

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-12002-2_14.pdf

Reference13 articles.

1. Lecture Notes in Computer Science;P.A. Abdulla,2008

2. Abdulla, P.A., Chen, Y.-F., Holík, L., Mayr, R., Vojnar, T.: When Simulation Meets Antichains (On Checking Language Inclusion of Nondeterministic Finite (Tree) Automata). Technical report, FIT-TR-2010-001, FIT, Brno University of Technology, Czech Republic (2010)

3. Lecture Notes in Computer Science;A. Bouajjani,2008

4. Lecture Notes in Computer Science;A. Bouajjani,2005

5. Lecture Notes in Computer Science;A. Bouajjani,2004

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

1. Finite Automata synthesis from Interactions;Proceedings of the 2024 IEEE/ACM 12th International Conference on Formal Methods in Software Engineering (FormaliSE);2024-04-14

2. Mata: A Fast and Simple Finite Automata Library;Lecture Notes in Computer Science;2024

3. Z3-Noodler: An Automata-based String Solver;Lecture Notes in Computer Science;2024

4. Reasoning About Regular Properties: A Comparative Study;Automated Deduction – CADE 29;2023

5. Antichains Algorithms for the Inclusion Problem Between $$\omega $$-VPL;Tools and Algorithms for the Construction and Analysis of Systems;2023