prof. RNDr. Antonín Kučera, Ph.D.

Curriculum vitae

Person identification

• Prof. RNDr. Antonin Kucera, Ph.D.
  born Feb. 14, 1971 in Znojmo, Czechoslovakia, married

Workplace

• Institute for Theoretical Computer Science
  Faculty of Informatics
  Masaryk University
  Botanicka 68a
  602 00 Brno
  Czech Republic

Employment Position

• Full Professor

Education and Academic Qualifications

• 2007: Full Professor of Computer Science, Faculty of Informatics, Masaryk University, Brno, Czech Republic. Evaluation board: Jiří Rosický, chair (Masaryk University, Czech Republic), Luboš Brim (Masaryk University, Czech Republic), Petr Hájek (Institute of Computer Science, Academy of Sciences of the Czech Republic), Jaroslav Nešetřil (Charles University, Czech Republic), Pavel Pudlák (Mathematical Institute, Academy of Sciences of the Czech Republic).
• 2000: Associate Professor of Computer Science, Faculty of Informatics, Masaryk University, Brno, Czech Republic. Habilitation Theses: `Deciding Regular Properties in Simple Process Algebras'. Reviewed by Prof. RNDr. Milan Ceska, CSc. (TU Brno, Czech Republic), Prof. Dr. Javier Esparza (TU Munich, Germany), Prof. Colin Stirling (The University of Edinburgh, United Kingdom).
• 1997: PhD in Computer Science, Faculty of Informatics, Masaryk University, Brno, Czech Republic. Theses: `Decidability Issues for Processes with Infinitely Many states'. Supervisor: Doc. RNDr. Mojmir Kretinsky, CSc. Examiners: Prof. Dr. Javier Esparza (TU Munich, Germany), Doc. RNDr. Petr Jancar, CSc (TU Ostrava, Czech Republic).
• 1994: Mgr. (master's degree) in computer science, Faculty of Science, Masaryk University, Brno, Czech Republic. Theses: `Automated Compiler Construction' (in Czech).

Employment Summary

• 2007 - now: Full Professor, Institute for Theoretical Computer Science, Faculty of Informatics, Masaryk University.
• 2005 - 2007: Associate Professor, Institute for Theoretical Computer Science, Faculty of Informatics, Masaryk University.
• 2000 - 2005: Associate Professor, Dept. of Computer Science, Faculty of Informatics, Masaryk University. 1997 - 2000: Professor Assistant, Dept. of Computer Science, Faculty of Informatics, Masaryk University
• 1995 - 1997: Assistant, Dept. of Computer Science, Faculty of Informatics, Masaryk University

Research Interests

• Stochastic processes, effective analysis of probabilistic systems.
• Markov decision processes and stochastic games, strategy synthesis, multi-objective optimization.
• Infinite-state systems and games.
• Applications of game theory in security and operational research.
• The decidability and complexity of equivalence-checking and model-checking over various classes of infinite-state systems.
• Modal and temporal logics.

Academical Stays

• 2017: A six-months research stay at the Faculty of Computer Science, Technische Universität München, Germany.
• 2005: A two-months research stay at the Institute for Formal Methods in Computer Science, University of Stuttgart, Germany.
• 2004: A two-months research stay at the Institute for Formal Methods in Computer Science, University of Stuttgart, Germany.
• 2003: A two-months research stay at the Institute for Formal Methods in Computer Science, University of Stuttgart, Germany.
• 2003: A one-month visiting professorship at the Laboratoire Specification et Verification, Ecole Normale Superieure de Cachan, France.
• 2003: A two-months visiting professorship at the Comp. Sci. Dept., Uppsala University, Sweden.
• 2002: A two-months visiting professorship at the Comp. Sci. Dept., Uppsala University, Sweden.
• 2001: A one-month research stay at the Comp. Sci. Dept., Uppsala University, Sweden. Funded by the Swedish STINT Fellowship Programme.
• 2001: A two-months research stay at the Institute for Informatics, TU-Munich, Germany. Funded by the Alexander von Humboldt Foundation.
• 2001: A one-week stay at the Comp. Sci. Dept., University of Wales Swansea, United Kingdom. Funded by the Swedish STINT Fellowship Programme.
• 2001: A one-week stay at the Comp. Sci. Dept., Uppsala University, Sweden. Funded by the Swedish STINT Fellowship Programme.
• 2000: A three-month stay at the Institute for Informatics, TU-Munich, Germany. Funded by the Alexander von Humboldt Foundation.
• 1999: A one-month research stay at the Computing Science Department, Uppsala University, Sweden. Funded by the Europe Research Fellowship granted by the Alexander von Humboldt Foundation.
• 1998: A twelve-month research stay at the Institut for Informatics, TU-Munich. Funded by the Alexander von Humboldt Foundation.
• 1998: A one-month stay at TU Wien. Funded by the Oesterreiches Ost- und Suedosteuropa-Institut (OSI).
• 1995: A three-month research stay at the University of Aarhus (BRICS), Denmark. Funded by the Danish Ministry of Education.

Academic activities

• 2017: A member of ERC Advanced Grant Panel, Computer science and informatics (PE6).
• 2017 - now: A member of Panel 202 (Computer Science), Czech Science Foundation.
• 2016 - now: Vice Chairman of IFIP WG 2.2.
• 2016 - now: IFIP WG 1.8 Member.
• 2012 - now: Vice President of EATCS.
• 2011 - now: IFIP WG 2.2 Member.
• 2010 - 2013: Scientific Board Member, Faculty of Electrical Engineering and Computer Science, Technical University of Ostrava, Ostrava.
• 2009 - now: A member of EATCS Council.
• 2009 - 2013: A member of panel 202 (Computer Science), Czech Science Foundation.
• 2005 - now: Scientific Board Member, Faculty of Mathematics and Physics, Charles Univeristy, Prague.
• 2004 - now: Scientific Board Member, Faculty of Informatics, Masaryk University, Brno.
• 2011 - 2015: Vice-Dean for Research, Development, and Doctoral Studies, Faculty of Informatics, Masaryk University, Brno.
• 2007 - 2011: Vice-Dean for Research and Development, Faculty of Informatics, Masaryk University, Brno.

Boards and Committees

• Journal Editorial Boards
  2016 - now: Journal of Automata, Languages and Combinatorics.
  2015 - now: Theoretical Computer Science.
  2014 - now: Acta Informatica.
  2010 - now: Fundamenta Informaticae.
  
• Award Committees
  2013: Presburger Award Committee Chair.
  2012: Presburger Award Committee Member.
  2012: 2012 Computer Sciences Prize Joseph Fourier Committee Member.
  2011: Presburger Award Committee Member.
  
• Steering Committees
  MFCS, Mathematical Foundations of Computer Science (chair).
  Sofsem, International Conference on Current Trends in Theory and Practice of Computer Science.
  Infinity, International Workshop on Verification of Infinite-State Systems (chair).
  MEMICS, Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science.

Appreciation of Science Community

• 2016: Friedrich Wilhelm Bessel Research Award.
• 1998: awarded a research fellowship by the Alexander von Humboldt foundation
• 1998: the Talent'97 award, Czech Ministry of Education
• 1997: awarded the annual rector's prize, Masaryk University
• 1994: awarded the annual dean's prize, Faculty of Science, Masaryk University

Selected Publications

• CHODIL, Miroslav a Antonín KUČERA. The satisfiability problem for a quantitative fragment of PCTL. Journal of Computer and System Sciences. SAN DIEGO: Elsevier, 2024, roč. 139, č. 103478, s. 1-16. ISSN 0022-0000. Dostupné z: https://dx.doi.org/10.1016/j.jcss.2023.103478. Elsevier info
• KLAŠKA, David, Antonín KUČERA, Vojtěch KŮR, Vít MUSIL a Vojtěch ŘEHÁK. Optimizing Local Satisfaction of Long-Run Average Objectives in Markov Decision Processes. In Wooldridge M., Dy J., Natarajan S. Proceedings of 38th Annual AAAI Conference on Artificial Intelligence (AAAI 2024). Washington, DC,. Neuveden: AAAI Press, 2024, s. 20143-20150. ISBN 978-1-57735-887-9. Dostupné z: https://dx.doi.org/10.1609/aaai.v38i18.29993. Paper URL info
• KLAŠKA, David, Antonín KUČERA, Martin KUREČKA, Vít MUSIL, Petr NOVOTNÝ a Vojtěch ŘEHÁK. Synthesizing Resilient Strategies for Infinite-Horizon Objectives in Multi-Agent Systems. Online. In Edith Elkind. Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, IJCAI 2023,. Neuveden: International Joint Conferences on Artificial Intelligence, 2023, s. 171-179. ISBN 978-1-956792-03-4. Dostupné z: https://dx.doi.org/10.24963/ijcai.2023/20. Paper URL info
• KLAŠKA, David, Antonín KUČERA, Vít MUSIL a Vojtěch ŘEHÁK. Mean Payoff Optimization for Systems of Periodic Service and Maintenance. Online. In Edith Elkind. Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, IJCAI 2023,. Neuveden: International Joint Conferences on Artificial Intelligence, 2023, s. 5386-5393. ISBN 978-1-956792-03-4. Dostupné z: https://dx.doi.org/10.24963/ijcai.2023/598. Paper URL info
• AJDARÓW, Michal a Antonín KUČERA. Asymptotic Complexity Estimates for Probabilistic Programs and their VASS Abstractions. Online. In Perez, Guillermo A. and Raskin, Jean-Francois. 34th International Conference on Concurrency Theory (CONCUR 2023). Dagstuhl, Germany: Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik, 2023, s. "12:1"-"12:16", 16 s. ISBN 978-3-95977-299-0. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.CONCUR.2023.12. Dagstuhl website info
• KLAŠKA, David, Antonín KUČERA, Vít MUSIL a Vojtěch ŘEHÁK. Minimizing Expected Intrusion Detection Time in Adversarial Patrolling. Online. In Piotr Faliszewski, Viviana Mascardi, Catherine Pelachaud, Matthew E. Taylor. 21st International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2022. Neuveden: International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS), 2022, s. 1660-1662. ISBN 978-1-4503-9213-6. Dostupné z: https://dx.doi.org/10.5555/3535850.3536068. Paper URL info
• KLAŠKA, David, Antonín KUČERA, Vít MUSIL a Vojtěch ŘEHÁK. General Optimization Framework for Recurrent Reachability Objectives. Online. In Luc De Raedt. Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI 2022. Neuveden: ijcai.org, 2022, s. 4642-4648. ISBN 978-1-956792-00-3. Dostupné z: https://dx.doi.org/10.24963/ijcai.2022/644. Paper URL info
• BRÁZDIL, Tomáš, David KLAŠKA, Antonín KUČERA, Vít MUSIL, Petr NOVOTNÝ a Vojtěch ŘEHÁK. On-the-fly Adaptation of Patrolling Strategies in Changing Environments. Online. In James Cussens, Kun Zhang. Proceedings of the Thirty-Eighth Conference on Uncertainty in Artificial Intelligence, UAI 2022. Neuveden: Proceedings of Machine Learning Research, 2022, s. 244-254. ISBN 978-1-7138-6329-8. Paper URL info
• CHODIL, Miroslav, Antonín KUČERA a Jan KŘETÍNSKÝ. Satisfiability of Quantitative Probabilistic CTL: Rise to the Challenge. In Jean-Francois Raskin, Krishnendu Chatterjee, Laurent Doyen, and Rupak Majumdar. Principles of Systems Design - Essays Dedicated to Thomas A. Henzinger on the Occasion of His 60th Birthday. New York, NY, United States: Springer, 2022, s. 364-387. ISBN 978-3-031-22336-5. Dostupné z: https://dx.doi.org/10.1007/978-3-031-22337-2_18. The book URL. info
• CHODIL, Miroslav a Antonín KUČERA. The Satisfiability Problem for a Quantitative Fragment of PCTL. In Evripidis Bampis and Aris Pagourtzis. Fundamentals of Computation Theory. 23rd International Symposium, FCT 2021. Německo: Springer, 2021, s. 149-161. ISBN 978-3-030-86592-4. Dostupné z: https://dx.doi.org/10.1007/978-3-030-86593-1_10. info
• AJDARÓW, Michal a Antonín KUČERA. Deciding Polynomial Termination Complexity for VASS Programs. Online. In Haddad, Serge and Varacca, Daniele. 32nd International Conference on Concurrency Theory (CONCUR 2021). Dagstuhl, Germany: Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik, 2021, s. "30:1"-"30:15", 15 s. ISBN 978-3-95977-203-7. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.CONCUR.2021.30. Dagstuhl website info
• KLAŠKA, David, Antonín KUČERA, Vojtěch ŘEHÁK a Vít MUSIL. Regstar: Efficient Strategy Synthesis for Adversarial Patrolling Games. Online. In de Campos, Cassio and Maathuis, Marloes H. Proceedings of 37th Conference on Uncertainty in Artificial Intelligence (UAI 2021). Neuveden: AUAI Press, 2021, s. 471-481. ISSN 2640-3498. URL info
• KUČERA, Antonín. Algorithmic Analysis of Termination and Counter Complexity in Vector Addition Systems with States: A Survey of Recent Results. ACM SIGLOG News. New York, NY, United States: Association for Computing Machinery, 2021, roč. 8, č. 4, s. 4-21. ISSN 2372-3491. Dostupné z: https://dx.doi.org/10.1145/3527372.3527374. ACM Digital Library info
• KLAŠKA, David, Antonín KUČERA a Vojtěch ŘEHÁK. Adversarial Patrolling with Drones. Online. In Proceedings of the 2020 International Conference on Autonomous Agents & Multiagent Systems. Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems, 2020, s. 629-637. ISBN 978-1-4503-7518-4. Dostupné z: https://dx.doi.org/10.5555/3398761.3398837. info
• KUČERA, Antonín, Jérôme LEROUX a Dominik VELAN. Efficient Analysis of VASS Termination Complexity. Online. In Holger Hermanns, Lijun Zhang, Naoki Kobayashi, Dale Miller. LICS '20: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science. New York, USA: ACM, 2020, s. 676-688. ISBN 978-1-4503-7104-9. Dostupné z: https://dx.doi.org/10.1145/3373718.3394751. info
• BLONDIN, Michael, Javier ESPARZA, Martin HELFRICH, Antonín KUČERA a Philipp MEYER. Checking Qualitative Liveness Properties of Replicated Systems with Stochastic Scheduling. In Shuvendu K. Lahiri, Chao Wang. Computer Aided Verification, CAV 2020. Cham, Německo: Springer International Publishing, 2020, s. 372-397. ISBN 978-3-030-53290-1. Dostupné z: https://dx.doi.org/10.1007/978-3-030-53291-8_20. URL info
• KUČERA, Antonín a Richard MAYR. A generic framework for checking semantic equivalences between pushdown automata and finite-state automata. Journal of Computer and System Sciences. Academic Press, 2018, roč. 91, č. 1, s. 82-103. ISSN 0022-0000. Dostupné z: https://dx.doi.org/10.1016/j.jcss.2017.09.004. 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, 2018, s. 185-194. ISBN 978-1-4503-5583-4. Dostupné z: https://dx.doi.org/10.1145/3209108.3209191. ACM Digital Library info
• BLONDIN, Michael, Javier ESPARZA, Stefan JAAX a Antonín KUČERA. Black Ninjas in the Dark: Formal Analysis of Population Protocols. In Anuj Dawar, Erich Gradel. 2018 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). Oxford, England: ACM, 2018, s. 1-10. ISBN 978-1-4503-5583-4. Dostupné z: https://dx.doi.org/10.1145/3209108.3209110. ACM Digital Library info
• BRÁZDIL, Tomáš, Antonín KUČERA a Vojtěch ŘEHÁK. Solving Patrolling Problems in the Internet Environment. Online. In Jerome Lang. Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI 2018, July 13-19, 2018, Stockholm, Sweden. Neuveden: International Joint Conferences on Artificial Intelligence, 2018, s. 121-127. ISBN 978-0-9992411-2-7. Dostupné z: https://dx.doi.org/10.24963/ijcai.2018/17. IJCAI.org info
• BRÁZDIL, Tomáš, Krishnendu CHATTERJEE, Vojtěch FOREJT a Antonín KUČERA. Trading performance for stability in Markov decision processes. Journal of Computer and System Sciences. SAN DIEGO: Elsevier, 2017, roč. 84, č. 2017, s. 144-170. ISSN 0022-0000. Dostupné z: https://dx.doi.org/10.1016/j.jcss.2016.09.009. info
• BRÁZDIL, Tomáš, Antonín KUČERA a Petr NOVOTNÝ. Optimizing the Expected Mean Payoff in Energy Markov Decision Processes. In Cyrille Artho, Axel Legay, Doron Peled. Automated Technology for Verification and Analysis - 14th International Symposium, ATVA 2016. Heidelberg: Springer, 2016, s. 32-49. ISBN 978-3-319-46519-7. Dostupné z: https://dx.doi.org/10.1007/978-3-319-46520-3_3. info
• BRÁZDIL, Tomáš, Vojtěch FOREJT, Antonín KUČERA a Petr NOVOTNÝ. Stability in Graphs and Games. Online. In Josee Desharnais, Radha Jagadeesan. 27th International Conference on Concurrency Theory, CONCUR 2016. Dagstuhl: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016, s. 1-14. ISBN 978-3-95977-017-0. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.CONCUR.2016.10. info
• KUČERA, Antonín a Tomáš LAMSER. Regular Strategies and Strategy Improvement: Efficient Tools for Solving Large Patrolling Problems. In Catholijn M. Jonker, Stacy Marsella, John Thangarajah, Karl Tuyls. Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems. New York: ACM, 2016, s. 1171-1179. ISBN 978-1-4503-4239-1. ACM Digital Library info
• BRÁZDIL, Tomáš, Stefan KIEFER, Antonín KUČERA a Ivana HUTAŘOVÁ VAŘEKOVÁ. Runtime analysis of probabilistic programs with unbounded recursion. Journal of Computer and System Sciences. Academic Press, 2015, roč. 81, č. 1, s. 288-310. ISSN 0022-0000. Dostupné z: https://dx.doi.org/10.1016/j.jcss.2014.06.005. info
• KLIMOŠ, Miroslav a Antonín KUČERA. Cobra: A Tool for Solving General Deductive Games. In Martin Davis, Ansgar Fehnker, Annabelle McIver, Andrei Voronkov. Proceedings of 20th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR 2015). Heidelberg: Springer, 2015, s. 31-47. ISBN 978-3-662-48898-0. Dostupné z: https://dx.doi.org/10.1007/978-3-662-48899-7_3. info
• KUČERA, Antonín. On the Existence and Computability of Long-Run Average Properties in Probabilistic VASS. In Adrian Kosowski, Igor Walukiewicz. Fundamentals of Computation Theory - 20th International Symposium, FCT 2015, Gdańsk, Poland, August 17-19, 2015, Proceedings. Heidelberg: Springer, 2015, s. 12-24. ISBN 978-3-319-22176-2. Dostupné z: https://dx.doi.org/10.1007/978-3-319-22177-9_2. 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, 2015, s. 44-55. ISBN 978-1-4799-8875-4. Dostupné z: https://dx.doi.org/10.1109/LICS.2015.15. info
• BRÁZDIL, Tomáš, Chatterjee KRISHNENDU, Vojtěch FOREJT a Antonín KUČERA. MultiGain: A Controller Synthesis Tool for MDPs with Multiple Mean-Payoff Objectives. In Christel Baier, Cesare Tinelli. Tools and Algorithms for the Construction and Analysis of Systems - 21st International Conference, TACAS 2015, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2015, London, UK, April 11-18, 2015. Proceedings. Heidelberg: Springer, 2015, s. 181-187. ISBN 978-3-662-46680-3. Dostupné z: https://dx.doi.org/10.1007/978-3-662-46681-0_12. info
• BRÁZDIL, Tomáš, Václav BROŽEK, Vojtěch FOREJT a Antonín KUČERA. Branching-time model-checking of probabilistic pushdown automata. Journal of Computer and System Sciences. Academic Press, 2014, roč. 80, č. 1, s. 139-156. ISSN 0022-0000. Dostupné z: https://dx.doi.org/10.1016/j.jcss.2013.07.001. info
• BRÁZDIL, Tomáš, Stefan KIEFER a Antonín KUČERA. Efficient Analysis of Probabilistic Programs with an Unbounded Counter. Journal of the ACM. New York, NY, USA: ACM, 2014, roč. 61, č. 6, s. 1-35. ISSN 0004-5411. Dostupné z: https://dx.doi.org/10.1145/2629599. info
• BRÁZDIL, Tomáš, Václav BROŽEK, Krishnendu CHATTERJEE, Vojtěch FOREJT a Antonín KUČERA. Markov Decision Processes with Multiple Long-Run Average Objectives. Logical Methods in Computer Science. Technical University of Braunschweig, 2014, roč. 10, č. 1, s. 1-29. ISSN 1860-5974. Dostupné z: https://dx.doi.org/10.2168/LMCS-10(1:13)2014. URL info
• BRÁZDIL, Tomáš, Václav BROŽEK, Kousha ETESSAMI a Antonín KUČERA. Approximating the termination value of one-counter MDPs and stochastic games. Information and Computation. Netherlands: Elsevier Science, 2013, roč. 222, January, s. 121-138. ISSN 0890-5401. Dostupné z: https://dx.doi.org/10.1016/j.ic.2012.01.008. info
• BRÁZDIL, Tomáš, Javier ESPARZA, Stefan KIEFER a Antonín KUČERA. Analyzing probabilistic pushdown automata. Formal Methods in System Design. Springer Netherlands, 2013, roč. 43, č. 2, s. 124-163. ISSN 0925-9856. Dostupné z: https://dx.doi.org/10.1007/s10703-012-0166-0. info
• BRÁZDIL, Tomáš, Krishnendu CHATTERJEE, Vojtěch FOREJT a Antonín KUČERA. Trading Performance for Stability in Markov Decision Processes. In Proceedings of 28th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2013). London: IEEE Computer Society, 2013, s. 331-340. ISBN 978-1-4799-0413-6. Dostupné z: https://dx.doi.org/10.1109/LICS.2013.39. info
• BAIER, Christel, Tomáš BRÁZDIL, Marcus GRÖSSER a Antonín KUČERA. Stochastic game logic. Acta informatica. Berlin: Springer-Verlag, 2012, roč. 49, č. 4, s. 203-224. ISSN 0001-5903. Dostupné z: https://dx.doi.org/10.1007/s00236-012-0156-0. info
• KUČERA, Antonín. Playing Games with Counter Automata. In Alan Finkel, Jerome Leroux, Igor Potapov. Reachability Problems, RP 2012. Heidelberg Dordrecht London: Springer, 2012, s. 29-41. ISBN 978-3-642-33511-2. Dostupné z: https://dx.doi.org/10.1007/978-3-642-33512-9_4. info
• KUČERA, Antonín. Turn-Based Stochastic Games. In APT, Krzysztof R. a Erich GRÄDEL. Lectures in Game Theory for Computer Scientists. Cambridge, United Kingdom: Cambridge University Press, 2011, s. 146-184. ISBN 978-0-521-19866-0. Details info
• BRÁZDIL, Tomáš, Václav BROŽEK, Antonín KUČERA a Jan OBDRŽÁLEK. Qualitative Reachability in Stochastic BPA Games. Information and Computation. Elsevier, 2011, roč. 209, č. 8, s. 1160-1183. ISSN 0890-5401. info
• BROŽEK, Václav, Tomáš BRÁZDIL, Krishnendu CHATTERJEE, Vojtěch FOREJT a Antonín KUČERA. Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. In Martin Grohe. Proceedings 26th Annual IEEE Symposium on Logic in Computer Science. Los Alamitos, California: IEEE, 2011, s. 33-42. ISBN 978-0-7695-4412-0. Dostupné z: https://dx.doi.org/10.1109/LICS.2011.10. info
• BRÁZDIL, Tomáš, Stefan KIEFER, Antonín KUČERA a Ivana HUTAŘOVÁ VAŘEKOVÁ. Runtime Analysis of Probabilistic Programs with Unbounded Recursion. In Luca Aceto, Monika Henzinger, Jiří Sgall. Proceedings of 38th International Colloquium on Automata, Languages and Programming (ICALP 2011). Berlin: Springer, 2011, s. 319-331. ISBN 978-3-642-22011-1. info
• BRÁZDIL, Tomáš, Václav BROŽEK, Kousha ETESSAMI a Antonín KUČERA. Approximating the Termination Value of One-Counter MDPs and Stochastic Games. In Luca Aceto, Monika Henzinger, Jiří Sgall. Proceedings of 38th International Colloquium on Automata, Languages and Programming (ICALP 2011). Berlin: Springer, 2011, s. 332-343. ISBN 978-3-642-22011-1. info
• BRÁZDIL, Tomáš, Stefan KIEFER a Antonín KUČERA. Efficient Analysis of Probabilistic Programs with an Unbounded Counter. In Ganesh Gopalakrishnan, Shaz Qadeer. Computer Aided Verification, 23rd International Conference, CAV 2011. Berlin: Springer, 2011, s. 208-224. ISBN 978-3-642-22109-5. Dostupné z: https://dx.doi.org/10.1007/978-3-642-22110-1. info
• KUČERA, Antonín. Randomness: A Tool for Constructing and Analyzing Computer Programs. In Randomness through Computation. New Jersey: World Scientific, 2011, s. 275-282. ISBN 978-981-4327-74-9. info
• KUČERA, Antonín a Richard MAYR. On the Complexity of Checking Semantic Equivalences between Pushdown Processes and Finite-state Processes. Information and Computation. Elsevier, 2010, roč. 208, February, s. 772-796. ISSN 0890-5401. info
• KUČERA, Antonín. Effective Analysis of Infinite State Stochastic Processes and Games. In ESPARZA, Javier, Bernd SPANFELNER a Orna GRUMBERG. Logics and Languages for Reliability and Security. Amsterdam, The Netherlands: IOS Press, 2010, s. 155-179. NATO Science for Peace and Security Series, D, 25. ISBN 978-1-60750-099-5. info
• BRÁZDIL, Tomáš, Petr JANČAR a Antonín KUČERA. Reachability Games on Extended Vector Addition Systems with States. Abramsky, Gavoille, Kirchner, Meyer auf der Heide, Spirakis (Eds.). In Proceedings of 37th International Colloquium on Automata, Languages and Programming (ICALP 2010). Berlin: Springer, 2010, s. 478-489. ISBN 978-3-642-14161-4. Dostupné z: https://dx.doi.org/10.1007/978-3-642-14162-1_40. info
• HLINĚNÝ, Petr a Antonín KUČERA. Mathematical Foundations of Computer Science 2010. Berlin Heidelberg New York: Spriger, 2010, 714 s. ISBN 3-642-15154-X. info
• KUČERA, Antonín a Igor POTAPOV. Reachability Problems. Berlin Heidelberg New York: Springer, 2010, 197 s. ISBN 3-642-15348-8. info
• BRÁZDIL, Tomáš, Jan KRČÁL, Jan KŘETÍNSKÝ, Antonín KUČERA a Vojtěch ŘEHÁK. Stochastic Real-Time Games with Qualitative Timed Automata Objectives. In CONCUR 2010 - Concurrency Theory. Berlin Heidelberg New York: Springer, 2010, s. 207-221. ISBN 978-3-642-15374-7. Dostupné z: https://dx.doi.org/10.1007/978-3-642-15375-4_15. info
• MOGENS, Nielsen, Antonín KUČERA, Peter Bro MILTERSEN, Catuscia PALAMIDESSI, Petr TŮMA a Frank VALENCIA. SOFSEM 2009: Theory and Practice of Computer Science: 35th Conference on Current Trends in Theory and Practice of Computer Science : Špindlerův Mlýn, Czech Republic, January 2009, Proceedings. Berlin: Springer, 2009, 670 s. ISBN 978-3-540-95890-1. info
• BRÁZDIL, Tomáš, Vojtěch FOREJT, Jan KRČÁL, Jan KŘETÍNSKÝ a Antonín KUČERA. Continuous-Time Stochastic Games with Time-Bounded Reachability. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2009). Dagstuhl, Germany: Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2009, s. 61-72. ISBN 978-3-939897-13-2. info
• NIELSEN, Mogens, Antonín KUČERA, Peter Bro MILTERSEN, Catuscia PALAMIDESSI, Petr TŮMA, Frank VALENCIA a Mária BIELIKOVÁ. SOFSEM 2009: Theory and Practice of Computer Science. Prague: MATFYZPRESS, 2009, 132 s. ISBN 978-80-7378-059-3. info
• KUČERA, Antonín a Oldřich STRAŽOVSKÝ. On the Controller Synthesis for Finite-State Markov Decision Processes. Fundamenta Informaticae. Polsko: IOS Press, Nizozemí, 2008, roč. 82, 1-2, s. 141-153. ISSN 0169-2968. info
• BRÁZDIL, Tomáš, Václav BROŽEK, Vojtěch FOREJT a Antonín KUČERA. Reachability in Recursive Markov Decision Processes. Information and Computation. Elsevier, 2008, roč. 206, č. 5, s. 520-537. ISSN 0890-5401. info
• BRÁZDIL, Tomáš, Antonín KUČERA a Oldřich STRAŽOVSKÝ. Deciding probabilistic bisimilarity over infinite-state probabilistic systems. Acta informatica. Berlin: Springer-Verlag, 2008, roč. 45, č. 2, s. 131-154. ISSN 0001-5903. info
• BRÁZDIL, Tomáš, Vojtěch FOREJT, Jan KŘETÍNSKÝ a Antonín KUČERA. The Satisfiability Problem for Probabilistic CTL. In 23rd IEEE Symposium on Logic in Computer Science (LICS 2008), 24-27 June 2008, Pittsburgh, USA, Proceedings. Los Alamitos, California: IEEE Computer Society, 2008, s. 391-402, 10 s. ISBN 978-0-7695-3183-0. info
• BRÁZDIL, Tomáš, Vojtěch FOREJT a Antonín KUČERA. Controller Synthesis and Verification for Markov Decision Processes with Qualitative Branching Time Objectives. In Automata, Languages and Programming. 35th International Colloquium, ICALP 2008. Reykjavik, Iceland, July 2008. Proceedings, Part II. Berlin, Heidelberg, New York: Springer, 2008, s. 148-159. ISBN 3-540-70582-1. info
• BRÁZDIL, Tomáš, Václav BROŽEK, Jan HOLEČEK a Antonín KUČERA. Discounted Properties of Probabilistic Pushdown Automata. In Logic for Programming, Artificial Intelligence, and Reasoning, 15th International Conference, LPAR 2008. Berlin Heidelberg New York: Springer, 2008, s. 230-242. ISBN 978-3-540-89438-4. info
• KUČERA, Luděk a Antonín KUČERA. Mathematical Foundations of Computer Science 2007. In Mathematical Foundations of Computer Science 2007. Berlin Heidelberg New York: Springer, 2007, 764 s. ISBN 3-540-74455-X. info
• KUČERA, Luděk a Antonín KUČERA. Mathematical Foundations of Computer Science 2007. Berlin Heidelberg New York: Springer, 2007, 764 s. Lecture Notes in Computer Science, vol. 4708. ISBN 3-540-74455-X. info
• BAIER, Christel, Tomáš BRÁZDIL, Marcus GRÖSSER a Antonín KUČERA. Stochastic Game Logic. In Fourth International Conference on the Quantitative Evaluation of Systems (QEST 2007). Los Alamitos, Washington, Tokyo: IEEE Computer Society, 2007, s. 227-236. ISBN 0-7695-2883-X. info
• KUČERA, Antonín. Methods for Quantitative Analysis of Probabilistic Pushdown Automata. Electronic Notes in Theoretical Computer Science. Elsevier, 2006, roč. 149, č. 1, s. 3-15. ISSN 1571-0661. info
• ESPARZA, Javier, Antonín KUČERA a Richard MAYR. Model Checking Probabilistic Pushdown Automata. Logical Methods in Computer Science. 2006, roč. 2, 1-2, s. 1-31. ISSN 1860-5974. LMCS home page info
• KUČERA, Antonín a Petr JANČAR. Equivalence-Checking on Infinite-State Systems: Techniques and Results. Theory and practice of logic programming. Cambridge: Cambridge University Press, 2006, roč. 6, č. 3, s. 227-264. ISSN 1471-0684. info
• KUČERA, Antonín a Philippe SCHNOEBELEN. A General Approach to Comparing Infinite-State Systems with Their Finite-State Specifications. Theoretical Computer Science. Amsterdam, Nizozemí: Elsevier, 2006, roč. 358, 2-3, s. 315-333. ISSN 0304-3975. info
• BRÁZDIL, Tomáš, Václav BROŽEK, Vojtěch FOREJT a Antonín KUČERA. Reachability in Recursive Markov Decision Processes. C. Baier, H. Hermanns (Eds.). In 17th International Conference on Concurrency Theory. Berlin Heidelberg New York: Springer, 2006, s. 358-374. ISBN 3-540-37376-4. info
• BRÁZDIL, Tomáš, Václav BROŽEK, Vojtěch FOREJT a Antonín KUČERA. Stochastic Games with Branching-Time Winning Objectives. In 21th IEEE Symposium on Logic in Computer Science (LICS 2006), 12-15 August 2006, Seattle, Washington, USA, Proceedings. Los Alamitos, California: IEEE Computer Society, 2006, s. 349-358. ISBN 0-7695-2631-4. info
• KUČERA, Antonín a Jan STREJČEK. Characteristic Patterns for LTL. P. Vojtas, M. Bielikova, B. Charron-Bost, O. Sykora (Eds.). In SOFSEM 2005: Theory and Practice of Computer Science. Berlin, Heidelberg: Springer-Verlag, 2005, s. 239-249. ISBN 3-540-24302-X. info
• BRÁZDIL, Tomáš, Antonín KUČERA a Oldřich STRAŽOVSKÝ. On the Decidability of Temporal Properties of Probabilistic Pushdown Automata. V. Diekert, B. Durand (Eds.). In Proceedings of 22nd Symposium on Theoretical Aspects of Computer Science (STACS 2005). Berlin: Springer, 2005, s. 145-157. ISBN 3-540-24998-2. info
• ESPARZA, Javier, Antonín KUČERA a Richard MAYR. Quantitative Analysis of Probabilistic Pushdown Automata: Expectations and Variances. In Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science (LICS 2005). Los Alamitos, California: IEEE Computer Society, 2005, s. 117-126. ISBN 0-7695-2266-1. info
• KUČERA, Antonín a Jan STREJČEK. The stuttering principle revisited. Acta informatica. Berlin: Springer-Verlag, 2005, roč. 41, 7/8, s. 415-434. ISSN 0001-5903. info
• BRÁZDIL, Tomáš, Javier ESPARZA a Antonín KUČERA. Analysis and Prediction of the Long-Run Behavior of Probabilistic Sequential Programs with Recursion. In Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005). Los Alamitos, California: IEEE Computer Society, 2005, s. 521-530. ISBN 0-7695-2468-0. info
• BRÁZDIL, Tomáš a Antonín KUČERA. Computing the Expected Accumulated Reward and Gain for a Subclass of Infinite Markov Chains. In 25th International Conference on Foundations of Software Technology and Theoretical Computer Science. Berlin Heidelberg New York: Springer, 2005, s. 372-383. ISBN 3-540-30495-9. info
• KUČERA, Antonín a Oldřich STRAŽOVSKÝ. On the Controller Synthesis for Finite-State Markov Decision Processes. In 25th International Conference on Foundations of Software Technology and Theoretical Computer Science. Berlin Heidelberg New York: Springer, 2005, s. 541-552. ISBN 3-540-30495-9. info
• KUČERA, Antonín, Jozef GRUSKA a Milan ČEŠKA. 1st Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS 2005). 2005. info
• KUČERA, Antonín, Jozef GRUSKA a Milan ČEŠKA. Pre-Proceedings of 1st Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS 2005). Brno: Faculty of Informatics, Masaryk University in Brno, 2005, 224 s. FI MU Report Series. info
• JANČAR, Petr, Antonín KUČERA, Faron MOLLER a Zdeněk SAWA. DP lower bounds for equivalence-checking and model-checking of one-counter automata. Information and Computation. Academic Press, 2004, roč. 188, č. 1, s. 1-19. ISSN 0890-5401. info
• ESPARZA, Javier, Antonín KUČERA a Richard MAYR. Model Checking Probabilistic Pushdown Automata. In Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science (LICS 2004). Los Alamitos (California): IEEE Computer Society, 2004, s. 12-21. ISBN 0-7695-2192-4. info
• KUČERA, Antonín a Richard MAYR. A Generic Framework for Checking Semantic Equivalences between Pushdown Automata and Finite-State Automata. In Exploring New Frontiers of Theoretical Informatics : IFIP 18th World Computer Congress, TC1 3rd International Conference on Theoretical Computer Science (TCS2004). Boston, Dordrecht, London: Kluwer, 2004, s. 395-408. ISBN 1-4020-8140-5. info
• BRÁZDIL, Tomáš, Antonín KUČERA a Oldřich STRAŽOVSKÝ. Deciding Probabilistic Bisimilarity Over Infinite-State Probabilistic Systems. P. Gardner, N. Yoshida (Eds.). In Proceedings of 15th International Conference on Concurrency Theory (CONCUR 2004). Berlin: Springer, 2004, s. 193-208. ISBN 3-540-22940-X. info
• KUČERA, Antonín a Philippe SCHNOEBELEN. A General Approach to Comparing Infinite-State Systems with Their Finite-State Specifications. P. Gardner, N. Yoshida (Eds.). In Proceedings of 15th International Conference on Concurrency Theory (CONCUR 2004). Berlin: Springer, 2004, s. 371-386. ISBN 3-540-22940-X. info
• KUČERA, Antonín. The Complexity of Bisimilarity-Checking for One-Counter Processes. Theoretical Computer Science. Amsterdam, Nizozemí: Elsevier, 2003, roč. 304, 1-3, s. 157-183. ISSN 0304-3975. info
• ESPARZA, Javier, Antonín KUČERA a Stefan SCHWOON. Model checking LTL with regular valuations for pushdown systems. Information and Computation. Academic Press, 2003, roč. 186, č. 2, s. 355-376. ISSN 0890-5401. info
• JANČAR, Petr, Antonín KUČERA a Faron MOLLER. Deciding Bisimilarity between BPA and BPP Processes. R. Amadio, D. Lugiez (Eds.). In Proceedings of 14th International Conference on Concurrency Theory (CONCUR 2003). Berlin: Springer, 2003, s. 159-174. ISBN 3-540-40753-7. info
• KUČERA, Antonín a Javier ESPARZA. A Logical Viewpoint on Process-algebraic Quotients. Journal of logic and computation. Oxford: Oxford University Press, 2003, roč. 13, č. 6, s. 863-880. ISSN 0955-792X. info
• KUČERA, Antonín a Richard MAYR. Weak Bisimilarity between Finite-State Systems and BPA or normed BPP is Decidable in Polynomial Time. Theoretical Computer Science. Amsterdam, Nizozemí, 2002, roč. 270, 1-2, s. 677-700. ISSN 0304-3975. info
• JANČAR, Petr, Antonín KUČERA, Faron MOLLER a Zdeněk SAWA. Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds. In Proceedings of 5th International Conference on Foundations of Software Science and Computation Structures (FOSSACS 2002). Berlin, Heidelberg, New York: Springer, 2002, s. 172-186. ISBN 3-540-43366-X. info
• KUČERA, Antonín a Richard MAYR. Simulation Preorder over Simple Process Algebras. Information and Computation. Academic Press, 2002, roč. 173, č. 2, s. 184-198. ISSN 0890-5401. info
• KUČERA, Antonín a Richard MAYR. On the Complexity of Semantic Equivalences for Pushdown Automata and BPA. K. Diks, W. Rytter (Eds.). In Proceedings of 27th International Symposium on Mathematical Foundations of Computer Science (MFCS 2002). Berlin: Springer, 2002, s. 433-445. ISBN 3-540-44040-2. info
• KUČERA, Antonín a Richard MAYR. Why is Simulation Harder Than Bisimulation? L. Brim, P. Jancar, M. Kretinsky, A. Kucera (Eds.). In Proceedings of 13th International Conference on Concurrency Theory (CONCUR 2002). Berlin: Springer, 2002, s. 594-609. ISBN 3-540-44043-7. info
• KUČERA, Antonín a Jan STREJČEK. The Stuttering Principle Revisited: On the Expressiveness of Nested X and U Operators in the Logic LTL. J. Bradfield (Ed.). In Proceedings of the Annual Conference of the European Association for Computer Science Logic (CSL'02). Berlin: Springer, 2002, s. 276-291. ISBN 3-540-44240-5. info
• BRIM, Luboš, Petr JANČAR, Mojmír KŘETÍNSKÝ a Antonín KUČERA. CONCUR 2002 - Concurrency Theory. 13th International Conference. Proceedings. Berlin, Heidelberg, New York: Springer, 2002, 609 s. Lecture Notes in Computer Science, vol. 2421. ISBN 3-540-44043-7. info
• KUČERA, Antonín a Petr JANČAR. Equivalence-Checking with Infinite-State Systems: Techniques and Results. W.I. Grosky, F. Plášil (Eds.). In Proceedings of 29th Conference on Current Trends in Theory and Practice of Informatics (SOFSEM 2002). Berlin: Springer, 2002, s. 41-73. ISBN 3-540-00145-X. info
• KUČERA, Antonín a Richard MAYR. Infinity 2002. 4th International Workshop on Verification of Infinite-State Systems. Amsterdam: Elsevier, 2002, 106 s. ENTCS, volume 68(6). ISBN 0444513299. info
• KUČERA, Antonín a Richard MAYR. INFINITY 2002. 4th International Workshop on Verification of Infinite-State Systems. 2002. URL info
• JANČAR, Petr, Antonín KUČERA a Richard MAYR. Deciding Bisimulation-Like Equivalences with Finite-State Processes. Theoretical Computer Science. Amsterdam, Nizozemí, 2001, roč. 258, 1-2, s. 409-433. ISSN 0304-3975. info
• ESPARZA, Javier, Antonín KUČERA a Stefan SCHWOON. Model-Checking LTL with Regular Valuations for Pushdown Systems. N. Kobayashi, B.C. Pierce (Eds.). In Proceedings of 4th International Symposium on Theoretical Aspects of Computer Software (TACS 2001). Berlin, Heidelberg, New York: Springer, 2001, s. 316-340. Lecture Notes in Computer Science, vol. 2215. ISBN 3-540-42736-8. info
• JANČAR, Petr, Antonín KUČERA a Faron MOLLER. Simulation and Bisimulation over One-Counter Processes. H. Reichel, S. Tison (Eds.). In Proceedings of 17th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2000). Berlin, Heidelberg, New York: Springer, 2000, s. 334-345. Lecture Notes in Computer Science, vol. 1770. ISBN 3-540-67141-2. info
• KUČERA, Antonín. Effective Decomposability of Sequential Behaviours. Theoretical Computer Science. Amsterdam, Nizozemí, 2000, roč. 242, 1-2, s. 71-89. ISSN 0304-3975. info
• KUČERA, Antonín. Efficient Verification Algorithms for One-Counter Processes. U. Montanari, J.D.P. Rolim, E. Welzl (Eds.). In Proceedings of 27th International Colloquium on Automata, Languages and Programming (ICALP 2000). Berlin, Heidelberg, New York: Springer, 2000, s. 317-328. Lecture Notes in Computer Science, vol. 1853. ISBN 3-540-67715-1. info
• KUČERA, Antonín. On Simulation-Checking with Sequential Systems. Jifeng He, Masahiko Sato (Eds.). In Proceedings of 6th Asian Computing Science Conference (ASIAN 2000). Berlin, Heidelberg, New York: Springer, 2000, s. 133-148. Lecture Notes in Computer Science, vol. 1961. ISBN 3-540-41428-2. info
• ČERNÁ, Ivana, Mojmír KŘETÍNSKÝ a Antonín KUČERA. Comparing Expressibility of Normed BPA and Normed BPP Processes. Acta informatica. Berlin: Springer-Verlag, 1999, roč. 36, č. 3, s. 233-256. ISSN 0001-5903. info
• KUČERA, Antonín. On Finite Representations of Infinite-State Behaviours. Information Processing Letters. Elsevier, 1999, roč. 70, č. 1, s. 23-30. ISSN 0020-0190. info
• KUČERA, Antonín a Richard MAYR. Simulation Preorder on Simple Process Algebras. J. Wiedermann, P. van Emde Boas, M. Nielsen (Eds.). In Proceedings of 26th International Colloquium on Automata, Languages and Programming (ICALP'99). Berlin: Springer, 1999, s. 503-512. Lecture Notes in Computer Science, vol. 1644. ISBN 3-540-66224-3. info
• KUČERA, Antonín a Richard MAYR. Weak Bisimilarity with Infinite-State Systems Can Be Decided in Polynomial Time. J.C.M. Baeten, S. Mauw (Eds.). In Proceedings of 10th International Conference on Concurrency Theory (CONCUR´99). Berlin: Springer, 1999, s. 368-382. Lecture Notes in Computer Science, vol. 1664. ISBN 3-540-66425-4. info
• KUČERA, Antonín a Javier ESPARZA. A Logical Viewpoint on Process-Algebraic Quotients. J. Flum, M. Rodríguez-Artalejo (Eds.). In Computer Science Logic; Proceedings of 8th Annual Conference of the EACSL (CSL´99). Berlin: Springer, 1999, s. 499-514. Lecture Notes in Computer Science, vol. 1683. ISBN 3-540-66536-6. info
• KUČERA, Antonín. Regularity of normed PA processes. Information Processing Letters. Elsevier, 1999, roč. 72, 1-2, s. 9-17. ISSN 0020-0190. info
• JANČAR, Petr, Antonín KUČERA a Richard MAYR. Bisimilarity of Processes with Finite-State Systems. K. Larsen, S. Skyum, G. Winskel (Eds.). In Proceedings of 25th International Colloquium on Automata, Languages and Programming (ICALP'98). Berlin: Springer, 1998, s. 200-211. Lecture Notes in Computer Science, vol. 1443. ISBN 3-540-64781-3. info
• KUČERA, Antonín. On Finite Representations of Infinite-State Behaviours. F. Plášil, K.G. Jeffery (Eds.). In Proceedings of 24th Seminar on Current Trends in Theory and Practice of Informatics (SOFSEM'97). Berlin: Springer, 1997, s. 481-488. Lecture Notes in Computer Science, vol. 1338. ISBN 3-540-63774-5. info
• KUČERA, Antonín. How to Parallelize Sequential Processes. A. Mazurkiewicz, J. Winkowski (Eds.). In Proceedings of 8th International Conference on Concurrency Theory (CONCUR´97). Berlin: Springer, 1997, s. 302-316. Lecture Notes in Computer Science, vol. 1243. ISBN 3-540-63141-0. info
• JANČAR, Petr a Antonín KUČERA. Bisimilarity of Processes with Finite-State Systems. F. Moller (Editor). In Proceedings of 2nd International Workshop on Verification of Infinite State Systems (INFINITY´97). Uppsala (Sweden): University of Uppsala, 1997, s. 72-85. UPMAIL TR No. 148. ISBN 1100-0686. info
• ČERNÁ, Ivana, Mojmír KŘETÍNSKÝ a Antonín KUČERA. Bisimilarity is Decidable in the Union of Normed BPA and Normed BPP Processes. Electronic Notes in Theoretical Computer Science. Elsevier, 1997, roč. 1997, č. 5, s. 1-24. ENTCS home page info
• JANČAR, Petr a Antonín KUČERA. Bisimilarity of Processes with Finite-State Systems. Electronic Notes in Theoretical Computer Science. Elsevier, 1997, roč. 1997, č. 9, s. 1-14. ENTCS home page info
• JANČAR, Petr a Antonín KUČERA. Bisimilarity of Processes with Finite-state Systems. FI MU Report Series. Brno: FI MU, 1997, roč. 1997, RS-97-02, s. 1-19. info
• KUČERA, Antonín. Regularity is Decidable for Normed BPA and Normed BPP Processes in Polynomial Time. K.G. Jeffery, J. Král, M. Bartošek (Eds.). In Proceedings of 23rd Seminar on Current Trends in Theory and Practice of Informatics (SOFSEM´96). Berlin: Springer, 1996, s. 377-384. Lecture Notes in Computer Science, vol. 1175. ISBN 3-540-61994-1. info
• KUČERA, Antonín. Regularity is Decidable for Normed PA Processes in Polynomial Time. V. Chandru, V. Vinay (Eds.). In Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science (FST&TCS´96). Berlin: Springer, 1996, s. 111-122. Lecture Notes in Computer Science, vol. 1180. ISBN 3-540-62034-6. info
• ČERNÁ, Ivana, Mojmír KŘETÍNSKÝ a Antonín KUČERA. Bisimilarity is Decidable in the Union of Normed BPA and Normed BPP Processes. B. Steffen, T. Margaria (Eds.). In Proceedings of 1st International Workshop on Verification of Infinite State Systems (INFINITY'96). Passau: University of Passau, 1996, s. 32-46. MIP-9614. info

2018/07/06