Životopis

Curriculum Vitae

Personal

• Petr Novotný
• My full academic CV and other information can be found on my personal webpage https://www.fi.muni.cz/~xnovot18/

Workplace

• Department of Computer Science, Faculty of Informatics, Masaryk University

Position

• Assistant professor (since 2018)

Education

• 2015: Ph.D. in Computer Science, Faculty of Informatics, Masaryk University, thesis:"Controller Synthesis for Resource-Aware Systems"
• 2013: state doctoral exam in Informatics (topics: Randomized Algorithms, Stochastic Processes, Security and Cryptographic Protocols)
• 2010: Mgr. (master's degree) in Mathematics, Faculty of Science, Masaryk University, thesis: "Algebraic Methods for CSP" (in Czech)
• 2009: Bc. (bachelor's degree) in Informatics, Faculty of Informatics, Masaryk University, thesis: "TeX Macros for Typesetting LR(0) Syntactic Analysers" (in Czech)
• 2008: Bc. (bachelor's degree) in Mathematics, Faculty of Science, Masaryk University, thesis: "Universal Algebra and CSP" (in Czech)

Previous Employment

• 2015-2018: Postdoc at the Institute of Science and Technology (IST) Austria

Teaching Activities

• Foundations of informatics (spring 2020 - now) - lecturer
• Introduction to PhD Study (2018 - now) - lecturer
• Mathematical Foundations of Computer Science (fall 2018 - now) - seminar tutor
• Computability and Complexity (fall 2018 - now) - seminar tutor
• Algorithms and Data Structures I (spring 2019 - spring 2020) - seminar tutor
• Selected Topics in Automata Theory (spring 2012) - individual teaching at the Support Centre for Students with Special Needs
• Mathematical Logic (fall 2011 - fall 2013) - seminar tutor
• Math Foundations (spring 2010) - seminar tutor
• Graph Algorithms (fall 2009) - seminar tutor
• Mathematics I (fall 2008, fall 2009) - seminar tutor
• Automata and Grammars (fall 2008 - fall 2011) - seminar tutor
• Mathematics II (spring 2009) - seminar tutor

Research interests, Projects, Funding

• 2019-2021: Principal investigator of the Czech Science Foundation Junior Grant "Verification and Analysis of Probabilistic Programs"
• 2015-2017: ISTFellow, a competitive fellowship for independent research work at IST Austria (co-funded by EU Marie Sklodowska-Curie programme)
• Research interests: Analysis of probabilistic programs, application of formal methods in AI, theoretical foundations of probabilistic verification.

Academic Stays

• 2019: one-week stay at the Department of Computer Science, University of Oxford, UK.
• 2018: one-week stay at the Department of Aerospace Engineering and Engineering
• Mechanics, University of Texas at Austin, USA.
• 2017: one-week stay at the Department of Computer Science, University of Oxford, UK.
• 2016: one-week stay at the Department of Computer Science, University of Oxford, UK.
• 2014: one-week research stay at the Department of Computer Science, University of Oxford, UK
• 2014: one-week research stay at the Institute of Science and Technology, Klosterneuburg, Austria
• 2013: Summer School Marktoberdorf 2013 on Software Systems Safety, Marktoberdorf, Germany (2 weeks)
• 2013: one-week research stay at the Department of Computer Science, University of Oxford, Oxford, UK
• 2013: GAMES Winter School 2013, Champéry, Switzerland
• 2012: one-week research stay at the Department of Computer Science, University of Oxford, Oxford, UK
• 2012: one-week research stay at the Institute of Science and Technology, Klosterneuburg, Austria
• 2012: 13th Max Planck Advanced Course on the Foundations of Computer Science (ADFOCS 2012),
  Max Planck Institute for Informatics, Saarbrűcken, Germany (one week)
• 2012: ARiSE/VCLA Winter School on Verification, Technische Universität Wien, Vienna, Austria (one week)
• 2011: one-week research stay at the Institute of Science and Technology, Klosterneuburg, Austria

University Activities

• 2019: co-organizer and evaluation member for the Czech-Slovak student research competition in math and CS.

Activities Outside University

• PC membership: AAMAS'20, DARS'17 (a CAV workshop), ECAI'16

Awards Related to Science and Research

• 2020: Rector's prize for young researchers under 35
• 2010: Dean's prize (Faculty of Science)
• 2009: Dean's prize (Faculty of Informatics)

Selected Publications

• BRÁZDIL, Tomáš, Krishnendu CHATTERJEE, Petr NOVOTNÝ a Jiří VAHALA. Reinforcement Learning of Risk-Constrained Policies in Markov Decision Processes. In The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020. Palo Alto, California, USA: AAAI Press. s. 9794-9801. ISBN 978-1-57735-823-7. doi:10.1609/aaai.v34i06.6531. 2020. URL info
• CHATTERJEE, Krishnendu, Martin CHMELÍK, Deep KARKHANIS, Petr NOVOTNÝ a Amélie ROYER. Multiple-Environment Markov Decision Processes: Efficient Analysis and Applications. In Proceedings of the International Conference on Automated Planning and Scheduling. Palo Alto: AAAI Press. s. 48-56. ISBN 978-1-57735-824-4. 2020. URL info
• BLAHOUDEK, František, Tomáš BRÁZDIL, Petr NOVOTNÝ, Melkior ORNIK, Pranay THANGEDA a Ufuk TOPCU. Qualitative Controller Synthesis for Consumption Markov Decision Processes. In Computer Aided Verification - 32nd International Conference, CAV 2020, Los Angeles, CA, USA, July 21-24, 2020, Proceedings, Part {II}. Cham: Springer. s. 421-447. ISBN 978-3-030-53290-1. doi:10.1007/978-3-030-53291-8_22. 2020. info
• CHATTERJEE, Krishnendu, Hongfei FU a Petr NOVOTNÝ. Termination Analysis of Probabilistic Programs with Martingales. In Gilles Barthe, Joost-Pieter Katoen, Alexandra Silva. Foundations of Probabilistic Programming. Cambridge, UK: Cambridge University Press. s. 221-258. ISBN 978-1-108-48851-8. doi:10.1017/9781108770750.008. 2020. info
• BALAJI, Nikhil, Stefan KIEFER, Petr NOVOTNÝ, Guillermo A. PÉREZ a Mahsa SHIRMOHAMMADI. On the Complexity of Value Iteration. In Christel Baier, Ioannis Chatzigiannakis, Paola Flocchini, Stefano Leonardi. Proceedings of the 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. s. "102:1"-"102:15", 15 s. ISBN 978-3-95977-109-2. doi:10.4230/LIPIcs.ICALP.2019.102. 2019. info
• AVNI, Guy, Thomas A. HENZINGER, Rasmus IBSEN-JENSEN a Petr NOVOTNÝ. Bidding Games on Markov Decision Processes. In Emmanuel Filiot, Raphaël M. Jungers, Igor Potapov. Reachability Problems - 13th International Conference, RP 2019, Brussels, Belgium, September 11-13, 2019, Proceedings. Cham: Springer. s. 1-12. ISBN 978-3-030-30805-6. doi:10.1007/978-3-030-30806-3_1. 2019. URL info
• BRÁZDIL, Tomáš, Krishnendu CHATTERJEE, Antonín KUČERA, Petr NOVOTNÝ, Dominik VELAN a Florian ZULEGER. Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS. In Anuj Dawar, Erich Gradel. 2018 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). Oxford, England: ACM. s. 185-194. ISBN 978-1-4503-5583-4. doi:10.1145/3209108.3209191. 2018. ACM Digital Library info
• AGRAWAL, Sheshansh, Krishnendu CHATTERJEE a Petr NOVOTNÝ. Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs. In PACMPL (Proceedings of POPL'18). New York, NY, USA: ACM. s. "34:1--34:32", 32 s. ISSN 2475-1421. 2018. info
• CHATTERJEE, Krishnendu, Adrián ELGYUTT, Petr NOVOTNÝ a Owen ROUILLÉ. Expectation Optimization with Probabilistic Guarantees in POMDPs with Discounted-Sum Objectives. In Jerome Lang. Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (IJCAI 2018). ijcai.org. s. 4692--4699, 7 s. ISBN 978-0-9992411-2-7. doi:10.24963/ijcai.2018/652. 2018. info
• CHATTERJEE, Krishnendu, Petr NOVOTNÝ a Djordje ŽIKELIĆ. Stochastic Invariants for Probabilistic Termination. In Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages (POPL). New York, NY, USA: ACM. s. 145-160. ISSN 0362-1340. doi:10.1145/3009837.3009873. 2017. info
• CHATTERJEE, Krishnendu, Petr NOVOTNÝ, Guillermo A. PÉREZ, Jean-Francois RASKIN a Djordje ŽIKELIĆ. Optimizing Expectation with Guarantees in POMDPs. In Satinder P. Singh and Shaul Markovitch. Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence (AAAI). AAAI Press. s. 3725--3732. 2017. URL info
• CHATTERJEE, Krishnendu, Hongfei FU, Petr NOVOTNÝ a Rouzbeh HASHEMINEZHAD. Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs. In Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL). New York, NY, USA: ACM. s. 327--342. ISBN 978-1-4503-3549-2. doi:10.1145/2914770.2837639. 2016. URL info
• BRÁZDIL, Tomáš, Stefan KIEFER, Antonín KUČERA a Petr NOVOTNÝ. Long-Run Average Behaviour of Probabilistic Vector Addition Systems. In Neuveden. 30th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2015, Kyoto, Japan, July 6-10, 2015. Neuveden: IEEE. s. 44-55. ISBN 978-1-4799-8875-4. doi:10.1109/LICS.2015.15. 2015. info
• BRÁZDIL, Tomáš, David KLAŠKA, Antonín KUČERA a Petr NOVOTNÝ. Minimizing Running Costs in Consumption Systems. In Armin Biere, Roderick Bloem. Computer Aided Verification. Neuveden: Springer International Publishing. s. 457-472. ISBN 978-3-319-08866-2. doi:10.1007/978-3-319-08867-9_30. 2014. URL info
• BRÁZDIL, Tomáš, Stefan KIEFER, Antonín KUČERA, Petr NOVOTNÝ a Joost-Pieter KATOEN. Zero-reachability in probabilistic multi-counter automata. In Thomas Henzinger and Dale Miller. Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). New York: ACM. s. nestránkováno, 10 s. ISBN 978-1-4503-2886-9. doi:10.1145/2603088.2603161. 2014. URL info
• BRÁZDIL, Tomáš, Krishnendu CHATTERJEE, Antonín KUČERA a Petr NOVOTNÝ. Efficient Controller Synthesis for Consumption Games with Multiple Resource Types. In Computer Aided Verification - 24th International Conference, CAV 2012. Berlin: Springer. s. 23-38. ISBN 978-3-642-31423-0. doi:10.1007/978-3-642-31424-7_8. 2012. info

2021/03/30