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.
2989 Publications
2011 | Preprint | IST-REx-ID: 3339 |

Magnifying lens abstraction for stochastic games with discounted and long-run average objectives
K. Chatterjee, L. De Alfaro, R. Pritam, ArXiv (2011).
View
| Download Preprint (ext.)
| arXiv
K. Chatterjee, L. De Alfaro, R. Pritam, ArXiv (2011).
2011 | Conference Paper | IST-REx-ID: 3342 |

Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives
K. Chatterjee, M. Henzinger, M. Joglekar, S. Nisarg, in:, G. Gopalakrishnan, S. Qadeer (Eds.), Springer, 2011, pp. 260–276.
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
K. Chatterjee, M. Henzinger, M. Joglekar, S. Nisarg, in:, G. Gopalakrishnan, S. Qadeer (Eds.), Springer, 2011, pp. 260–276.
2011 | Conference Paper | IST-REx-ID: 3343 |

Faster and dynamic algorithms for maximal end component decomposition and related graph problems in probabilistic verification
K. Chatterjee, M. Henzinger, in:, SIAM, 2011, pp. 1318–1336.
View
| DOI
| Download Submitted Version (ext.)
K. Chatterjee, M. Henzinger, in:, SIAM, 2011, pp. 1318–1336.
2011 | Conference Paper | IST-REx-ID: 3344
Graph games with reachability objectives
K. Chatterjee, in:, G. Delzanno, I. Potapov (Eds.), Springer, 2011, pp. 1–1.
View
| DOI
K. Chatterjee, in:, G. Delzanno, I. Potapov (Eds.), Springer, 2011, pp. 1–1.
2011 | Conference Paper | IST-REx-ID: 3357
The complexity of request-response games
K. Chatterjee, T.A. Henzinger, F. Horn, in:, A.-H. Dediu, S. Inenaga, C. Martín-Vide (Eds.), Springer, 2011, pp. 227–237.
View
| DOI
K. Chatterjee, T.A. Henzinger, F. Horn, in:, A.-H. Dediu, S. Inenaga, C. Martín-Vide (Eds.), Springer, 2011, pp. 227–237.
2011 | Conference Paper | IST-REx-ID: 3358 |

Scheduling large jobs by abstraction refinement
T.A. Henzinger, V. Singh, T. Wies, D. Zufferey, in:, ACM, 2011, pp. 329–342.
View
| DOI
| Download Published Version (ext.)
T.A. Henzinger, V. Singh, T. Wies, D. Zufferey, in:, ACM, 2011, pp. 329–342.
2011 | Conference Paper | IST-REx-ID: 3359
From boolean to quantitative synthesis
P. Cerny, T.A. Henzinger, in:, ACM, 2011, pp. 149–154.
View
| DOI
P. Cerny, T.A. Henzinger, in:, ACM, 2011, pp. 149–154.
2011 | Conference Paper | IST-REx-ID: 3360 |

Determinizing discounted-sum automata
U. Boker, T.A. Henzinger, in:, Springer, 2011, pp. 82–96.
View
| Files available
| DOI
U. Boker, T.A. Henzinger, in:, Springer, 2011, pp. 82–96.
2011 | Conference Paper | IST-REx-ID: 3361 |

The complexity of quantitative information flow problems
P. Cerny, K. Chatterjee, T.A. Henzinger, in:, IEEE, 2011, pp. 205–217.
View
| Files available
| DOI
P. Cerny, K. Chatterjee, T.A. Henzinger, in:, IEEE, 2011, pp. 205–217.
2011 | Conference Paper | IST-REx-ID: 3362 |

Dynamic reactive modules
J. Fisher, T.A. Henzinger, D. Nickovic, N. Piterman, A. Singh, M. Vardi, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2011, pp. 404–418.
View
| Files available
| DOI
J. Fisher, T.A. Henzinger, D. Nickovic, N. Piterman, A. Singh, M. Vardi, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2011, pp. 404–418.