Tripakis, S., Lickly, B., Henzinger, T. A., &; Lee, E. (2011). A theory of synchronous relational interfaces. ACM Transactions on Programming Languages and Systems (TOPLAS). ACM.https://doi.org/10.1145/1985342.1985345 
LibreCat: https://research-explorer.ista.ac.at/record/3353
DOI: 10.1145/1985342.1985345

Halalai, R., Henzinger, T. A., &; Singh, V. (2011). Quantitative evaluation of BFT protocols (pp. 255–264). Presented at the QEST: Quantitative Evaluation of Systems, Aachen, Germany: IEEE.https://doi.org/10.1109/QEST.2011.40 
LibreCat: https://research-explorer.ista.ac.at/record/3355
DOI: 10.1109/QEST.2011.40

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 
LibreCat: https://research-explorer.ista.ac.at/record/3354
DOI: 10.1145/1970398.1970404

Fisher, J., Harel, D., &; Henzinger, T. A. (2011). Biology as reactivity. Communications of the ACM. ACM.https://doi.org/10.1145/2001269.2001289 
LibreCat: https://research-explorer.ista.ac.at/record/3352
DOI: 10.1145/2001269.2001289

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 
LibreCat: https://research-explorer.ista.ac.at/record/3362
DOI: 10.1007/978-3-642-23217-6_27

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 
LibreCat: https://research-explorer.ista.ac.at/record/3365
DOI: 10.1007/978-3-642-19835-9_24

Chatterjee, K., Henzinger, T. A., &; Tracol, M. (n.d.). The decidability frontier for probabilistic automata on infinite words. ArXiv.
LibreCat: https://research-explorer.ista.ac.at/record/3363
arXiv: 1104.0127

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 
LibreCat: https://research-explorer.ista.ac.at/record/3381
DOI: 10.1142/S0129054111008441

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 
LibreCat: https://research-explorer.ista.ac.at/record/3315
DOI: 10.2168/LMCS-7(4:8)2011

Almagor, S., Boker, U., &; Kupferman, O. (2011). What’s decidable about weighted automatahttps://doi.org/10.1007/978-3-642-24372-1_37__(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 
LibreCat: https://research-explorer.ista.ac.at/record/3326
DOI: 10.1007/978-3-642-24372-1_37

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 
LibreCat: https://research-explorer.ista.ac.at/record/3325
DOI: 10.1145/1926385.1926454

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 
LibreCat: https://research-explorer.ista.ac.at/record/3324
DOI: 10.1007/978-3-642-18275-4_26

Boker, U., &; Henzinger, T. A. (2011). Determinizing discounted-sum automata (Vol. 12, pp. 82–96). Presented at the CSL: Computer Science Logic, Bergen, Norway: Springer.https://doi.org/10.4230/LIPIcs.CSL.2011.82 
LibreCat: https://research-explorer.ista.ac.at/record/3360
DOI: 10.4230/LIPIcs.CSL.2011.82

Cerny, P., Chatterjee, K., &; Henzinger, T. A. (2011). The complexity of quantitative information flow problems (pp. 205–217). Presented at the CSF: Computer Security Foundations, Cernay-la-Ville, France: IEEE.https://doi.org/10.1109/CSF.2011.21 
LibreCat: https://research-explorer.ista.ac.at/record/3361
DOI: 10.1109/CSF.2011.21

Henzinger, T. A., Singh, V., Wies, T., &; Zufferey, D. (2011). Scheduling large jobs by abstraction refinement (pp. 329–342). Presented at the EuroSys, Salzburg, Austria: ACM.https://doi.org/10.1145/1966445.1966476 
LibreCat: https://research-explorer.ista.ac.at/record/3358
DOI: 10.1145/1966445.1966476

Cerny, P., &; Henzinger, T. A. (2011). From boolean to quantitative synthesis (pp. 149–154). Presented at the EMSOFT: Embedded Software , Taipei; Taiwan: ACM.https://doi.org/10.1145/2038642.2038666 
LibreCat: https://research-explorer.ista.ac.at/record/3359
DOI: 10.1145/2038642.2038666

Chatterjee, K., Henzinger, T. A., &; Horn, F. (2011). The complexity of request-response games. In A.-H. Dediu, S. Inenaga, &; C. Martín-Vide (Eds.) (Vol. 6638, pp. 227–237). Presented at the LATA: Language and Automata Theory and Applications, Tarragona, Spain: Springer.https://doi.org/10.1007/978-3-642-21254-3_17 
LibreCat: https://research-explorer.ista.ac.at/record/3357
DOI: 10.1007/978-3-642-21254-3_17

Didier, F., Henzinger, T. A., Mateescu, M., &; Wolf, V. (2011). Approximation of event probabilities in noisy cellular processes. Theoretical Computer Science. Elsevier.https://doi.org/10.1016/j.tcs.2010.10.022 
LibreCat: https://research-explorer.ista.ac.at/record/3364
DOI: 10.1016/j.tcs.2010.10.022

Guerraoui, R., Henzinger, T. A., &; Singh, V. (2011). Verification of STM on relaxed memory models. Formal Methods in System Design. Springer.https://doi.org/10.1007/s10703-011-0131-3 
LibreCat: https://research-explorer.ista.ac.at/record/531
DOI: 10.1007/s10703-011-0131-3

Boker, U., Chatterjee, K., Henzinger, T. A., &; Kupferman, O. (2011). Temporal specifications with accumulative values. Presented at the LICS: Logic in Computer Science, Toronto, Canada: IEEE.https://doi.org/10.1109/LICS.2011.33 
LibreCat: https://research-explorer.ista.ac.at/record/3356
DOI: 10.1109/LICS.2011.33