Publications
Inclusion Checking
- F. Bonchi and D. Pous. Checking NFA equivalence with bisimulations up to congruence. POPL 2013. ACM 2013.
- Richard Mayr, Lorenzo Clemente. Advanced Automata Minimization. POPL 2013. ACM 2013. Extended Technical Report EDI-INF-RR-1414.
- Richard Mayr, Parosh Aziz Abdulla, Yu-Fang Chen, Lorenzo Clemente, Lukás Holik, Chih-Duo Hong and Tomas Vojnar. Advanced Ramsey-based Buchi Automata Inclusion Testing. CONCUR 2011. Volume 6901 in LNCS. 2011.
- L. Holik, O. Lengal, J. Simacek, and T. Vojnar. Efficient Inclusion Checking on Explicit and Semi-Symbolic Tree Automata. In Proc. of 9th International Symposium on Automated Technology for Verification and Analysis—ATVA'11, Taipei, Taiwan, volume 6996 of LNCS, pages 243–258, 2011. An extended version appeared as the technical report FIT-TR-2011-04, FIT BUT, Brno, Czech Republic, 2011.
- Parosh Aziz Abdulla, Yu-Fang Chen, Lorenzo Clemente, Lukás Holík, Chih-Duo Hong, Richard Mayr, Tomás Vojnar. Simulation Subsumption in Ramsey-Based Büchi Automata Universality and Inclusion Testing. CAV 2010: 132-147.
- Parosh Aziz Abdulla, Yu-Fang Chen, Lukás Holík, Richard Mayr, Tomás Vojnar. [http://www.fit.vutbr.cz/units/UITS/pubs/tr.php?id=9152 | When Simulation Meets Antichains.]] TACAS 2010: 158-174.
- Seth Fogarty, Moshe Y. Vardi: Efficient Büchi Universality Checking. TACAS 2010: 205-220
- Seth Fogarty, Moshe Y. Vardi: Büchi Complementation and Size-Change Termination. TACAS 2009: 16-30
- A. Bouajjani, P. Habermehl, L. Holik, T. Touili, and T. Vojnar. Antichain-based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata. In Proc. of 13th International Conference on Implementation and Application of Automata—CIAA'08, San Francisco, CA, USA, volume 5148 of LNCS, pages 57–67, 2008. Springer-Verlag. An extended version appeared as the technical report FIT-TR-2008-001, FIT BUT, Brno, Czech Republic, 2008.
- Pavol Černý, Edmund M. Clarke, Thomas A. Henzinger, Arjun Radhakrishna, Leonid Ryzhyk, Roopsha Samanta, Thorsten Tarrach. From Non-preemptive to Preemptive Scheduling using Synchronization Synthesis. CAV 2015. To appear.
Automata Minimization
- Ricardo Almeida, Lukas Holik, Richard Mayr. Reduction of Nondeterministic Tree Automata. TACAS 2016, LNCS 9636. Eindhoven, The Netherlands. 2016.
- Ricardo Almeida. Reducing Nondeterministic Tree Automata by Adding Transitions. MEMICS 2016. Electronic Proceedings in Theoretical Computer Science. Volume 233. DOI 10.4204/EPTCS.233.4.
- Ricardo Almeida. Efficient algorithms for hard problems in nondeterministic tree automata. PhD thesis. School of Informatics. University of Edinburgh, UK. 2017.
- Richard Mayr, Lorenzo Clemente. Advanced Automata Minimization. POPL 2013. ACM 2013. Extended Technical Report EDI-INF-RR-1414.
- Lorenzo Clemente Buechi Automata Can Have Smaller Quotients. ICALP 2011: 258-270.
- Parosh Aziz Abdulla, Yu-Fang Chen, Lukás Holík, Tomás Vojnar: Mediating for Reduction (on Minimizing Alternating Büchi Automata). FSTTCS 2009: 1-12
- Parosh Aziz Abdulla, Lukás Holík, Lisa Kaati, Tomás Vojnar: A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata. Electr. Notes Theor. Comput. Sci. 251: 27-48 (2009)
- Parosh Aziz Abdulla, Ahmed Bouajjani, Lukás Holík, Lisa Kaati, Tomás Vojnar: Composed Bisimulation for Tree Automata. Int. J. Found. Comput. Sci. 20(4): 685-700 (2009)
- Parosh Aziz Abdulla, Ahmed Bouajjani, Lukás Holík, Lisa Kaati, Tomás Vojnar: Composed Bisimulation for Tree Automata. CIAA 2008: 212-222