Petr Novotny

23 Publications

Mark all

[23]
2025 | Published | Conference Paper | IST-REx-ID: 19744 | OA
Chatterjee, Krishnendu, et al. “Refuting Equivalence in Probabilistic Programs with Conditioning.” 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems, vol. 15697, Springer Nature, 2025, pp. 279–300, doi:10.1007/978-3-031-90653-4_14.
[Published Version] View | Files available | DOI | arXiv
 
[22]
2024 | Published | Conference Paper | IST-REx-ID: 18160 | OA
Chatterjee, Krishnendu, et al. “Solving Long-Run Average Reward Robust MDPs via Stochastic Games.” 33rd International Joint Conference on Artificial Intelligence, International Joint Conferences on Artificial Intelligence, 2024, pp. 6707–15, doi:10.24963/ijcai.2024/741.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[21]
2024 | Published | Journal Article | IST-REx-ID: 17283 | OA
Chatterjee, Krishnendu, et al. “Equivalence and Similarity Refutation for Probabilistic Programs.” Proceedings of the ACM on Programming Languages, vol. 8, 232, Association for Computing Machinery, 2024, doi:10.1145/3656462.
[Published Version] View | Files available | DOI | arXiv
 
[20]
2023 | Published | Journal Article | IST-REx-ID: 14778 | OA
Chatterjee, Krishnendu, et al. “On Lexicographic Proof Rules for Probabilistic Termination.” Formal Aspects of Computing, vol. 35, no. 2, 11, Association for Computing Machinery, 2023, doi:10.1145/3585391.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[19]
2021 | Research Data Reference | IST-REx-ID: 15284 | OA
Chatterjee, Krishnendu, et al. RevTerm. Association for Computing Machinery, 2021, doi:10.1145/3410304.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[18]
2021 | Published | Conference Paper | IST-REx-ID: 9644 | OA
Chatterjee, Krishnendu, et al. “Proving Non-Termination by Program Reversal.” Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2021, pp. 1033–48, doi:10.1145/3453483.3454093.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[17]
2021 | Published | Conference Paper | IST-REx-ID: 10414 | OA
Chatterjee, Krishnendu, et al. “On Lexicographic Proof Rules for Probabilistic Termination.” 24th International Symposium on Formal Methods, vol. 13047, Springer Nature, 2021, pp. 619–39, doi:10.1007/978-3-030-90870-6_33.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[16]
2020 | Published | Conference Paper | IST-REx-ID: 8193
Chatterjee, Krishnendu, et al. “Multiple-Environment Markov Decision Processes: Efficient Analysis and Applications.” Proceedings of the 30th International Conference on Automated Planning and Scheduling, vol. 30, Association for the Advancement of Artificial Intelligence, 2020, pp. 48–56.
View | Files available
 
[15]
2020 | Published | Book Chapter | IST-REx-ID: 19986 | OA
Chatterjee, Krishnendu, et al. “Termination Analysis of Probabilistic Programs with Martingales.” Foundations of Probabilistic Programming, Cambridge University Press, 2020, pp. 221–58, doi:10.1017/9781108770750.008.
[Published Version] View | Files available | DOI
 
[14]
2019 | Published | Conference Paper | IST-REx-ID: 7183 | OA
Brázdil, Tomás, et al. “Deciding Fast Termination for Probabilistic VASS with Nondeterminism.” International Symposium on Automated Technology for Verification and Analysis, vol. 11781, Springer Nature, 2019, pp. 462–78, doi:10.1007/978-3-030-31784-3_27.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[13]
2018 | Published | Conference Paper | IST-REx-ID: 325 | OA
Agrawal, Sheshansh, et al. Lexicographic Ranking Supermartingales: An Efficient Approach to Termination of Probabilistic Programs. Vol. 2, no. POPL, 34, ACM, 2018, doi:10.1145/3158122.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[12]
2018 | Published | Conference Paper | IST-REx-ID: 24 | OA
Chatterjee, Krishnendu, et al. Expectation Optimization with Probabilistic Guarantees in POMDPs with Discounted-Sum Objectives. Vol. 2018, IJCAI, 2018, pp. 4692–99, doi:10.24963/ijcai.2018/652.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[11]
2018 | Published | Journal Article | IST-REx-ID: 5993 | OA
Chatterjee, Krishnendu, et al. “Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs.” ACM Transactions on Programming Languages and Systems, vol. 40, no. 2, 7, Association for Computing Machinery, 2018, doi:10.1145/3174800.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | WoS | arXiv
 
[10]
2018 | Published | Conference Paper | IST-REx-ID: 143 | OA
Brázdil, Tomáš, et al. Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS. Vol. F138033, IEEE, 2018, pp. 185–94, doi:10.1145/3209108.3209191.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[9]
2017 | Published | Conference Paper | IST-REx-ID: 1009 | OA
Chatterjee, Krishnendu, et al. “Optimizing Expectation with Guarantees in POMDPs.” Proceedings of the 31st AAAI Conference on Artificial Intelligence, vol. 5, AAAI Press, 2017, pp. 3725–32.
[Submitted Version] View | Download Submitted Version (ext.) | WoS
 
[8]
2017 | Published | Conference Paper | IST-REx-ID: 1194 | OA
Chatterjee, Krishnendu, et al. Stochastic Invariants for Probabilistic Termination. Vol. 52, no. 1, ACM, 2017, pp. 145–60, doi:10.1145/3009837.3009873.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | WoS | arXiv
 
[7]
2016 | Published | Conference Paper | IST-REx-ID: 1325 | OA
Brázdil, Tomáš, et al. Stability in Graphs and Games. Vol. 59, 10, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:10.4230/LIPIcs.CONCUR.2016.10.
[Published Version] View | Files available | DOI
 
[6]
2016 | Published | Conference Paper | IST-REx-ID: 1438 | OA
Chatterjee, Krishnendu, et al. Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs. Vol. 20–22, ACM, 2016, pp. 327–42, doi:10.1145/2837614.2837639.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[5]
2016 | Published | Conference Paper | IST-REx-ID: 1327 | OA
Brázdil, Tomáš, et al. “Stochastic Shortest Path with Energy Constraints in POMDPs.” Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems, ACM, 2016, pp. 1465–66.
[Preprint] View | Download Preprint (ext.) | arXiv
 
[4]
2016 | Published | Conference Paper | IST-REx-ID: 1326 | OA
Brázdil, Tomáš, et al. Optimizing the Expected Mean Payoff in Energy Markov Decision Processes. Vol. 9938, Springer, 2016, pp. 32–49, doi:10.1007/978-3-319-46520-3_3.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[3]
2015 | Published | Conference Paper | IST-REx-ID: 1660 | OA
Brázdil, Tomáš, et al. Long-Run Average Behaviour of Probabilistic Vector Addition Systems. IEEE, 2015, pp. 44–55, doi:10.1109/LICS.2015.15.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[2]
2015 | Published | Conference Paper | IST-REx-ID: 1667 | OA
Brázdil, Tomáš, et al. Optimizing Performance of Continuous-Time Stochastic Systems Using Timeout Synthesis. Vol. 9259, Springer, 2015, pp. 141–59, doi:10.1007/978-3-319-22264-6_10.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[1]
2012 | Published | Conference Paper | IST-REx-ID: 3135 | OA
Brázdil, Brázdil, et al. Efficient Controller Synthesis for Consumption Games with Multiple Resource Types. Vol. 7358, Springer, 2012, pp. 23–38, doi:10.1007/978-3-642-31424-7_8.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: MLA

Export / Embed

Grants


23 Publications

Mark all

[23]
2025 | Published | Conference Paper | IST-REx-ID: 19744 | OA
Chatterjee, Krishnendu, et al. “Refuting Equivalence in Probabilistic Programs with Conditioning.” 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems, vol. 15697, Springer Nature, 2025, pp. 279–300, doi:10.1007/978-3-031-90653-4_14.
[Published Version] View | Files available | DOI | arXiv
 
[22]
2024 | Published | Conference Paper | IST-REx-ID: 18160 | OA
Chatterjee, Krishnendu, et al. “Solving Long-Run Average Reward Robust MDPs via Stochastic Games.” 33rd International Joint Conference on Artificial Intelligence, International Joint Conferences on Artificial Intelligence, 2024, pp. 6707–15, doi:10.24963/ijcai.2024/741.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[21]
2024 | Published | Journal Article | IST-REx-ID: 17283 | OA
Chatterjee, Krishnendu, et al. “Equivalence and Similarity Refutation for Probabilistic Programs.” Proceedings of the ACM on Programming Languages, vol. 8, 232, Association for Computing Machinery, 2024, doi:10.1145/3656462.
[Published Version] View | Files available | DOI | arXiv
 
[20]
2023 | Published | Journal Article | IST-REx-ID: 14778 | OA
Chatterjee, Krishnendu, et al. “On Lexicographic Proof Rules for Probabilistic Termination.” Formal Aspects of Computing, vol. 35, no. 2, 11, Association for Computing Machinery, 2023, doi:10.1145/3585391.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[19]
2021 | Research Data Reference | IST-REx-ID: 15284 | OA
Chatterjee, Krishnendu, et al. RevTerm. Association for Computing Machinery, 2021, doi:10.1145/3410304.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[18]
2021 | Published | Conference Paper | IST-REx-ID: 9644 | OA
Chatterjee, Krishnendu, et al. “Proving Non-Termination by Program Reversal.” Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2021, pp. 1033–48, doi:10.1145/3453483.3454093.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[17]
2021 | Published | Conference Paper | IST-REx-ID: 10414 | OA
Chatterjee, Krishnendu, et al. “On Lexicographic Proof Rules for Probabilistic Termination.” 24th International Symposium on Formal Methods, vol. 13047, Springer Nature, 2021, pp. 619–39, doi:10.1007/978-3-030-90870-6_33.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[16]
2020 | Published | Conference Paper | IST-REx-ID: 8193
Chatterjee, Krishnendu, et al. “Multiple-Environment Markov Decision Processes: Efficient Analysis and Applications.” Proceedings of the 30th International Conference on Automated Planning and Scheduling, vol. 30, Association for the Advancement of Artificial Intelligence, 2020, pp. 48–56.
View | Files available
 
[15]
2020 | Published | Book Chapter | IST-REx-ID: 19986 | OA
Chatterjee, Krishnendu, et al. “Termination Analysis of Probabilistic Programs with Martingales.” Foundations of Probabilistic Programming, Cambridge University Press, 2020, pp. 221–58, doi:10.1017/9781108770750.008.
[Published Version] View | Files available | DOI
 
[14]
2019 | Published | Conference Paper | IST-REx-ID: 7183 | OA
Brázdil, Tomás, et al. “Deciding Fast Termination for Probabilistic VASS with Nondeterminism.” International Symposium on Automated Technology for Verification and Analysis, vol. 11781, Springer Nature, 2019, pp. 462–78, doi:10.1007/978-3-030-31784-3_27.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[13]
2018 | Published | Conference Paper | IST-REx-ID: 325 | OA
Agrawal, Sheshansh, et al. Lexicographic Ranking Supermartingales: An Efficient Approach to Termination of Probabilistic Programs. Vol. 2, no. POPL, 34, ACM, 2018, doi:10.1145/3158122.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[12]
2018 | Published | Conference Paper | IST-REx-ID: 24 | OA
Chatterjee, Krishnendu, et al. Expectation Optimization with Probabilistic Guarantees in POMDPs with Discounted-Sum Objectives. Vol. 2018, IJCAI, 2018, pp. 4692–99, doi:10.24963/ijcai.2018/652.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[11]
2018 | Published | Journal Article | IST-REx-ID: 5993 | OA
Chatterjee, Krishnendu, et al. “Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs.” ACM Transactions on Programming Languages and Systems, vol. 40, no. 2, 7, Association for Computing Machinery, 2018, doi:10.1145/3174800.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | WoS | arXiv
 
[10]
2018 | Published | Conference Paper | IST-REx-ID: 143 | OA
Brázdil, Tomáš, et al. Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS. Vol. F138033, IEEE, 2018, pp. 185–94, doi:10.1145/3209108.3209191.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[9]
2017 | Published | Conference Paper | IST-REx-ID: 1009 | OA
Chatterjee, Krishnendu, et al. “Optimizing Expectation with Guarantees in POMDPs.” Proceedings of the 31st AAAI Conference on Artificial Intelligence, vol. 5, AAAI Press, 2017, pp. 3725–32.
[Submitted Version] View | Download Submitted Version (ext.) | WoS
 
[8]
2017 | Published | Conference Paper | IST-REx-ID: 1194 | OA
Chatterjee, Krishnendu, et al. Stochastic Invariants for Probabilistic Termination. Vol. 52, no. 1, ACM, 2017, pp. 145–60, doi:10.1145/3009837.3009873.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | WoS | arXiv
 
[7]
2016 | Published | Conference Paper | IST-REx-ID: 1325 | OA
Brázdil, Tomáš, et al. Stability in Graphs and Games. Vol. 59, 10, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:10.4230/LIPIcs.CONCUR.2016.10.
[Published Version] View | Files available | DOI
 
[6]
2016 | Published | Conference Paper | IST-REx-ID: 1438 | OA
Chatterjee, Krishnendu, et al. Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs. Vol. 20–22, ACM, 2016, pp. 327–42, doi:10.1145/2837614.2837639.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[5]
2016 | Published | Conference Paper | IST-REx-ID: 1327 | OA
Brázdil, Tomáš, et al. “Stochastic Shortest Path with Energy Constraints in POMDPs.” Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems, ACM, 2016, pp. 1465–66.
[Preprint] View | Download Preprint (ext.) | arXiv
 
[4]
2016 | Published | Conference Paper | IST-REx-ID: 1326 | OA
Brázdil, Tomáš, et al. Optimizing the Expected Mean Payoff in Energy Markov Decision Processes. Vol. 9938, Springer, 2016, pp. 32–49, doi:10.1007/978-3-319-46520-3_3.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[3]
2015 | Published | Conference Paper | IST-REx-ID: 1660 | OA
Brázdil, Tomáš, et al. Long-Run Average Behaviour of Probabilistic Vector Addition Systems. IEEE, 2015, pp. 44–55, doi:10.1109/LICS.2015.15.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[2]
2015 | Published | Conference Paper | IST-REx-ID: 1667 | OA
Brázdil, Tomáš, et al. Optimizing Performance of Continuous-Time Stochastic Systems Using Timeout Synthesis. Vol. 9259, Springer, 2015, pp. 141–59, doi:10.1007/978-3-319-22264-6_10.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[1]
2012 | Published | Conference Paper | IST-REx-ID: 3135 | OA
Brázdil, Brázdil, et al. Efficient Controller Synthesis for Consumption Games with Multiple Resource Types. Vol. 7358, Springer, 2012, pp. 23–38, doi:10.1007/978-3-642-31424-7_8.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: MLA

Export / Embed