RNDr. Petr Novotný

Personal photo

 

Person-Related Identification Information
  • Petr Novotný, born April 15, 1986 in Brno, Czechoslovakia (now Czech Republic)
Education and Academic Qualifications
  • 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)
Teaching Activities
  • MB101 Mathematics I (fall 2008, fall 2009) - seminar tutor
  • MB102 Mathematics II (spring 2009) - seminar tutor
  • IB102 Automata and Grammars (fall 2008, fall 2009, fall 2010, fall 2011) - seminar tutor
  • MA015 Graph Algorithms (fall 2009) - seminar tutor
  • IB112 Math Foundations (spring 2010) - seminar tutor
  • MA007 Mathematical Logic (fall 2011, fall 2012) - seminar tutor
  • IA006 Selected Topics in Automata Theory (spring 2012) - individual teaching at the Support Centre for Students with Special Needs
Internship
  • 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
Awards Related to Science and Research
  • 2010: Dean's prize (Faculty of Science)
  • 2009: Dean's prize (Faculty of Informatics)
Major Publications
  • 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, 2014. s. 457-472, 16 s. ISBN 978-3-319-08866-2. doi:10.1007/978-3-319-08867-9_30. URLinfo
  • 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, 2014. s. nestránkováno, 10 s. ISBN 978-1-4503-2886-9. doi:10.1145/2603088.2603161. URLinfo
  • BRÁZDIL, Tomáš, Antonín KUČERA a Petr NOVOTNÝ. Determinacy in Stochastic Games with Unbounded Payoff Functions. In Mathematical and Engineering Methods in Computer Science (MEMICS 2012). Heidelberg: Springer, 2013. s. 94-105, 12 s. ISBN 978-3-642-36044-2. doi:10.1007/978-3-642-36046-6_10. URLinfo
  • BRÁZDIL, Tomáš, Taolue CHEN, Vojtěch FOREJT, Petr NOVOTNÝ a Aistis SIMAITIS. Solvency Markov Decision Processes with Interest. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013). Dagstuhl, Germany: IBFI Schloss Dagstuhl, 2013. s. 487-499, 13 s. ISBN 978-3-939897-64-4. doi:10.4230/LIPIcs.FSTTCS.2013.487. URLinfo
  • 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, 2012. s. 23-38, 16 s. ISBN 978-3-642-31423-0. doi:10.1007/978-3-642-31424-7_8. info
  • BRÁZDIL, Tomáš, Antonín KUČERA, Petr NOVOTNÝ a Dominik WOJTCZAK. Minimizing Expected Termination Time in One-Counter Markov Decision Processes. In Proceedings of 39th International Colloquium on Automata, Languages and Programming (ICALP 2012). Berlin: Springer, 2012. s. 141-152, 12 s. ISBN 978-3-642-31584-8. doi:10.1007/978-3-642-31585-5_16. info

Last update: 2014/11/20