Výpis publikací

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.

CHODIL, Miroslav a Antonín KUČERA. The Satisfiability Problem for a Quantitative Fragment of PCTL. Journal of Computer and System Sciences. Elsevier, 2024. ISSN 0022-0000. Dostupné z: https://dx.doi.org/10.1016/j.jcss.2023.103478.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

BRÁZDIL, Tomáš, Krishnendu CHATTERJEE, Antonín KUČERA, Petr NOVOTNÝ a Dominik VELAN. Deciding Fast Termination for Probabilistic VASS with Nondeterminism. In Yu-Fang Chen, Chih-Hong Cheng, Javier Esparza. Automated Technology for Verification and Analysis - 17th International Symposium, ATVA 2019, Proceedings. Cham: Springer, 2019, s. 462-478. ISBN 978-3-030-31783-6. Dostupné z: https://dx.doi.org/10.1007/978-3-030-31784-3_27.

BAIER, Christel, Clemens DUBSLAFF, Ľuboš KORENČIAK, Antonín KUČERA a Vojtěch ŘEHÁK. Mean-Payoff Optimization in Continuous-Time Markov Chains with Parametric Alarms. ACM Transactions on Modeling and Computer Simulation (TOMACS). ACM, 2019, roč. 29, č. 4, s. "28:1"-"28:26", 26 s. ISSN 1049-3301. Dostupné z: https://dx.doi.org/10.1145/3310225.

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.

KLAŠKA, David, Antonín KUČERA, Tomáš LAMSER a Vojtěch ŘEHÁK. Automatic Synthesis of Efficient Regular Strategies in Adversarial Patrolling Games. Online. In Proceedings of the 2018 International Conference on Autonomous Agents & Multiagent Systems. Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems, 2018, s. 659-666. ISBN 978-1-5108-6808-3. Dostupné z: https://dx.doi.org/10.5555/3237383.3237481.

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.

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.

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.

BAIER, Christel, Clemens DUBSLAFF, Ľuboš KORENČIAK, Antonín KUČERA a Vojtěch ŘEHÁK. Mean-Payoff Optimization in Continuous-Time Markov Chains with Parametric Alarms. In Nathalie Bertrand, Luca Bortolussi. Quantitative Evaluation of Systems. Cham: Springer, 2017, s. 190-206. ISBN 978-3-319-66334-0. Dostupné z: https://dx.doi.org/10.1007/978-3-319-66335-7_12.

BAIER, Christel, Clemens DUBSLAFF, Ľuboš KORENČIAK, Antonín KUČERA a Vojtěch ŘEHÁK. Synthesis of Optimal Resilient Control Strategies. In Deepak D'Souza, K. Narayan Kumar. Automated Technology for Verification and Analysis. Cham: Springer International Publishing, 2017, s. 417-434. ISBN 978-3-319-68166-5. Dostupné z: https://dx.doi.org/10.1007/978-3-319-68167-2_27.

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.

KORENČIAK, Ľuboš, Antonín KUČERA a Vojtěch ŘEHÁK. Efficient Timeout Synthesis in Fixed-Delay CTMC Using Policy Iteration. In 2016 IEEE 24th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems. London: IEEE Computer Society, 2016, s. 367-372. ISBN 978-1-5090-3431-4. Dostupné z: https://dx.doi.org/10.1109/MASCOTS.2016.34.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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. ISBN 978-3-319-08866-2. Dostupné z: https://dx.doi.org/10.1007/978-3-319-08867-9_30.

