Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPetr Novotný 0001
Person information
- affiliation: Masaryk University, Brno, Czechia
- affiliation (former): IST Austria, Austria
Other persons with the same name
- Petr Novotný 0002
![[0000-0001-7910-9954]](https://dblp.org/img/orcid-mark.12x12.png "0000-0001-7910-9954")
— IBM T. J. Watson Research Center, Yorktown Heights, NY, USA (and 1 more) - Petr Novotný 0003 — Charles University in Prague, Czech Republic
- Petr Novotný 0004 — Technical University of Ostrava, Czech Republic
- Petr Novotný 0005 — IDEA-ENVI, Meziříčí, Czech Republic
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j4]Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný, Jiri Zárevúcky, Dorde Zikelic:
On Lexicographic Proof Rules for Probabilistic Termination. Formal Aspects Comput. 35(2): 11:1-11:25 (2023)- [j3]Frantisek Blahoudek, Petr Novotný, Melkior Ornik, Pranay Thangeda, Ufuk Topcu:
Efficient Strategy Synthesis for MDPs With Resource Constraints. IEEE Trans. Autom. Control. 68(8): 4586-4601 (2023) - 2018
- [j2]Sheshansh Agrawal, Krishnendu Chatterjee, Petr Novotný:
Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs. Proc. ACM Program. Lang. 2(POPL): 34:1-34:32 (2018) - [j1]Krishnendu Chatterjee, Hongfei Fu, Petr Novotný, Rouzbeh Hasheminezhad:
Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs. ACM Trans. Program. Lang. Syst. 40(2): 7:1-7:45 (2018)
Conference and Workshop Papers
- 2023
- [c28]Michal Ajdarów, Simon Brlej, Petr Novotný:
Shielding in Resource-Constrained Goal POMDPs. AAAI 2023: 14674-14682 - [c27]David Klaska, Antonín Kucera, Martin Kurecka, Vít Musil, Petr Novotný, Vojtech Rehák:
Synthesizing Resilient Strategies for Infinite-Horizon Objectives in Multi-Agent Systems. IJCAI 2023: 171-179 - 2022
- [c26]Tomás Brázdil, David Klaska, Antonín Kucera, Vít Musil, Petr Novotný, Vojtech Rehák:
On-the-fly adaptation of patrolling strategies in changing environments. UAI 2022: 244-254 - 2021
- [c25]Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný, Jiri Zárevúcky, Dorde Zikelic:
On Lexicographic Proof Rules for Probabilistic Termination. FM 2021: 619-639 - [c24]Frantisek Blahoudek, Murat Cubuktepe, Petr Novotný, Melkior Ornik, Pranay Thangeda, Ufuk Topcu:
Fuel in Markov Decision Processes (FiMDP): A Practical Approach to Consumption. FM 2021: 640-656 - [c23]Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný, Dorde Zikelic:
Proving non-termination by program reversal. PLDI 2021: 1033-1048 - 2020
- [c22]Tomás Brázdil, Krishnendu Chatterjee, Petr Novotný, Jiri Vahala:
Reinforcement Learning of Risk-Constrained Policies in Markov Decision Processes. AAAI 2020: 9794-9801 - [c21]Krishnendu Chatterjee, Martin Chmelík, Deep Karkhanis, Petr Novotný, Amélie Royer:
Multiple-Environment Markov Decision Processes: Efficient Analysis and Applications. ICAPS 2020: 48-56 - [c20]Frantisek Blahoudek, Tomás Brázdil, Petr Novotný, Melkior Ornik, Pranay Thangeda, Ufuk Topcu:
Qualitative Controller Synthesis for Consumption Markov Decision Processes. CAV (2) 2020: 421-447 - 2019
- [c19]Tomás Brázdil, Krishnendu Chatterjee, Antonín Kucera, Petr Novotný, Dominik Velan:
Deciding Fast Termination for Probabilistic VASS with Nondeterminism. ATVA 2019: 462-478 - [c18]Nikhil Balaji, Stefan Kiefer, Petr Novotný, Guillermo A. Pérez, Mahsa Shirmohammadi:
On the Complexity of Value Iteration. ICALP 2019: 102:1-102:15 - [c17]Guy Avni, Thomas A. Henzinger, Rasmus Ibsen-Jensen, Petr Novotný:
Bidding Games on Markov Decision Processes. RP 2019: 1-12 - 2018
- [c16]Krishnendu Chatterjee, Adrián Elgyütt, Petr Novotný, Owen Rouillé:
Expectation Optimization with Probabilistic Guarantees in POMDPs with Discounted-Sum Objectives. IJCAI 2018: 4692-4699 - [c15]Tomás Brázdil, Krishnendu Chatterjee, Antonín Kucera, Petr Novotný, Dominik Velan, Florian Zuleger:
Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS. LICS 2018: 185-194 - 2017
- [c14]Krishnendu Chatterjee, Petr Novotný, Guillermo A. Pérez, Jean-François Raskin, Dorde Zikelic:
Optimizing Expectation with Guarantees in POMDPs. AAAI 2017: 3725-3732 - [c13]Krishnendu Chatterjee, Petr Novotný, Dorde Zikelic:
Stochastic invariants for probabilistic termination. POPL 2017: 145-160 - 2016
- [c12]Tomás Brázdil, Krishnendu Chatterjee, Martin Chmelik, Anchit Gupta, Petr Novotný:
Stochastic Shortest Path with Energy Constraints in POMDPs: (Extended Abstract). AAMAS 2016: 1465-1466 - [c11]Tomás Brázdil, Antonín Kucera, Petr Novotný:
Optimizing the Expected Mean Payoff in Energy Markov Decision Processes. ATVA 2016: 32-49 - [c10]Tomás Brázdil, Vojtech Forejt, Antonín Kucera, Petr Novotný:
Stability in Graphs and Games. CONCUR 2016: 10:1-10:14 - [c9]Krishnendu Chatterjee, Hongfei Fu, Petr Novotný, Rouzbeh Hasheminezhad:
Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. POPL 2016: 327-342 - 2015
- [c8]Tomás Brázdil, Stefan Kiefer, Antonín Kucera, Petr Novotný:
Long-Run Average Behaviour of Probabilistic Vector Addition Systems. LICS 2015: 44-55 - [c7]Tomás Brázdil, Lubos Korenciak, Jan Krcál, Petr Novotný, Vojtech Rehák:
Optimizing Performance of Continuous-Time Stochastic Systems Using Timeout Synthesis. QEST 2015: 141-159 - 2014
- [c6]Tomás Brázdil, David Klaska, Antonín Kucera, Petr Novotný:
Minimizing Running Costs in Consumption Systems. CAV 2014: 457-472 - [c5]Tomás Brázdil, Stefan Kiefer, Antonín Kucera, Petr Novotný, Joost-Pieter Katoen:
Zero-reachability in probabilistic multi-counter automata. CSL-LICS 2014: 22:1-22:10 - 2013
- [c4]Tomás Brázdil, Taolue Chen, Vojtech Forejt, Petr Novotný, Aistis Simaitis:
Solvency Markov Decision Processes with Interest. FSTTCS 2013: 487-499 - 2012
- [c3]Tomás Brázdil, Krishnendu Chatterjee, Antonín Kucera, Petr Novotný:
Efficient Controller Synthesis for Consumption Games with Multiple Resource Types. CAV 2012: 23-38 - [c2]Tomás Brázdil, Antonín Kucera, Petr Novotný, Dominik Wojtczak:
Minimizing Expected Termination Time in One-Counter Markov Decision Processes. ICALP (2) 2012: 141-152 - [c1]Tomás Brázdil, Antonín Kucera, Petr Novotný:
Determinacy in Stochastic Games with Unbounded Payoff Functions. MEMICS 2012: 94-105
Informal and Other Publications
- 2024
- [i31]Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný, Dorde Zikelic:
Equivalence and Similarity Refutation for Probabilistic Programs. CoRR abs/2404.03430 (2024) - 2023
- [i30]David Klaska, Antonín Kucera, Martin Kurecka, Vít Musil, Petr Novotný, Vojtech Rehák:
Synthesizing Resilient Strategies for Infinite-Horizon Objectives in Multi-Agent Systems. CoRR abs/2305.10070 (2023) - [i29]Nathanaël Fijalkow, Nathalie Bertrand, Patricia Bouyer-Decitre, Romain Brenguier, Arnaud Carayol, John Fearnley, Hugo Gimbert, Florian Horn, Rasmus Ibsen-Jensen, Nicolas Markey, Benjamin Monmege, Petr Novotný, Mickael Randour, Ocan Sankur, Sylvain Schmitz, Olivier Serre, Mateusz Skomra:
Games on Graphs. CoRR abs/2305.10546 (2023) - [i28]Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Mehrdad Karrabi, Petr Novotný, Dorde Zikelic:
Solving Long-run Average Reward Robust MDPs via Stochastic Games. CoRR abs/2312.13912 (2023) - 2022
- [i27]Tomás Brázdil, David Klaska, Antonín Kucera, Vít Musil, Petr Novotný, Vojtech Rehák:
On-the-fly Adaptation of Patrolling Strategies in Changing Environments. CoRR abs/2206.08096 (2022) - [i26]Michal Ajdarów, Simon Brlej, Petr Novotný:
Shielding in Resource-Constrained Goal POMDPs. CoRR abs/2211.15349 (2022) - 2021
- [i25]Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný, Dorde Zikelic:
Proving Non-termination by Program Reversal. CoRR abs/2104.01189 (2021) - [i24]Frantisek Blahoudek, Petr Novotný, Melkior Ornik, Pranay Thangeda, Ufuk Topcu:
Efficient Strategy Synthesis for MDPs with Resource Constraints. CoRR abs/2105.02099 (2021) - [i23]Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný, Jiri Zárevúcky, Dorde Zikelic:
On Lexicographic Proof Rules for Probabilistic Termination. CoRR abs/2108.02188 (2021) - 2020
- [i22]Tomás Brázdil, Krishnendu Chatterjee, Petr Novotný, Jiri Vahala:
Reinforcement Learning of Risk-Constrained Policies in Markov Decision Processes. CoRR abs/2002.12086 (2020) - [i21]Frantisek Blahoudek, Tomás Brázdil, Petr Novotný, Melkior Ornik, Pranay Thangeda, Ufuk Topcu:
Qualitative Controller Synthesis for Consumption Markov Decision Processes. CoRR abs/2005.07227 (2020) - 2019
- [i20]Tomás Brázdil, Krishnendu Chatterjee, Antonín Kucera, Petr Novotný, Dominik Velan:
Deciding Fast Termination for Probabilistic VASS with Nondeterminism. CoRR abs/1907.11010 (2019) - 2018
- [i19]Krishnendu Chatterjee, Adrián Elgyütt, Petr Novotný, Owen Rouillé:
Expectation Optimization with Probabilistic Guarantees in POMDPs with Discounted-sum Objectives. CoRR abs/1804.10601 (2018) - [i18]Tomás Brázdil, Krishnendu Chatterjee, Antonín Kucera, Petr Novotný, Dominik Velan, Florian Zuleger:
Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS. CoRR abs/1804.10985 (2018) - [i17]Nikhil Balaji, Stefan Kiefer, Petr Novotný, Guillermo A. Pérez, Mahsa Shirmohammadi:
On the Complexity of Iterative Tropical Computation with Applications to Markov Decision Processes. CoRR abs/1807.04920 (2018) - 2017
- [i16]Tomás Brázdil, Krishnendu Chatterjee, Antonín Kucera, Petr Novotný, Dominik Velan:
Efficient Algorithms for Checking Fast Termination in VASS. CoRR abs/1708.09253 (2017) - [i15]Sheshansh Agrawal, Krishnendu Chatterjee, Petr Novotný:
Lexicographic Ranking Supermartingales: An Efficient Approach to Termination of Probabilistic Programs. CoRR abs/1709.04037 (2017) - 2016
- [i14]Tomás Brázdil, Krishnendu Chatterjee, Martin Chmelik, Anchit Gupta, Petr Novotný:
Stochastic Shortest Path with Energy Constraints in POMDPs. CoRR abs/1602.07565 (2016) - [i13]Tomás Brázdil, Vojtech Forejt, Antonín Kucera, Petr Novotný:
Stability in Graphs and Games. CoRR abs/1604.06386 (2016) - [i12]Tomás Brázdil, Antonín Kucera, Petr Novotný:
Optimizing the Expected Mean Payoff in Energy Markov Decision Processes. CoRR abs/1607.00678 (2016) - [i11]Krishnendu Chatterjee, Petr Novotný, Dorde Zikelic:
Stochastic Invariants for Probabilistic Termination. CoRR abs/1611.01063 (2016) - [i10]Krishnendu Chatterjee, Petr Novotný, Guillermo A. Pérez, Jean-François Raskin, Dorde Zikelic:
Optimizing Expectation with Guarantees in POMDPs (Technical Report). CoRR abs/1611.08696 (2016) - 2015
- [i9]Tomás Brázdil, Stefan Kiefer, Antonín Kucera, Petr Novotný:
Long-Run Average Behaviour of Probabilistic Vector Addition Systems. CoRR abs/1505.02655 (2015) - [i8]Krishnendu Chatterjee, Hongfei Fu, Petr Novotný, Rouzbeh Hasheminezhad:
Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs. CoRR abs/1510.08517 (2015) - 2014
- [i7]Tomás Brázdil, Stefan Kiefer, Antonín Kucera, Petr Novotný, Joost-Pieter Katoen:
Zero-Reachability in Probabilistic Multi-Counter Automata. CoRR abs/1401.6840 (2014) - [i6]Tomás Brázdil, David Klaska, Antonín Kucera, Petr Novotný:
Minimizing Running Costs in Consumption Systems. CoRR abs/1402.4995 (2014) - [i5]Tomás Brázdil, Lubos Korenciak, Jan Krcál, Petr Novotný, Vojtech Rehák:
Optimizing Performance of Continuous-Time Stochastic Systems using Timeout Synthesis. CoRR abs/1407.4777 (2014) - 2013
- [i4]Tomás Brázdil, Taolue Chen, Vojtech Forejt, Petr Novotný, Aistis Simaitis:
Solvency Markov Decision Processes with Interest. CoRR abs/1310.3119 (2013) - 2012
- [i3]Tomás Brázdil, Krishnendu Chatterjee, Antonín Kucera, Petr Novotný:
Efficient Controller Synthesis for Consumption Games with Multiple Resource Types. CoRR abs/1202.0796 (2012) - [i2]Tomás Brázdil, Antonín Kucera, Petr Novotný, Dominik Wojtczak:
Minimizing Expected Termination Time in One-Counter Markov Decision Processes. CoRR abs/1205.1473 (2012) - [i1]Tomás Brázdil, Antonín Kucera, Petr Novotný:
Determinacy in Stochastic Games with Unbounded Payoff Functions. CoRR abs/1208.1639 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-14 20:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
