Computing Simulations over Tree Automata-Reference-Cited by-同舟云学术

Computing Simulations over Tree Automata

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

Author:

Abdulla Parosh A.,Bouajjani Ahmed,Holík Lukáš,Kaati Lisa,Vojnar Tomáš

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-78800-3_8.pdf

Reference14 articles.

1. Abdulla, P., Bouajjani, A., Holík, L., Kaati, L., Vojnar, T.: Computing Simulations over Tree Automata. Technical report, FIT-TR-2007-001, FIT, Brno University of Technology, Czech Republic (2007)

2. Lecture Notes in Computer Science;P. Abdulla,2006

3. Lecture Notes in Computer Science;P. Abdulla,2002

4. Abdulla, P., Legay, A., d’Orso, J., Rezine, A.: Tree Regular Model Checking: A Simulation-based Approach. The Journal of Logic and Algebraic Programming 69(1-2), 93–121 (2006)

5. Bouajjani, A., Habermehl, P., Rogalewicz, A., Vojnar, T.: Abstract Regular Tree Model Checking. In: ENTCS, vol. 149(1), pp. 37–48. Elsevier, Amsterdam (2006)

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

1. An Automata-Based Framework for Verification and Bug Hunting in Quantum Circuits;Proceedings of the ACM on Programming Languages;2023-06-06

2. A minimization algorithm for fuzzy top-down tree automata over lattices;Journal of Intelligent & Fuzzy Systems;2021-03-02

3. Towards Efficient Shape Analysis with Tree Automata;Networked Systems;2021

4. Nested antichains for WS1S;Acta Informatica;2019-01-01

5. Multi-buffer simulations: Decidability and complexity;Information and Computation;2018-10