Henzinger, Thomas A, and Maria Mateescu. “Propagation Models for Computing Biochemical Reaction Networks,”https://doi.org/10.1145/2037509.2037510__1–3. Springer, 2011.https://doi.org/10.1145/2037509.2037510 .

Bloem, Roderick, Krishnendu Chatterjee, Karin Greimel, Thomas A Henzinger, and Barbara Jobstmann. “Specification-Centered Robustness.”https://doi.org/10.1109/SIES.2011.5953660__In 6th IEEE International Symposium on Industrial and Embedded Systems, 176–85. IEEE, 2011.https://doi.org/10.1109/SIES.2011.5953660 .

Tripakis, Stavros, Ben Lickly, Thomas A Henzinger, and Edward Lee. “A Theory of Synchronous Relational Interfaces.”https://doi.org/10.1145/1985342.1985345__ACM Transactions on Programming Languages and Systems (TOPLAS). ACM, 2011.https://doi.org/10.1145/1985342.1985345 .

Halalai, Raluca, Thomas A Henzinger, and Vasu Singh. “Quantitative Evaluation of BFT Protocols,”https://doi.org/10.1109/QEST.2011.40__255–64. IEEE, 2011.https://doi.org/10.1109/QEST.2011.40 .

Chatterjee, Krishnendu, Luca De Alfaro, and Thomas A Henzinger. “Qualitative Concurrent Parity Games.”https://doi.org/10.1145/1970398.1970404__ACM Transactions on Computational Logic (TOCL). ACM, 2011.https://doi.org/10.1145/1970398.1970404 .

Fisher, Jasmin, David Harel, and Thomas A Henzinger. “Biology as Reactivity.”https://doi.org/10.1145/2001269.2001289__Communications of the ACM. ACM, 2011.https://doi.org/10.1145/2001269.2001289 .

Fisher, Jasmin, Thomas A Henzinger, Dejan Nickovic, Nir Piterman, Anmol Singh, and Moshe Vardi. “Dynamic Reactive Modules,”https://doi.org/10.1007/978-3-642-23217-6_27__6901:404–18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2011.https://doi.org/10.1007/978-3-642-23217-6_27 .

Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Rohit Singh. “QUASY: Quantitative Synthesis Tool,”https://doi.org/10.1007/978-3-642-19835-9_24__6605:267–71. Springer, 2011.https://doi.org/10.1007/978-3-642-19835-9_24 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Mathieu Tracol. “The Decidability Frontier for Probabilistic Automata on Infinite Words.” ArXiv, n.d.

Henzinger, Thomas A, Barbara Jobstmann, and Verena Wolf. “Formalisms for Specifying Markovian Population Models.”https://doi.org/10.1142/S0129054111008441__IJFCS: International Journal of Foundations of Computer Science. World Scientific Publishing, 2011.https://doi.org/10.1142/S0129054111008441 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Vinayak Prabhu. “Timed Parity Games: Complexity and Robustness.”https://doi.org/10.2168/LMCS-7(4:8)2011__Logical Methods in Computer Science. International Federation of Computational Logic, 2011.https://doi.org/10.2168/LMCS-7(4:8)2011 .

Almagor, Shaull, Udi Boker, and Orna Kupferman. “What’s Decidable about Weighted Automata ,”https://doi.org/10.1007/978-3-642-24372-1_37__6996:482–91. Springer, 2011.https://doi.org/10.1007/978-3-642-24372-1_37 .

Alur, Rajeev, and Pavol Cerny. “Streaming Transducers for Algorithmic Verification of Single Pass List Processing Programs,”https://doi.org/10.1145/1926385.1926454__46:599–610. ACM, 2011.https://doi.org/10.1145/1926385.1926454 .

Piskac, Ruzica, and Thomas Wies. “Decision Procedures for Automating Termination Proofs.”https://doi.org/10.1007/978-3-642-18275-4_26__edited by Ranjit Jhala and David Schmidt, 6538:371–86. Springer, 2011.https://doi.org/10.1007/978-3-642-18275-4_26 .

Boker, Udi, and Thomas A Henzinger. “Determinizing Discounted-Sum Automata,”https://doi.org/10.4230/LIPIcs.CSL.2011.82__12:82–96. Springer, 2011.https://doi.org/10.4230/LIPIcs.CSL.2011.82 .

Cerny, Pavol, Krishnendu Chatterjee, and Thomas A Henzinger. “The Complexity of Quantitative Information Flow Problems,”https://doi.org/10.1109/CSF.2011.21__205–17. IEEE, 2011.https://doi.org/10.1109/CSF.2011.21 .

Henzinger, Thomas A, Vasu Singh, Thomas Wies, and Damien Zufferey. “Scheduling Large Jobs by Abstraction Refinement,”https://doi.org/10.1145/1966445.1966476__329–42. ACM, 2011.https://doi.org/10.1145/1966445.1966476 .

Cerny, Pavol, and Thomas A Henzinger. “From Boolean to Quantitative Synthesis,”https://doi.org/10.1145/2038642.2038666__149–54. ACM, 2011.https://doi.org/10.1145/2038642.2038666 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Florian Horn. “The Complexity of Request-Response Games.”https://doi.org/10.1007/978-3-642-21254-3_17__edited by Adrian-Horia Dediu, Shunsuke Inenaga, and Carlos Martín-Vide, 6638:227–37. Springer, 2011.https://doi.org/10.1007/978-3-642-21254-3_17 .

Didier, Frédéric, Thomas A Henzinger, Maria Mateescu, and Verena Wolf. “Approximation of Event Probabilities in Noisy Cellular Processes.”https://doi.org/10.1016/j.tcs.2010.10.022__Theoretical Computer Science. Elsevier, 2011.https://doi.org/10.1016/j.tcs.2010.10.022 .