ABAFFY, Michal, Tomáš BRÁZDIL, Vojtěch ŘEHÁK, Branislav BOŠANSKÝ, Antonín KUČERA a Jan KRČÁL. Solving adversarial patrolling games with bounded error: (extended abstract). In Alessio Lomuscio, Paul Scerri, Ana Bazzan, and Michael Huhns. Proceedings of the 13th International Conference on Autonomous Agents and Multiagent Systems (AAMAS'14). Richland, SC, USA: International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS), 2014, s. 1617-1618. ISBN 978-1-4503-2738-1.

BRÁZDIL, Tomáš, Stefan KIEFER, Antonín KUČERA, Petr NOVOTNÝ a Joost-Pieter KATOEN. Zero-reachability in probabilistic multi-counter automata. Online. 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. Dostupné z: https://dx.doi.org/10.1145/2603088.2603161.

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.

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.

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. Information and Computation. Elsevier, 2013, roč. 224, č. 1, s. 46-70. ISSN 0890-5401. Dostupné z: https://dx.doi.org/10.1016/j.ic.2013.01.001.

BRÁZDIL, Tomáš, Antonín KUČERA a Petr NOVOTNÝ. Determinacy in Stochastic Games with Unbounded Payoff Functions. Online. In Mathematical and Engineering Methods in Computer Science (MEMICS 2012). Heidelberg: Springer, 2013, s. 94-105. ISBN 978-3-642-36044-2. Dostupné z: https://dx.doi.org/10.1007/978-3-642-36046-6_10.

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.

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. ISBN 978-3-642-31423-0. Dostupné z: https://dx.doi.org/10.1007/978-3-642-31424-7_8.

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. ISBN 978-3-642-31584-8. Dostupné z: https://dx.doi.org/10.1007/978-3-642-31585-5_16.

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.

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.

KUČERA, Antonín, Thomas A. HENZINGER, Jaroslav NEŠETŘIL, Tomáš VOJNAR a David ANTOŠ. 8th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science. Brno: NOVPRESS, 2012. ISBN 978-80-87342-15-2.

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.

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.

BRÁZDIL, Tomáš, Jan KRČÁL, Jan KŘETÍNSKÝ, Antonín KUČERA a Vojtěch ŘEHÁK. Measuring Performance of Continuous-Time Stochastic Processes using Timed Automata. In Emilio Frazzoli, Radu Grosu. HSCC 11: Proceedings of the 14th International Conference on Hybrid Systems: Computation and Control. New York: ACM, 2011, s. 33-42. ISBN 978-1-4503-0629-4.

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.

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.

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.

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.

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.

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.

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.

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.

BRÁZDIL, Tomáš, Václav BROŽEK, Kousha ETESSAMI, Antonín KUČERA a Dominik WOJTCZAK. One-Counter Markov Decision Processes. In Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms. Neuveden: SIAM, 2010, s. 863-874. ISBN 978-0-89871-698-6.

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.

KUČERA, Antonín a Igor POTAPOV. Reachability Problems. Berlin Heidelberg New York: Springer, 2010, 197 s. ISBN 3-642-15348-8.

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.

HLINĚNÝ, Petr a Antonín KUČERA. 35th International Symposium on Mathematical Foundations of Computer Science (MFCS 2010). 2010.

KUČERA, Antonín a Igor POTAPOV. 4th International Workshop on Reachability Problems. 2010.

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.

KUČERA, Antonín. Člen oborové komise OK 2 přírodních věd Grantové agentury České republiky. Grantová agentura ČR, 2009.

KUČERA, Antonín. Člen podoborové komise pro matematiku a informatiku (č. komise 201) Grantové agentury České republiky. Grantová agentury České republiky, 2009.

KUČERA, Antonín. Člen vědecké rady Fakulty Informatiky Masarykovy univerzity. Vědecká rada Fakulty informatiky Masarykovy univerzity, 2009.

KUČERA, Antonín. Člen vědecké rady Matematicko-fyzikální fakulty Univerzity Karlovy v Praze. Vědecká rada Matematicko-fyzikální fakulty Univerzity Karlovy v Praze, 2009.

KUČERA, Antonín. Programme Committee Member of 17th International Symposium on Fundamentals of Computation Theory (FCT 2009). Programový výbor konference FCT 2009, 2009.

KUČERA, Antonín. Programme Committee Member of 18th EACSL Annual Conference on Computer Science Logic (CSL 2009). Programový výbor konference CSL 2009, 2009.

KUČERA, Antonín. Programme Committee Member of 34th International Symposium on Mathematical Foundations of Computer Science (MFCS 2009). Programový výbor konference MFCS 2009, 2009.

KUČERA, Antonín. Programme Committee Member of 9th International Conference on Application of Concurrency in System Design (ACSD 2009). Programový výbor konference ACSD 2009, 2009.

BRÁZDIL, Tomáš, Václav BROŽEK, Antonín KUČERA a Jan OBDRŽÁLEK. Qualitative Reachability in Stochastic BPA Games. In Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science. Freiburg, Germany: IBFI Schloss Dagstuhl, 2009, s. 207-218. ISBN 978-3-939897-09-5.

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.

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.

KUČERA, Antonín. Track Chair of 35th International Conference on Current Trends in Theory and Practice of Computer Science (Sofsem 2009). Programový výbor konference Sofsem 2009, 2009.

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.

KUČERA, Antonín. Člen oborové komise OK 2 přírodních věd. Grantová agentura ČR, 2008.

KUČERA, Antonín. Člen podoborové komise pro matematiku a informatiku (č. komise 201) Grantové agentury České republiky. Grantová agentury České republiky, 2008.

KUČERA, Antonín. Člen vědecké rady Fakulty Informatiky Masarykovy univerzity. Vědecká rada Fakulty informatiky Masarykovy univerzity, 2008.

KUČERA, Antonín. Člen vědecké rady Matematicko-fyzikální fakulty Univerzity Karlovy v Praze. Vědecká rada Matematicko-fyzikální fakulty Univerzity Karlovy v Praze, 2008.

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.

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.

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.

KUČERA, Antonín. Programme Committee Member of 4th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS 2008). Programový výbor workshopu MEMICS 2008, 2008.

