Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
386 Publications
2011 | Conference Paper | IST-REx-ID: 3362 | 
J. Fisher, T. A. Henzinger, D. Nickovic, N. Piterman, A. Singh, and M. Vardi, “Dynamic reactive modules,” presented at the CONCUR: Concurrency Theory, Aachen, Germany, 2011, vol. 6901, pp. 404–418.
[Submitted Version]
View
| Files available
| DOI
2011 | Conference Paper | IST-REx-ID: 3365 |
K. Chatterjee, T. A. Henzinger, B. Jobstmann, and R. Singh, “QUASY: quantitative synthesis tool,” presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Saarbrucken, Germany, 2011, vol. 6605, pp. 267–271.
[Submitted Version]
View
| Files available
| DOI
2011 | Preprint | IST-REx-ID: 3363 |
K. Chatterjee, T. A. Henzinger, and M. Tracol, “The decidability frontier for probabilistic automata on infinite words.” ArXiv.
[Preprint]
View
| Download Preprint (ext.)
| arXiv
2011 | Journal Article | IST-REx-ID: 3381 |
T. A. Henzinger, B. Jobstmann, and V. Wolf, “Formalisms for specifying Markovian population models,” IJFCS: International Journal of Foundations of Computer Science, vol. 22, no. 4. World Scientific Publishing, pp. 823–841, 2011.
[Submitted Version]
View
| Files available
| DOI
2011 | Journal Article | IST-REx-ID: 3315 |
K. Chatterjee, T. A. Henzinger, and V. Prabhu, “Timed parity games: Complexity and robustness,” Logical Methods in Computer Science, vol. 7, no. 4. International Federation of Computational Logic, 2011.
[Published Version]
View
| Files available
| DOI
2011 | Conference Paper | IST-REx-ID: 3326 |
S. Almagor, U. Boker, and O. Kupferman, “What’s decidable about weighted automata ,” presented at the ATVA: Automated Technology for Verification and Analysis, Taipei, Taiwan, 2011, vol. 6996, pp. 482–491.
[Submitted Version]
View
| Files available
| DOI
2011 | Conference Paper | IST-REx-ID: 3324 |
R. Piskac and T. Wies, “Decision procedures for automating termination proofs,” presented at the VMCAI: Verification Model Checking and Abstract Interpretation, Texas, USA, 2011, vol. 6538, pp. 371–386.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2011 | Conference Paper | IST-REx-ID: 3360 |
U. Boker and T. A. Henzinger, “Determinizing discounted-sum automata,” presented at the CSL: Computer Science Logic, Bergen, Norway, 2011, vol. 12, pp. 82–96.
[Published Version]
View
| Files available
| DOI