Chatterjee, K., Kafshdar Goharshady, E., Novotný, P., Zárevúcky, J., &; Zikelic, D. (2023). On lexicographic proof rules for probabilistic termination. Formal Aspects of Computing. Association for Computing Machinery.https://doi.org/10.1145/3585391 

Chatterjee, K., Goharshady, E. K., Novotný, P., Zárevúcky, J., &; Zikelic, D. (2021). On lexicographic proof rules for probabilistic termination. In 24th International Symposium on Formal Methods (Vol. 13047, pp. 619–639). Virtual: Springer Nature.https://doi.org/10.1007/978-3-030-90870-6_33 

Chatterjee, K., Goharshady, E. K., Novotný, P., &; Zikelic, D. (2021). Proving non-termination by program reversal. In Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation (pp. 1033–1048). Online: Association for Computing Machinery.https://doi.org/10.1145/3453483.3454093 

Chatterjee, K., Goharshady, A. K., Novotný, P., &; Zikelic, D. (2021). RevTerm. Association for Computing Machinery.https://doi.org/10.1145/3410304 

Chatterjee, K., Chmelik, M., Karkhanis, D., Novotný, P., &; Royer, A. (2020). Multiple-environment Markov decision processes: Efficient analysis and applications. In Proceedings of the 30th International Conference on Automated Planning and Scheduling (Vol. 30, pp. 48–56). Nancy, France: Association for the Advancement of Artificial Intelligence.

Brázdil, T., Chatterjee, K., Kucera, A., Novotný, P., &; Velan, D. (2019). Deciding fast termination for probabilistic VASS with nondeterminism. In International Symposium on Automated Technology for Verification and Analysis (Vol. 11781, pp. 462–478). Taipei, Taiwan: Springer Nature.https://doi.org/10.1007/978-3-030-31784-3_27 

Agrawal, S., Chatterjee, K., &; Novotný, P. (2018). Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs (Vol. 2). Presented at the POPL: Principles of Programming Languages, Los Angeles, CA, USA: ACM.https://doi.org/10.1145/3158122 

Brázdil, T., Chatterjee, K., Kudera, A., Novotný, P., Velan, D., &; Zuleger, F. (2018). Efficient algorithms for asymptotic bounds on termination time in VASS (Vol. 8033, pp. 185–194). Presented at the LICS: Logic in Computer Science, Oxford, United Kingdom: IEEE.https://doi.org/10.1145/3209108.3209191 

Chatterjee, K., Fu, H., Novotný, P., &; Hasheminezhad, R. (2018). Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. ACM Transactions on Programming Languages and Systems. Association for Computing Machinery (ACM).https://doi.org/10.1145/3174800 

Chatterjee, K., Elgyütt, A., Novotný, P., &; Rouillé, O. (2018). Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives (Vol. 2018, pp. 4692–4699). Presented at the IJCAI: International Joint Conference on Artificial Intelligence, Stockholm, Sweden: IJCAI.https://doi.org/10.24963/ijcai.2018/652 

Chatterjee, K., Novotný, P., Pérez, G., Raskin, J., &; Zikelic, D. (2017). Optimizing expectation with guarantees in POMDPs. In Proceedings of the 31st AAAI Conference on Artificial Intelligence (Vol. 5, pp. 3725–3732). San Francisco, CA, United States: AAAI Press.

Chatterjee, K., Novotný, P., &; Zikelic, D. (2017). Stochastic invariants for probabilistic termination (Vol. 52, pp. 145–160). Presented at the POPL: Principles of Programming Languages, Paris, France: ACM.https://doi.org/10.1145/3009837.3009873 

Brázdil, T., Forejt, V., Kudera, A., &; Novotný, P. (2016). Stability in graphs and games (Vol. 59). Presented at the CONCUR: Concurrency Theory, Quebec City, Canada: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.CONCUR.2016.10 

Brázdil, T., Chatterjee, K., Chmelik, M., Gupta, A., &; Novotný, P. (2016). Stochastic shortest path with energy constraints in POMDPs. In Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems (pp. 1465–1466). Singapore: ACM.

Brázdil, T., Kudera, A., &; Novotný, P. (2016). Optimizing the expected mean payoff in Energy Markov Decision Processes (Vol. 9938, pp. 32–49). Presented at the ATVA: Automated Technology for Verification and Analysis, Chiba, Japan: Springer.https://doi.org/10.1007/978-3-319-46520-3_3 

Chatterjee, K., Fu, H., Novotný, P., &; Hasheminezhad, R. (2016). Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs (Vol. 20–22, pp. 327–342). Presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA: ACM.https://doi.org/10.1145/2837614.2837639 

Brázdil, T., Kiefer, S., Kudera, A., &; Novotný, P. (2015). Long-run average behaviour of probabilistic vector addition systems (pp. 44–55). Presented at the LICS: Logic in Computer Science, Kyoto, Japan: IEEE.https://doi.org/10.1109/LICS.2015.15 

Brázdil, T., Korendiak, L., Krdál, J., Novotný, P., &; ehák, V. (2015). Optimizing performance of continuous-time stochastic systems using timeout synthesis. Presented at the QEST: Quantitative Evaluation of Systems, Madrid, Spain: Springer.https://doi.org/10.1007/978-3-319-22264-6_10 

Brázdil, B., Chatterjee, K., Kudera, A., &; Novotný, P. (2012). Efficient controller synthesis for consumption games with multiple resource types (Vol. 7358, pp. 23–38). Presented at the CAV: Computer Aided Verification, Berkeley, CA, USA: Springer.https://doi.org/10.1007/978-3-642-31424-7_8