KUČERA, Antonín. Programme Committee Member of 8th International Conference on Application of Concurrency in System Design (ACSD 2008). Programový výbor konference ACSD 2008, 2008.

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.

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.

KUČERA, Antonín. Verification of Infinite State Probabilistic Systems. In 8th School on MOdelling and VErifying of parallel Processes (MOVEP 2008). 2008.

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.

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.

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.

KUČERA, Luděk a Antonín KUČERA. 32nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2007). Berlin Heidelberg New York: Springer, 2007. ISBN 3-540-74455-X.

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.

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.

ČERNÁ, Ivana, Mojmír KŘETÍNSKÝ a Antonín KUČERA. Formální jazyky a automaty I. Elportál. Brno: Masarykova univerzita, 2006. ISSN 1802-128X.

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.

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.

MATYSKA, Luděk, Antonín KUČERA, Tomáš VOJNAR, Zdeněk KOTÁSEK, David ANTOŠ a Ondřej KRAJÍČEK. Proceedings of the Second Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS 2006). Mikulov: FIT BUT, 2006, 281 s. Proceedings. ISBN 80-214-3287-X.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

GRUSKA, Jozef, Jan BOUDA, Antonín KUČERA a Ondřej KRAJÍČEK. 1st Doctoral Workshop on Mathematical and Engineering Methods in Computer Science. 2005.

KUČERA, Antonín, Jozef GRUSKA a Milan ČEŠKA. 1st Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS 2005). 2005.

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.

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.

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.

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.

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.

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.

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.

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.

KOPEČEK, Ivan, Robert BATŮŠEK a Antonín KUČERA. On Homogeneous Segments. In Text, Speech and Dialogue - 6th International Conference, Proceedings. Berlin: Springer Verlag, 2003, s. 152-157. ISBN 0302-9743.

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.

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.

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.

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.

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.

KUČERA, Antonín a Richard MAYR. INFINITY 2002. 4th International Workshop on Verification of Infinite-State Systems. 2002.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

Č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.

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.

KUČERA, Antonín. Regularity of normed PA processes. Information Processing Letters. Elsevier, 1999, roč. 72, 1-2, s. 9-17. ISSN 0020-0190.

KUČERA, Antonín a Mayr RICHARD. Simulation Preorder on Simple Process Algebras. Technical Report TUM. Germany: Technical University Munich, 1999, roč. 1999, TUM-I9902, s. 1-23.

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.

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.

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.

JANČAR, Petr, Antonín KUČERA a Mayr RICHARD. Deciding Bisimulation-Like Equivalences with Finite-State Processes. Technical Report TUM. Germany: Technical University Munich, 1998, roč. 1998, TUM-I9805, s. 1-24.

KUČERA, Antonín a Mayr RICHARD. Weak Bisimilarity with Infinite-State Systems can be Decided in Polynomial Time. Technical Report TUM. Germany: Technical University Munich, 1998, roč. 1998, TUM-I9830, s. 1-28.

Č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.

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.

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.

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.

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.

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.

Č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.

ČERNÁ, Ivana, Mojmír KŘETÍNSKÝ a Antonín KUČERA. Comparing Expressibility of Normed BPA and Normed BPP Processes. FI MU Report Series. Brno: FI MU, 1996, roč. 1996, RS-96-02, s. 1-28.

KUČERA, Antonín. How to Parallelize Sequential Processes. FI MU Report Series. Brno: FI MU, 1996, roč. 1996, RS-96-05, s. 1-24.

ČERNÁ, Ivana, Mojmír KŘETÍNSKÝ a Antonín KUČERA. On the Relationship between Sequential and Parallel Compositions in Process Algebras. In CSL96 - The 1996 Annual Conference of the European Assoc.. Ultrech, The Netherlands: Department of Philosophy, Ulterech University, 1996, s. 11-13.

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.

KUČERA, Antonín. Regularity is Decidable for Normed PA Processes in Polynomial Time. FI MU Report Series. Brno: FI MU, 1996, roč. 1996, RS-96-01, s. 1-17.

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.

KUČERA, Antonín. Deciding Regularity in Process Algebras. BRICS Report Series. Denmark: BRICS, 1995, roč. 1995, RS-95-52, s. 1-42. ISSN 0909-0878.