K. Chatterjee, E. Kafshdar Goharshady, P. Novotný, J. Zárevúcky, and D. Zikelic, “On lexicographic proof rules for probabilistic termination,” Formal Aspects of Computing, vol. 35, no. 2. Association for Computing Machinery, 2023.
LibreCat: https://research-explorer.ista.ac.at/record/14778
DOI: 10.1145/3585391
arXiv: 2108.02188

K. Chatterjee, E. K. Goharshady, P. Novotný, and D. Zikelic, “Proving non-termination by program reversal,” in Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Online, 2021, pp. 1033–1048.
LibreCat: https://research-explorer.ista.ac.at/record/9644
DOI: 10.1145/3453483.3454093
WoS: 000723661700067
arXiv: 2104.01189

K. Chatterjee, A. K. Goharshady, P. Novotný, and D. Zikelic, “RevTerm.” Association for Computing Machinery, 2021.
LibreCat: https://research-explorer.ista.ac.at/record/15284
DOI: 10.1145/3410304

K. Chatterjee, E. K. Goharshady, P. Novotný, J. Zárevúcky, and D. Zikelic, “On lexicographic proof rules for probabilistic termination,” in 24th International Symposium on Formal Methods, Virtual, 2021, vol. 13047, pp. 619–639.
LibreCat: https://research-explorer.ista.ac.at/record/10414
DOI: 10.1007/978-3-030-90870-6_33
WoS: 000758218600033
arXiv: 2108.02188

K. Chatterjee, M. Chmelik, D. Karkhanis, P. Novotný, and A. Royer, “Multiple-environment Markov decision processes: Efficient analysis and applications,” in Proceedings of the 30th International Conference on Automated Planning and Scheduling, Nancy, France, 2020, vol. 30, pp. 48–56.
LibreCat: https://research-explorer.ista.ac.at/record/8193

T. Brázdil, K. Chatterjee, A. Kucera, P. Novotný, and D. Velan, “Deciding fast termination for probabilistic VASS with nondeterminism,” in International Symposium on Automated Technology for Verification and Analysis, Taipei, Taiwan, 2019, vol. 11781, pp. 462–478.
LibreCat: https://research-explorer.ista.ac.at/record/7183
DOI: 10.1007/978-3-030-31784-3_27
WoS: 000723515700027
arXiv: 1907.11010

S. Agrawal, K. Chatterjee, and P. Novotný, “Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs,” presented at the POPL: Principles of Programming Languages, Los Angeles, CA, USA, 2018, vol. 2, no. POPL.
LibreCat: https://research-explorer.ista.ac.at/record/325
DOI: 10.1145/3158122
arXiv: 1709.04037

T. Brázdil, K. Chatterjee, A. Kudera, P. Novotný, D. Velan, and F. Zuleger, “Efficient algorithms for asymptotic bounds on termination time in VASS,” presented at the LICS: Logic in Computer Science, Oxford, United Kingdom, 2018, vol. 8033, pp. 185–194.
LibreCat: https://research-explorer.ista.ac.at/record/143
DOI: 10.1145/3209108.3209191
WoS: 000545262800020

K. Chatterjee, H. Fu, P. Novotný, and R. Hasheminezhad, “Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs,” ACM Transactions on Programming Languages and Systems, vol. 40, no. 2. Association for Computing Machinery (ACM), 2018.
LibreCat: https://research-explorer.ista.ac.at/record/5993
DOI: 10.1145/3174800
WoS: 000434634500003
arXiv: 1510.08517

K. Chatterjee, A. Elgyütt, P. Novotný, and O. Rouillé, “Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives,” presented at the IJCAI: International Joint Conference on Artificial Intelligence, Stockholm, Sweden, 2018, vol. 2018, pp. 4692–4699.
LibreCat: https://research-explorer.ista.ac.at/record/24
DOI: 10.24963/ijcai.2018/652
WoS: 000764175404117
arXiv: 1804.10601

K. Chatterjee, P. Novotný, G. Pérez, J. Raskin, and D. Zikelic, “Optimizing expectation with guarantees in POMDPs,” in Proceedings of the 31st AAAI Conference on Artificial Intelligence, San Francisco, CA, United States, 2017, vol. 5, pp. 3725–3732.
LibreCat: https://research-explorer.ista.ac.at/record/1009
WoS: 000485630703107

K. Chatterjee, P. Novotný, and D. Zikelic, “Stochastic invariants for probabilistic termination,” presented at the POPL: Principles of Programming Languages, Paris, France, 2017, vol. 52, no. 1, pp. 145–160.
LibreCat: https://research-explorer.ista.ac.at/record/1194
DOI: 10.1145/3009837.3009873
WoS: 000408311200013

T. Brázdil, V. Forejt, A. Kudera, and P. Novotný, “Stability in graphs and games,” presented at the CONCUR: Concurrency Theory, Quebec City, Canada, 2016, vol. 59.
LibreCat: https://research-explorer.ista.ac.at/record/1325
DOI: 10.4230/LIPIcs.CONCUR.2016.10

T. Brázdil, K. Chatterjee, M. Chmelik, A. Gupta, and P. Novotný, “Stochastic shortest path with energy constraints in POMDPs,” in Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems, Singapore, 2016, pp. 1465–1466.
LibreCat: https://research-explorer.ista.ac.at/record/1327

T. Brázdil, A. Kudera, and P. Novotný, “Optimizing the expected mean payoff in Energy Markov Decision Processes,” presented at the ATVA: Automated Technology for Verification and Analysis, Chiba, Japan, 2016, vol. 9938, pp. 32–49.
LibreCat: https://research-explorer.ista.ac.at/record/1326
DOI: 10.1007/978-3-319-46520-3_3

K. Chatterjee, H. Fu, P. Novotný, and R. Hasheminezhad, “Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs,” presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA, 2016, vol. 20–22, pp. 327–342.
LibreCat: https://research-explorer.ista.ac.at/record/1438
DOI: 10.1145/2837614.2837639
arXiv: 1510.08517

T. Brázdil, S. Kiefer, A. Kudera, and P. Novotný, “Long-run average behaviour of probabilistic vector addition systems,” presented at the LICS: Logic in Computer Science, Kyoto, Japan, 2015, pp. 44–55.
LibreCat: https://research-explorer.ista.ac.at/record/1660
DOI: 10.1109/LICS.2015.15

T. Brázdil, L. Korendiak, J. Krdál, P. Novotný, and V. ehák, “Optimizing performance of continuous-time stochastic systems using timeout synthesis,” vol. 9259. Springer, pp. 141–159, 2015.
LibreCat: https://research-explorer.ista.ac.at/record/1667
DOI: 10.1007/978-3-319-22264-6_10

B. Brázdil, K. Chatterjee, A. Kudera, and P. Novotný, “Efficient controller synthesis for consumption games with multiple resource types,” presented at the CAV: Computer Aided Verification, Berkeley, CA, USA, 2012, vol. 7358, pp. 23–38.
LibreCat: https://research-explorer.ista.ac.at/record/3135
DOI: 10.1007/978-3-642-31424-7_8