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.
392 Publications
2011 |Published| Conference Paper | IST-REx-ID: 3301 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Henzinger, T. A., & Mateescu, M. (2011). Tail approximation for the chemical master equation. Presented at the WCSB: Workshop on Computational Systems Biology (TICSP), Tampere International Center for Signal Processing.
[Submitted Version]
View
| Files available
2011 |Published| Conference Paper | IST-REx-ID: 3299 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Henzinger, T. A., & Mateescu, M. (2011). Propagation models for computing biochemical reaction networks (pp. 1–3). Presented at the CMSB: Computational Methods in Systems Biology, Paris, France: Springer. https://doi.org/10.1145/2037509.2037510
[Submitted Version]
View
| Files available
| DOI
2011 |Published| Conference Paper | IST-REx-ID: 3316 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Bloem, R., Chatterjee, K., Greimel, K., Henzinger, T. A., & Jobstmann, B. (2011). Specification-centered robustness. In 6th IEEE International Symposium on Industrial and Embedded Systems (pp. 176–185). Vasteras, Sweden: IEEE. https://doi.org/10.1109/SIES.2011.5953660
[Published Version]
View
| DOI
| Download Published Version (ext.)
2011 |Published| Journal Article | IST-REx-ID: 3353 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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
[Submitted Version]
View
| Files available
| DOI
2011 |Published| Conference Paper | IST-REx-ID: 3355 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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
[Submitted Version]
View
| Files available
| DOI
2011 |Published| 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 |Published| 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 |Published| Conference Paper | IST-REx-ID: 3362 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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 |Published| Conference Paper | IST-REx-ID: 3365 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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 |Submitted| Preprint | IST-REx-ID: 3363 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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 |Published| Journal Article | IST-REx-ID: 3381 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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 |Published| Journal Article | IST-REx-ID: 3315 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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 |Published| Conference Paper | IST-REx-ID: 3326 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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 |Published| 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 |Published| Conference Paper | IST-REx-ID: 3324 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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.)
2011 |Published| Conference Paper | IST-REx-ID: 3360 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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
[Published Version]
View
| Files available
| DOI
2011 |Published| Conference Paper | IST-REx-ID: 3361 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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
[Submitted Version]
View
| Files available
| DOI
2011 |Published| Conference Paper | IST-REx-ID: 3358 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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
[Published Version]
View
| DOI
| Download Published Version (ext.)
2011 |Published| Conference Paper | IST-REx-ID: 3359
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
View
| DOI
2011 |Published| Conference Paper | IST-REx-ID: 3357
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
View
| DOI