Petr Novotny

Chatterjee Group

19 Publications

Mark all

[19]
2023 | Journal Article | IST-REx-ID: 14778 | OA
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.
[Published Version] View | Files available | DOI | arXiv
 
[18]
2021 | Conference Paper | IST-REx-ID: 10414 | OA
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.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[17]
2021 | Conference Paper | IST-REx-ID: 9644 | OA
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.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[16]
2021 | Research Data Reference | IST-REx-ID: 15284 | OA
K. Chatterjee, A. K. Goharshady, P. Novotný, and D. Zikelic, “RevTerm.” Association for Computing Machinery, 2021.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[15]
2020 | Conference Paper | IST-REx-ID: 8193
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.
View | Files available
 
[14]
2019 | Conference Paper | IST-REx-ID: 7183 | OA
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.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[13]
2018 | Conference Paper | IST-REx-ID: 325 | OA
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.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[12]
2018 | Conference Paper | IST-REx-ID: 143 | OA
T. Brázdil, K. Chatterjee, A. Kučera, 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. F138033, pp. 185–194.
[Preprint] View | DOI | Download Preprint (ext.) | WoS
 
[11]
2018 | Journal Article | IST-REx-ID: 5993 | OA
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.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | WoS | arXiv
 
[10]
2018 | Conference Paper | IST-REx-ID: 24 | OA
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.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[9]
2017 | Conference Paper | IST-REx-ID: 1009 | OA
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.
[Submitted Version] View | Download Submitted Version (ext.) | WoS
 
[8]
2017 | Conference Paper | IST-REx-ID: 1194 | OA
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.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | WoS
 
[7]
2016 | Conference Paper | IST-REx-ID: 1325 | OA
T. Brázdil, V. Forejt, A. Kučera, and P. Novotný, “Stability in graphs and games,” presented at the CONCUR: Concurrency Theory, Quebec City, Canada, 2016, vol. 59.
[Published Version] View | Files available | DOI
 
[6]
2016 | Conference Paper | IST-REx-ID: 1327 | OA
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.
[Preprint] View | Download Preprint (ext.)
 
[5]
2016 | Conference Paper | IST-REx-ID: 1326 | OA
T. Brázdil, A. Kučera, 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.
[Preprint] View | DOI | Download Preprint (ext.)
 
[4]
2016 | Conference Paper | IST-REx-ID: 1438 | OA
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.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[3]
2015 | Conference Paper | IST-REx-ID: 1660 | OA
T. Brázdil, S. Kiefer, A. Kučera, 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.
[Preprint] View | DOI | Download Preprint (ext.)
 
[2]
2015 | Conference Paper | IST-REx-ID: 1667 | OA
T. Brázdil, L. Korenčiak, J. Krčál, P. Novotný, and V. Řehák, “Optimizing performance of continuous-time stochastic systems using timeout synthesis,” vol. 9259. Springer, pp. 141–159, 2015.
[Preprint] View | DOI | Download Preprint (ext.)
 
[1]
2012 | Conference Paper | IST-REx-ID: 3135 | OA
B. Brázdil, K. Chatterjee, A. Kučera, 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.
[Preprint] View | DOI | Download Preprint (ext.)
 
Marked Publication(s)

Search

Filter Publications

    • Display / Sort

    Citation Style: IEEE

    Export / Embed

19 Publications

Mark all

[19]
2023 | Journal Article | IST-REx-ID: 14778 | OA
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.
[Published Version] View | Files available | DOI | arXiv
 
[18]
2021 | Conference Paper | IST-REx-ID: 10414 | OA
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.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[17]
2021 | Conference Paper | IST-REx-ID: 9644 | OA
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.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[16]
2021 | Research Data Reference | IST-REx-ID: 15284 | OA
K. Chatterjee, A. K. Goharshady, P. Novotný, and D. Zikelic, “RevTerm.” Association for Computing Machinery, 2021.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[15]
2020 | Conference Paper | IST-REx-ID: 8193
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.
View | Files available
 
[14]
2019 | Conference Paper | IST-REx-ID: 7183 | OA
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.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[13]
2018 | Conference Paper | IST-REx-ID: 325 | OA
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.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[12]
2018 | Conference Paper | IST-REx-ID: 143 | OA
T. Brázdil, K. Chatterjee, A. Kučera, 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. F138033, pp. 185–194.
[Preprint] View | DOI | Download Preprint (ext.) | WoS
 
[11]
2018 | Journal Article | IST-REx-ID: 5993 | OA
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.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | WoS | arXiv
 
[10]
2018 | Conference Paper | IST-REx-ID: 24 | OA
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.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[9]
2017 | Conference Paper | IST-REx-ID: 1009 | OA
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.
[Submitted Version] View | Download Submitted Version (ext.) | WoS
 
[8]
2017 | Conference Paper | IST-REx-ID: 1194 | OA
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.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | WoS
 
[7]
2016 | Conference Paper | IST-REx-ID: 1325 | OA
T. Brázdil, V. Forejt, A. Kučera, and P. Novotný, “Stability in graphs and games,” presented at the CONCUR: Concurrency Theory, Quebec City, Canada, 2016, vol. 59.
[Published Version] View | Files available | DOI
 
[6]
2016 | Conference Paper | IST-REx-ID: 1327 | OA
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.
[Preprint] View | Download Preprint (ext.)
 
[5]
2016 | Conference Paper | IST-REx-ID: 1326 | OA
T. Brázdil, A. Kučera, 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.
[Preprint] View | DOI | Download Preprint (ext.)
 
[4]
2016 | Conference Paper | IST-REx-ID: 1438 | OA
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.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[3]
2015 | Conference Paper | IST-REx-ID: 1660 | OA
T. Brázdil, S. Kiefer, A. Kučera, 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.
[Preprint] View | DOI | Download Preprint (ext.)
 
[2]
2015 | Conference Paper | IST-REx-ID: 1667 | OA
T. Brázdil, L. Korenčiak, J. Krčál, P. Novotný, and V. Řehák, “Optimizing performance of continuous-time stochastic systems using timeout synthesis,” vol. 9259. Springer, pp. 141–159, 2015.
[Preprint] View | DOI | Download Preprint (ext.)
 
[1]
2012 | Conference Paper | IST-REx-ID: 3135 | OA
B. Brázdil, K. Chatterjee, A. Kučera, 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.
[Preprint] View | DOI | Download Preprint (ext.)
 
Marked Publication(s)

Search

Filter Publications

    • Display / Sort

    Citation Style: IEEE

    Export / Embed