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.
387 Publications
2011 | Journal Article | IST-REx-ID: 3354
Chatterjee, K., De Alfaro, L., & Henzinger, T. A. (2011). Qualitative concurrent parity games. ACM Transactions on Computational Logic (TOCL). ACM. https://doi.org/10.1145/1970398.1970404
View
| Files available
| DOI
2011 | Journal Article | IST-REx-ID: 3352
Fisher, J., Harel, D., & Henzinger, T. A. (2011). Biology as reactivity. Communications of the ACM. ACM. https://doi.org/10.1145/2001269.2001289
View
| DOI
2011 | Conference Paper | IST-REx-ID: 3362 | 
Fisher, J., Henzinger, T. A., Nickovic, D., Piterman, N., Singh, A., & Vardi, M. (2011). Dynamic reactive modules (Vol. 6901, pp. 404–418). Presented at the CONCUR: Concurrency Theory, Aachen, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-642-23217-6_27
[Submitted Version]
View
| Files available
| DOI
2011 | Conference Paper | IST-REx-ID: 3365 |
Chatterjee, K., Henzinger, T. A., Jobstmann, B., & Singh, R. (2011). QUASY: quantitative synthesis tool (Vol. 6605, pp. 267–271). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Saarbrucken, Germany: Springer. https://doi.org/10.1007/978-3-642-19835-9_24
[Submitted Version]
View
| Files available
| DOI
2011 | Preprint | IST-REx-ID: 3363 |
Chatterjee, K., Henzinger, T. A., & Tracol, M. (n.d.). The decidability frontier for probabilistic automata on infinite words. ArXiv.
[Preprint]
View
| Download Preprint (ext.)
| arXiv
2011 | Journal Article | IST-REx-ID: 3381 |
Henzinger, T. A., Jobstmann, B., & Wolf, V. (2011). Formalisms for specifying Markovian population models. IJFCS: International Journal of Foundations of Computer Science. World Scientific Publishing. https://doi.org/10.1142/S0129054111008441
[Submitted Version]
View
| Files available
| DOI
2011 | Journal Article | IST-REx-ID: 3315 |
Chatterjee, K., Henzinger, T. A., & Prabhu, V. (2011). Timed parity games: Complexity and robustness. Logical Methods in Computer Science. International Federation of Computational Logic. https://doi.org/10.2168/LMCS-7(4:8)2011
[Published Version]
View
| Files available
| DOI
2011 | Conference Paper | IST-REx-ID: 3326 |
Almagor, S., Boker, U., & Kupferman, O. (2011). What’s decidable about weighted automata (Vol. 6996, pp. 482–491). Presented at the ATVA: Automated Technology for Verification and Analysis, Taipei, Taiwan: Springer. https://doi.org/10.1007/978-3-642-24372-1_37
[Submitted Version]
View
| Files available
| DOI
2011 | Conference Paper | IST-REx-ID: 3325
Alur, R., & Cerny, P. (2011). Streaming transducers for algorithmic verification of single pass list processing programs (Vol. 46, pp. 599–610). Presented at the POPL: Principles of Programming Languages, Texas, USA: ACM. https://doi.org/10.1145/1926385.1926454
View
| DOI
2011 | Conference Paper | IST-REx-ID: 3324 |
Piskac, R., & Wies, T. (2011). Decision procedures for automating termination proofs. In R. Jhala & D. Schmidt (Eds.) (Vol. 6538, pp. 371–386). Presented at the VMCAI: Verification Model Checking and Abstract Interpretation, Texas, USA: Springer. https://doi.org/10.1007/978-3-642-18275-4_26
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)