Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | |||
|
nfasimsub [2015/05/29 02:15] rmayr |
nfasimsub [2015/05/29 02:17] (current) rmayr |
||
|---|---|---|---|
| Line 17: | Line 17: | ||
| * P.A. Abdulla, Y.-F. Chen, L. Holik, R. Mayr, and T. Vojnar. [[http://www.springerlink.com/content/a2g32650q853l185/?p=5a3f698fe2924e98ba116c85fbd7d1d8&pi=13|When Simulation Meets Antichains (On Checking Language Inclusion of NFAs)]]. In Proc. of 16th International Conference on Tools and Algorithms for the Construction and Analysis of Systems---TACAS'10, Paphos, Cyprus, volume 6015 of LNCS (the ARCoSS subline), pages 158--174, 2010. Springer-Verlag. An extended version appeared as the [[http://www.fit.vutbr.cz/~holik/pub/FIT-TR-2010-001.pdf|technical report FIT-TR-2010-01]], FIT BUT, Brno, Czech Republic, 2010. | * P.A. Abdulla, Y.-F. Chen, L. Holik, R. Mayr, and T. Vojnar. [[http://www.springerlink.com/content/a2g32650q853l185/?p=5a3f698fe2924e98ba116c85fbd7d1d8&pi=13|When Simulation Meets Antichains (On Checking Language Inclusion of NFAs)]]. In Proc. of 16th International Conference on Tools and Algorithms for the Construction and Analysis of Systems---TACAS'10, Paphos, Cyprus, volume 6015 of LNCS (the ARCoSS subline), pages 158--174, 2010. Springer-Verlag. An extended version appeared as the [[http://www.fit.vutbr.cz/~holik/pub/FIT-TR-2010-001.pdf|technical report FIT-TR-2010-01]], FIT BUT, Brno, Czech Republic, 2010. | ||
| * L. Holik, O. Lengal, J. Simacek, and T. Vojnar. [[http://www.springerlink.com/content/7058528622w84551/|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 [[http://www.fit.vutbr.cz/~ilengal/pub/FIT-TR-2011-04.pdf|technical report FIT-TR-2011-04]], FIT BUT, Brno, Czech Republic, 2011. | * L. Holik, O. Lengal, J. Simacek, and T. Vojnar. [[http://www.springerlink.com/content/7058528622w84551/|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 [[http://www.fit.vutbr.cz/~ilengal/pub/FIT-TR-2011-04.pdf|technical report FIT-TR-2011-04]], FIT BUT, Brno, Czech Republic, 2011. | ||
| - | *[[http://www.inf.ed.ac.uk/publications/report/1414.html | Richard Mayr, Lorenzo Clemente. Advanced Automata Minimization. POPL 2013. ACM 2013. Extended Technical Report EDI-INF-RR-1414.]] | + | * Richard Mayr, Lorenzo Clemente. [[http://www.inf.ed.ac.uk/publications/report/1414.html | Advanced Automata Minimization.]] POPL 2013. ACM 2013. Extended Technical Report EDI-INF-RR-1414. |
| - | * [[http://arxiv.org/abs/1505.04533 | 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.]] | + | * Pavol Černý, Edmund M. Clarke, Thomas A. Henzinger, Arjun Radhakrishna, Leonid Ryzhyk, Roopsha Samanta, Thorsten Tarrach. [[http://arxiv.org/abs/1505.04533 | From Non-preemptive to Preemptive Scheduling using Synchronization Synthesis.]] CAV 2015. To appear. |