Joost P Katoen
Chatterjee Group
Henzinger_Thomas Group
4 Publications
2023 | Journal Article | IST-REx-ID: 12738 | 
Chatterjee, K., Katoen, J. P., Mohr, S., Weininger, M., & Winkler, T. (2023). Stochastic games with lexicographic objectives. Formal Methods in System Design. Springer Nature. https://doi.org/10.1007/s10703-023-00411-4
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
| WoS
2020 | Conference Paper | IST-REx-ID: 8272 |
Chatterjee, K., Katoen, J. P., Weininger, M., & Winkler, T. (2020). Stochastic games with lexicographic reachability-safety objectives. In International Conference on Computer Aided Verification (Vol. 12225, pp. 398–420). Springer Nature. https://doi.org/10.1007/978-3-030-53291-8_21
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2018 | Conference Paper | IST-REx-ID: 79 |
Arming, S., Bartocci, E., Chatterjee, K., Katoen, J. P., & Sokolova, A. (2018). Parameter-independent strategies for pMDPs via POMDPs (Vol. 11024, pp. 53–70). Presented at the QEST: Quantitative Evaluation of Systems, Beijing, China: Springer. https://doi.org/10.1007/978-3-319-99154-2_4
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2017 | Journal Article | IST-REx-ID: 10418 |
Mciver, A., Morgan, C., Kaminski, B. L., & Katoen, J. P. (2017). A new proof rule for almost-sure termination. Proceedings of the ACM on Programming Languages. Los Angeles, CA, United States: Association for Computing Machinery. https://doi.org/10.1145/3158121
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
4 Publications
2023 | Journal Article | IST-REx-ID: 12738 |
Chatterjee, K., Katoen, J. P., Mohr, S., Weininger, M., & Winkler, T. (2023). Stochastic games with lexicographic objectives. Formal Methods in System Design. Springer Nature. https://doi.org/10.1007/s10703-023-00411-4
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
| WoS
2020 | Conference Paper | IST-REx-ID: 8272 |
Chatterjee, K., Katoen, J. P., Weininger, M., & Winkler, T. (2020). Stochastic games with lexicographic reachability-safety objectives. In International Conference on Computer Aided Verification (Vol. 12225, pp. 398–420). Springer Nature. https://doi.org/10.1007/978-3-030-53291-8_21
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2018 | Conference Paper | IST-REx-ID: 79 |
Arming, S., Bartocci, E., Chatterjee, K., Katoen, J. P., & Sokolova, A. (2018). Parameter-independent strategies for pMDPs via POMDPs (Vol. 11024, pp. 53–70). Presented at the QEST: Quantitative Evaluation of Systems, Beijing, China: Springer. https://doi.org/10.1007/978-3-319-99154-2_4
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2017 | Journal Article | IST-REx-ID: 10418 |
Mciver, A., Morgan, C., Kaminski, B. L., & Katoen, J. P. (2017). A new proof rule for almost-sure termination. Proceedings of the ACM on Programming Languages. Los Angeles, CA, United States: Association for Computing Machinery. https://doi.org/10.1145/3158121
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv