Petr Novotny

22 Publications

Mark all

[22]
2025 | Published | Conference Paper | IST-REx-ID: 19744 | OA
Chatterjee K, Goharshady E, Novotný P, Zikelic D. 2025. Refuting equivalence in probabilistic programs with conditioning. 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 15697, 279–300.
[Published Version] View | Files available | DOI | arXiv
 
[21]
2024 | Published | Conference Paper | IST-REx-ID: 18160 | OA
Chatterjee K, Goharshady E, Karrabi M, Novotný P, Zikelic D. 2024. Solving long-run average reward robust MDPs via stochastic games. 33rd International Joint Conference on Artificial Intelligence. IJCAI: International Joint Conference on Artificial Intelligence, 6707–6715.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[20]
2024 | Published | Journal Article | IST-REx-ID: 17283 | OA
Chatterjee K, Goharshady E, Novotný P, Zikelic D. 2024. Equivalence and similarity refutation for probabilistic programs. Proceedings of the ACM on Programming Languages. 8, 232.
[Published Version] View | Files available | DOI | arXiv
 
[19]
2023 | Published | Journal Article | IST-REx-ID: 14778 | OA
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. 35(2), 11.
[Published Version] View | Files available | DOI | arXiv
 
[18]
2021 | Research Data Reference | IST-REx-ID: 15284 | OA
Chatterjee K, Goharshady EK, Novotný P, Zikelic D. 2021. RevTerm, Association for Computing Machinery, 10.1145/3410304.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[17]
2021 | Published | Conference Paper | IST-REx-ID: 10414 | OA
Chatterjee K, Goharshady E, Novotný P, Zárevúcky J, Zikelic D. 2021. On lexicographic proof rules for probabilistic termination. 24th International Symposium on Formal Methods. FM: Formal Methods, LNCS, vol. 13047, 619–639.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[16]
2021 | Published | Conference Paper | IST-REx-ID: 9644 | OA
Chatterjee K, Goharshady EK, Novotný P, Zikelic D. 2021. Proving non-termination by program reversal. Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation. PLDI: Programming Language Design and Implementation, 1033–1048.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[15]
2020 | Published | Conference Paper | IST-REx-ID: 8193
Chatterjee K, Chmelik M, Karkhanis D, Novotný P, Royer A. 2020. Multiple-environment Markov decision processes: Efficient analysis and applications. Proceedings of the 30th International Conference on Automated Planning and Scheduling. ICAPS: International Conference on Automated Planning and Scheduling vol. 30, 48–56.
View | Files available
 
[14]
2019 | Published | Conference Paper | IST-REx-ID: 7183 | OA
Brázdil T, Chatterjee K, Kucera A, Novotný P, Velan D. 2019. Deciding fast termination for probabilistic VASS with nondeterminism. International Symposium on Automated Technology for Verification and Analysis. ATVA: Automated TEchnology for Verification and Analysis, LNCS, vol. 11781, 462–478.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[13]
2018 | Published | Conference Paper | IST-REx-ID: 325 | OA
Agrawal S, Chatterjee K, Novotný P. 2018. Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs. POPL: Principles of Programming Languages vol. 2, 34.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[12]
2018 | Published | Conference Paper | IST-REx-ID: 24 | OA
Chatterjee K, Elgyütt A, Novotný P, Rouillé O. 2018. Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives. IJCAI: International Joint Conference on Artificial Intelligence vol. 2018, 4692–4699.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[11]
2018 | Published | Journal Article | IST-REx-ID: 5993 | OA
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. 40(2), 7.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | WoS | arXiv
 
[10]
2018 | Published | Conference Paper | IST-REx-ID: 143 | OA
Brázdil T, Chatterjee K, Kučera A, Novotný P, Velan D, Zuleger F. 2018. Efficient algorithms for asymptotic bounds on termination time in VASS. LICS: Logic in Computer Science, ACM/IEEE Symposium on Logic in Computer Science, vol. F138033, 185–194.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[9]
2017 | Published | Conference Paper | IST-REx-ID: 1009 | OA
Chatterjee K, Novotný P, Pérez G, Raskin J, Zikelic D. 2017. Optimizing expectation with guarantees in POMDPs. Proceedings of the 31st AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 5, 3725–3732.
[Submitted Version] View | Download Submitted Version (ext.) | WoS
 
[8]
2017 | Published | Conference Paper | IST-REx-ID: 1194 | OA
Chatterjee K, Novotný P, Zikelic D. 2017. Stochastic invariants for probabilistic termination. POPL: Principles of Programming Languages, ACM SIGPLAN Notices, vol. 52, 145–160.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | WoS | arXiv
 
[7]
2016 | Published | Conference Paper | IST-REx-ID: 1325 | OA
Brázdil T, Forejt V, Kučera A, Novotný P. 2016. Stability in graphs and games. CONCUR: Concurrency Theory, LIPIcs, vol. 59, 10.
[Published Version] View | Files available | DOI
 
[6]
2016 | Published | Conference Paper | IST-REx-ID: 1438 | OA
Chatterjee K, Fu H, Novotný P, Hasheminezhad R. 2016. Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. POPL: Principles of Programming Languages, POPL, vol. 20–22, 327–342.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[5]
2016 | Published | Conference Paper | IST-REx-ID: 1327 | OA
Brázdil T, Chatterjee K, Chmelik M, Gupta A, Novotný P. 2016. Stochastic shortest path with energy constraints in POMDPs. Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems. AAMAS: Autonomous Agents & Multiagent Systems, 1465–1466.
[Preprint] View | Download Preprint (ext.) | arXiv
 
[4]
2016 | Published | Conference Paper | IST-REx-ID: 1326 | OA
Brázdil T, Kučera A, Novotný P. 2016. Optimizing the expected mean payoff in Energy Markov Decision Processes. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 9938, 32–49.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[3]
2015 | Published | Conference Paper | IST-REx-ID: 1667 | OA
Brázdil T, Korenčiak L, Krčál J, Novotný P, Řehák V. 2015. Optimizing performance of continuous-time stochastic systems using timeout synthesis. 9259, 141–159.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[2]
2015 | Published | Conference Paper | IST-REx-ID: 1660 | OA
Brázdil T, Kiefer S, Kučera A, Novotný P. 2015. Long-run average behaviour of probabilistic vector addition systems. LICS: Logic in Computer Science, LICS, , 44–55.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[1]
2012 | Published | Conference Paper | IST-REx-ID: 3135 | OA
Brázdil B, Chatterjee K, Kučera A, Novotný P. 2012. Efficient controller synthesis for consumption games with multiple resource types. CAV: Computer Aided Verification, LNCS, vol. 7358, 23–38.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: ISTA Annual Report

Export / Embed

Grants


22 Publications

Mark all

[22]
2025 | Published | Conference Paper | IST-REx-ID: 19744 | OA
Chatterjee K, Goharshady E, Novotný P, Zikelic D. 2025. Refuting equivalence in probabilistic programs with conditioning. 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 15697, 279–300.
[Published Version] View | Files available | DOI | arXiv
 
[21]
2024 | Published | Conference Paper | IST-REx-ID: 18160 | OA
Chatterjee K, Goharshady E, Karrabi M, Novotný P, Zikelic D. 2024. Solving long-run average reward robust MDPs via stochastic games. 33rd International Joint Conference on Artificial Intelligence. IJCAI: International Joint Conference on Artificial Intelligence, 6707–6715.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[20]
2024 | Published | Journal Article | IST-REx-ID: 17283 | OA
Chatterjee K, Goharshady E, Novotný P, Zikelic D. 2024. Equivalence and similarity refutation for probabilistic programs. Proceedings of the ACM on Programming Languages. 8, 232.
[Published Version] View | Files available | DOI | arXiv
 
[19]
2023 | Published | Journal Article | IST-REx-ID: 14778 | OA
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. 35(2), 11.
[Published Version] View | Files available | DOI | arXiv
 
[18]
2021 | Research Data Reference | IST-REx-ID: 15284 | OA
Chatterjee K, Goharshady EK, Novotný P, Zikelic D. 2021. RevTerm, Association for Computing Machinery, 10.1145/3410304.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[17]
2021 | Published | Conference Paper | IST-REx-ID: 10414 | OA
Chatterjee K, Goharshady E, Novotný P, Zárevúcky J, Zikelic D. 2021. On lexicographic proof rules for probabilistic termination. 24th International Symposium on Formal Methods. FM: Formal Methods, LNCS, vol. 13047, 619–639.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[16]
2021 | Published | Conference Paper | IST-REx-ID: 9644 | OA
Chatterjee K, Goharshady EK, Novotný P, Zikelic D. 2021. Proving non-termination by program reversal. Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation. PLDI: Programming Language Design and Implementation, 1033–1048.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[15]
2020 | Published | Conference Paper | IST-REx-ID: 8193
Chatterjee K, Chmelik M, Karkhanis D, Novotný P, Royer A. 2020. Multiple-environment Markov decision processes: Efficient analysis and applications. Proceedings of the 30th International Conference on Automated Planning and Scheduling. ICAPS: International Conference on Automated Planning and Scheduling vol. 30, 48–56.
View | Files available
 
[14]
2019 | Published | Conference Paper | IST-REx-ID: 7183 | OA
Brázdil T, Chatterjee K, Kucera A, Novotný P, Velan D. 2019. Deciding fast termination for probabilistic VASS with nondeterminism. International Symposium on Automated Technology for Verification and Analysis. ATVA: Automated TEchnology for Verification and Analysis, LNCS, vol. 11781, 462–478.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[13]
2018 | Published | Conference Paper | IST-REx-ID: 325 | OA
Agrawal S, Chatterjee K, Novotný P. 2018. Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs. POPL: Principles of Programming Languages vol. 2, 34.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[12]
2018 | Published | Conference Paper | IST-REx-ID: 24 | OA
Chatterjee K, Elgyütt A, Novotný P, Rouillé O. 2018. Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives. IJCAI: International Joint Conference on Artificial Intelligence vol. 2018, 4692–4699.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[11]
2018 | Published | Journal Article | IST-REx-ID: 5993 | OA
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. 40(2), 7.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | WoS | arXiv
 
[10]
2018 | Published | Conference Paper | IST-REx-ID: 143 | OA
Brázdil T, Chatterjee K, Kučera A, Novotný P, Velan D, Zuleger F. 2018. Efficient algorithms for asymptotic bounds on termination time in VASS. LICS: Logic in Computer Science, ACM/IEEE Symposium on Logic in Computer Science, vol. F138033, 185–194.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[9]
2017 | Published | Conference Paper | IST-REx-ID: 1009 | OA
Chatterjee K, Novotný P, Pérez G, Raskin J, Zikelic D. 2017. Optimizing expectation with guarantees in POMDPs. Proceedings of the 31st AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 5, 3725–3732.
[Submitted Version] View | Download Submitted Version (ext.) | WoS
 
[8]
2017 | Published | Conference Paper | IST-REx-ID: 1194 | OA
Chatterjee K, Novotný P, Zikelic D. 2017. Stochastic invariants for probabilistic termination. POPL: Principles of Programming Languages, ACM SIGPLAN Notices, vol. 52, 145–160.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | WoS | arXiv
 
[7]
2016 | Published | Conference Paper | IST-REx-ID: 1325 | OA
Brázdil T, Forejt V, Kučera A, Novotný P. 2016. Stability in graphs and games. CONCUR: Concurrency Theory, LIPIcs, vol. 59, 10.
[Published Version] View | Files available | DOI
 
[6]
2016 | Published | Conference Paper | IST-REx-ID: 1438 | OA
Chatterjee K, Fu H, Novotný P, Hasheminezhad R. 2016. Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. POPL: Principles of Programming Languages, POPL, vol. 20–22, 327–342.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[5]
2016 | Published | Conference Paper | IST-REx-ID: 1327 | OA
Brázdil T, Chatterjee K, Chmelik M, Gupta A, Novotný P. 2016. Stochastic shortest path with energy constraints in POMDPs. Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems. AAMAS: Autonomous Agents & Multiagent Systems, 1465–1466.
[Preprint] View | Download Preprint (ext.) | arXiv
 
[4]
2016 | Published | Conference Paper | IST-REx-ID: 1326 | OA
Brázdil T, Kučera A, Novotný P. 2016. Optimizing the expected mean payoff in Energy Markov Decision Processes. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 9938, 32–49.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[3]
2015 | Published | Conference Paper | IST-REx-ID: 1667 | OA
Brázdil T, Korenčiak L, Krčál J, Novotný P, Řehák V. 2015. Optimizing performance of continuous-time stochastic systems using timeout synthesis. 9259, 141–159.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[2]
2015 | Published | Conference Paper | IST-REx-ID: 1660 | OA
Brázdil T, Kiefer S, Kučera A, Novotný P. 2015. Long-run average behaviour of probabilistic vector addition systems. LICS: Logic in Computer Science, LICS, , 44–55.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[1]
2012 | Published | Conference Paper | IST-REx-ID: 3135 | OA
Brázdil B, Chatterjee K, Kučera A, Novotný P. 2012. Efficient controller synthesis for consumption games with multiple resource types. CAV: Computer Aided Verification, LNCS, vol. 7358, 23–38.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: ISTA Annual Report

Export / Embed