Antonín Kucera

186 papers A* 27A 11B 33Journal 81Unranked 28

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	The Finite Satisfiability Problem for PCTL is Undecidable. J. ACM Miroslav Chodil, Antonín Kucera
2025	A*	`conf`	Multiple Mean-Payoff Optimization Under Local Stability Constraints. AAAI David Klaska, Antonín Kucera, Vojtech Kur, Vít Musil, Vojtech Rehák
2025	—	`conf`	PCTL Satisfiability for Infinite Binary Trees. Principles of Formal Quantitative Analysis Antonín Kucera
2025	A*	`conf`	Steady-State Strategy Synthesis for Swarms of Autonomous Agents. IJCAI Martin Jonás, Antonín Kucera, Vojtech Kur, Jan Macák
2025	J	`jnl`	Steady-State Strategy Synthesis for Swarms of Autonomous Agents. CoRR Martin Jonás, Antonín Kucera, Vojtech Kur, Jan Macák
2025	A*	`conf`	The Satisfiability and Validity Problems for Probabilistic Computational Tree Logic Are Highly Undecidable. ICALP Miroslav Chodil, Antonín Kucera
2025	J	`jnl`	The Satisfiability and Validity Problems for Probabilistic Computational Tree Logic are Highly Undecidable. CoRR Miroslav Chodil, Antonín Kucera
2024	B	`ed.`	49th International Symposium on Mathematical Foundations of Computer Science, MFCS 2024, Bratislava, Slovakia, August 26-30, 2024 MFCS Rastislav Královic, Antonín Kucera
2024	—	`conf`	Asymptotic Analysis of Probabilistic Programs: When Expectations Do Not Meet Our Expectations. Principles of Verification (1) Michal Ajdarów, Antonín Kucera, Petr Novotný
2024	J	`jnl`	Multiple Mean-Payoff Optimization under Local Stability Constraints. CoRR David Klaska, Antonín Kucera, Vojtech Kur, Vít Musil, Vojtech Rehák
2024	A*	`conf`	Optimizing Local Satisfaction of Long-Run Average Objectives in Markov Decision Processes. AAAI David Klaska, Antonín Kucera, Vojtech Kur, Vít Musil, Vojtech Rehák
2024	—	`ed.`	Taming the Infinities of Concurrency - Essays Dedicated to Javier Esparza on the Occasion of His 60th Birthday Taming the Infinities of Concurrency Stefan Kiefer, Jan Kretínský, Antonín Kucera
2024	A*	`conf`	The Finite Satisfiability Problem for PCTL is Undecidable. LICS Miroslav Chodil, Antonín Kucera
2024	J	`jnl`	The General and Finite Satisfiability Problems for PCTL are Undecidable. CoRR Miroslav Chodil, Antonín Kucera
2024	—	`conf`	The Satisfiability and Validity Problems for Probabilistic CTL. RP Antonín Kucera
2024	J	`jnl`	The satisfiability problem for a quantitative fragment of PCTL. J. Comput. Syst. Sci. Miroslav Chodil, Antonín Kucera
2023	B	`conf`	Asymptotic Complexity Estimates for Probabilistic Programs and Their VASS Abstractions. CONCUR Michal Ajdarów, Antonín Kucera
2023	J	`jnl`	Asymptotic Complexity Estimates for Probabilistic Programs and their VASS Abstractions. CoRR Michal Ajdarów, Antonín Kucera
2023	A*	`conf`	Mean Payoff Optimization for Systems of Periodic Service and Maintenance. IJCAI David Klaska, Antonín Kucera, Vít Musil, Vojtech Rehák
2023	J	`jnl`	Mean Payoff Optimization for Systems of Periodic Service and Maintenance. CoRR David Klaska, Antonín Kucera, Vít Musil, Vojtech Rehák
2023	J	`jnl`	Optimizing Local Satisfaction of Long-Run Average Objectives in Markov Decision Processes. CoRR David Klaska, Antonín Kucera, Vojtech Kur, Vít Musil, Vojtech Rehák
2023	A*	`conf`	Synthesizing Resilient Strategies for Infinite-Horizon Objectives in Multi-Agent Systems. IJCAI David Klaska, Antonín Kucera, Martin Kurecka, Vít Musil, Petr Novotný, Vojtech Rehák
2023	J	`jnl`	Synthesizing Resilient Strategies for Infinite-Horizon Objectives in Multi-Agent Systems. CoRR David Klaska, Antonín Kucera, Martin Kurecka, Vít Musil, Petr Novotný, Vojtech Rehák
2022	A*	`conf`	General Optimization Framework for Recurrent Reachability Objectives. IJCAI David Klaska, Antonín Kucera, Vít Musil, Vojtech Rehák
2022	J	`jnl`	General Optimization Framework for Recurrent Reachability Objectives. CoRR David Klaska, Antonín Kucera, Vít Musil, Vojtech Rehák
2022	A	`conf`	Minimizing Expected Intrusion Detection Time in Adversarial Patrolling. AAMAS David Klaska, Antonín Kucera, Vít Musil, Vojtech Rehák
2022	J	`jnl`	Minimizing Expected Intrusion Detection Time in Adversarial Patrolling. CoRR David Klaska, Antonín Kucera, Vít Musil, Vojtech Rehák
2022	J	`jnl`	On-the-fly Adaptation of Patrolling Strategies in Changing Environments. CoRR Tomás Brázdil, David Klaska, Antonín Kucera, Vít Musil, Petr Novotný, Vojtech Rehák
2022	A	`conf`	On-the-fly adaptation of patrolling strategies in changing environments. UAI Tomás Brázdil, David Klaska, Antonín Kucera, Vít Musil, Petr Novotný, Vojtech Rehák
2022	—	`conf`	Satisfiability of Quantitative Probabilistic CTL: Rise to the Challenge. Principles of Systems Design Miroslav Chodil, Antonín Kucera, Jan Kretínský
2021	J	`jnl`	Algorithmic analysis of termination and counter complexity in vector addition systems with states: a survey of recent results. ACM SIGLOG News Antonín Kucera
2021	B	`conf`	Deciding Polynomial Termination Complexity for VASS Programs. CONCUR Michal Ajdarów, Antonín Kucera
2021	J	`jnl`	Deciding Polynomial Termination Complexity for VASS Programs. CoRR Michal Ajdarów, Antonín Kucera
2021	J	`jnl`	Regstar: Efficient Strategy Synthesis for Adversarial Patrolling Games. CoRR David Klaska, Antonín Kucera, Vít Musil, Vojtech Rehák
2021	A	`conf`	Regstar: efficient strategy synthesis for adversarial patrolling games. UAI David Klaska, Antonín Kucera, Vít Musil, Vojtech Rehák
2021	B	`conf`	The Satisfiability Problem for a Quantitative Fragment of PCTL. FCT Miroslav Chodil, Antonín Kucera
2021	J	`jnl`	The Satisfiability Problem for a Quantitative Fragment of PCTL. CoRR Miroslav Chodil, Antonín Kucera
2020	A	`conf`	Adversarial Patrolling with Drones. AAMAS David Klaska, Antonín Kucera, Vojtech Rehák
2020	—	`conf`	Checking Qualitative Liveness Properties of Replicated Systems with Stochastic Scheduling. CAV (2) Michael Blondin, Javier Esparza, Martin Helfrich, Antonín Kucera, Philipp J. Meyer
2020	J	`jnl`	Checking Qualitative Liveness Properties of Replicated Systems with Stochastic Scheduling. CoRR Michael Blondin, Javier Esparza, Martin Helfrich, Antonín Kucera, Philipp J. Meyer
2020	A*	`conf`	Efficient Analysis of VASS Termination Complexity. LICS Antonín Kucera, Jérôme Leroux, Dominik Velan
2019	B	`conf`	Deciding Fast Termination for Probabilistic VASS with Nondeterminism. ATVA Tomás Brázdil, Krishnendu Chatterjee, Antonín Kucera, Petr Novotný, Dominik Velan
2019	J	`jnl`	Deciding Fast Termination for Probabilistic VASS with Nondeterminism. CoRR Tomás Brázdil, Krishnendu Chatterjee, Antonín Kucera, Petr Novotný, Dominik Velan
2019	J	`jnl`	Mean-payoff Optimization in Continuous-time Markov Chains with Parametric Alarms. ACM Trans. Model. Comput. Simul. Christel Baier, Clemens Dubslaff, Lubos Korenciak, Antonín Kucera, Vojtech Rehák
2018	J	`jnl`	A generic framework for checking semantic equivalences between pushdown automata and finite-state automata. J. Comput. Syst. Sci. Antonín Kucera, Richard Mayr
2018	B	`conf`	Automatic Analysis of Expected Termination Time for Population Protocols. CONCUR Michael Blondin, Javier Esparza, Antonín Kucera
2018	J	`jnl`	Automatic Analysis of Expected Termination Time for Population Protocols. CoRR Michael Blondin, Javier Esparza, Antonín Kucera
2018	A	`conf`	Automatic Synthesis of Efficient Regular Strategies in Adversarial Patrolling Games. AAMAS David Klaska, Antonín Kucera, Tomás Lamser, Vojtech Rehák
2018	A*	`conf`	Black Ninjas in the Dark: Formal Analysis of Population Protocols. LICS Michael Blondin, Javier Esparza, Stefan Jaax, Antonín Kucera
2018	A*	`conf`	Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS. LICS Tomás Brázdil, Krishnendu Chatterjee, Antonín Kucera, Petr Novotný, Dominik Velan, Florian Zuleger
2018	J	`jnl`	Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS. CoRR Tomás Brázdil, Krishnendu Chatterjee, Antonín Kucera, Petr Novotný, Dominik Velan, Florian Zuleger
2018	A*	`conf`	Solving Patrolling Problems in the Internet Environment. IJCAI Tomás Brázdil, Antonín Kucera, Vojtech Rehák
2018	J	`jnl`	Synthesizing Efficient Solutions for Patrolling Problems in the Internet Environment. CoRR Tomás Brázdil, Antonín Kucera, Vojtech Rehák
2017	J	`jnl`	Efficient Algorithms for Checking Fast Termination in VASS. CoRR Tomás Brázdil, Krishnendu Chatterjee, Antonín Kucera, Petr Novotný, Dominik Velan
2017	—	`conf`	Mean-Payoff Optimization in Continuous-Time Markov Chains with Parametric Alarms. QEST Christel Baier, Clemens Dubslaff, Lubos Korenciak, Antonín Kucera, Vojtech Rehák
2017	J	`jnl`	Mean-Payoff Optimization in Continuous-Time Markov Chains with Parametric Alarms. CoRR Christel Baier, Clemens Dubslaff, Lubos Korenciak, Antonín Kucera, Vojtech Rehák
2017	J	`jnl`	Statement from EATCS President and vice Presidents about the recent US travel restrictions to foreigners. Bull. EATCS Paul G. Spirakis, Leslie Ann Goldberg, Antonín Kucera, Giuseppe Persiano
2017	B	`conf`	Synthesis of Optimal Resilient Control Strategies. ATVA Christel Baier, Clemens Dubslaff, Lubos Korenciak, Antonín Kucera, Vojtech Rehák
2017	J	`jnl`	Trading performance for stability in Markov decision processes. J. Comput. Syst. Sci. Tomás Brázdil, Krishnendu Chatterjee, Vojtech Forejt, Antonín Kucera
2016	B	`conf`	Efficient Timeout Synthesis in Fixed-Delay CTMC Using Policy Iteration. MASCOTS Lubos Korenciak, Antonín Kucera, Vojtech Rehák
2016	J	`jnl`	Efficient Timeout Synthesis in Fixed-Delay CTMC Using Policy Iteration. CoRR Lubos Korenciak, Antonín Kucera, Vojtech Rehák
2016	B	`conf`	Optimizing the Expected Mean Payoff in Energy Markov Decision Processes. ATVA Tomás Brázdil, Antonín Kucera, Petr Novotný
2016	J	`jnl`	Optimizing the Expected Mean Payoff in Energy Markov Decision Processes. CoRR Tomás Brázdil, Antonín Kucera, Petr Novotný
2016	A	`conf`	Regular Strategies and Strategy Improvement: Efficient Tools for Solving Large Patrolling Problems. AAMAS Antonín Kucera, Tomás Lamser
2016	B	`conf`	Stability in Graphs and Games. CONCUR Tomás Brázdil, Vojtech Forejt, Antonín Kucera, Petr Novotný
2016	J	`jnl`	Stability in Graphs and Games. CoRR Tomás Brázdil, Vojtech Forejt, Antonín Kucera, Petr Novotný
2015	B	`conf`	Cobra: A Tool for Solving General Deductive Games. LPAR Miroslav Klimos, Antonín Kucera
2015	A*	`conf`	Long-Run Average Behaviour of Probabilistic Vector Addition Systems. LICS Tomás Brázdil, Stefan Kiefer, Antonín Kucera, Petr Novotný
2015	J	`jnl`	Long-Run Average Behaviour of Probabilistic Vector Addition Systems. CoRR Tomás Brázdil, Stefan Kiefer, Antonín Kucera, Petr Novotný
2015	A	`conf`	MultiGain: A Controller Synthesis Tool for MDPs with Multiple Mean-Payoff Objectives. TACAS Tomás Brázdil, Krishnendu Chatterjee, Vojtech Forejt, Antonín Kucera
2015	J	`jnl`	MultiGain: A controller synthesis tool for MDPs with multiple mean-payoff objectives. CoRR Tomás Brázdil, Krishnendu Chatterjee, Vojtech Forejt, Antonín Kucera
2015	B	`conf`	On the Existence and Computability of Long-Run Average Properties in Probabilistic VASS. FCT Antonín Kucera
2015	J	`jnl`	Runtime analysis of probabilistic programs with unbounded recursion. J. Comput. Syst. Sci. Tomás Brázdil, Stefan Kiefer, Antonín Kucera, Ivana Hutarová Vareková
2015	J	`jnl`	Strategy Synthesis in Adversarial Patrolling Games. CoRR Tomás Brázdil, Petr Hlinený, Antonín Kucera, Vojtech Rehák, Matús Abaffy
2014	J	`jnl`	Branching-time model-checking of probabilistic pushdown automata. J. Comput. Syst. Sci. Tomás Brázdil, Václav Brozek, Vojtech Forejt, Antonín Kucera
2014	J	`jnl`	Efficient Analysis of Probabilistic Programs with an Unbounded Counter. J. ACM Tomás Brázdil, Stefan Kiefer, Antonín Kucera
2014	A*	`conf`	Minimizing Running Costs in Consumption Systems. CAV Tomás Brázdil, David Klaska, Antonín Kucera, Petr Novotný
2014	J	`jnl`	Minimizing Running Costs in Consumption Systems. CoRR Tomás Brázdil, David Klaska, Antonín Kucera, Petr Novotný
2014	A	`conf`	Solving adversarial patrolling games with bounded error: (extended abstract). AAMAS Michal Abaffy, Tomás Brázdil, Vojtech Rehák, Branislav Bosanský, Antonín Kucera, Jan Krcál
2014	J	`jnl`	Strategy Synthesis for General Deductive Games Based on SAT Solving. CoRR Miroslav Klimos, Antonín Kucera
2014	J	`jnl`	Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes Log. Methods Comput. Sci. Tomás Brázdil, Václav Brozek, Krishnendu Chatterjee, Vojtech Forejt, Antonín Kucera
2014	J	`jnl`	Zero-Reachability in Probabilistic Multi-Counter Automata. CoRR Tomás Brázdil, Stefan Kiefer, Antonín Kucera, Petr Novotný, Joost-Pieter Katoen
2014	—	`conf`	Zero-reachability in probabilistic multi-counter automata. CSL-LICS Tomás Brázdil, Stefan Kiefer, Antonín Kucera, Petr Novotný, Joost-Pieter Katoen
2013	J	`jnl`	Analyzing probabilistic pushdown automata. Formal Methods Syst. Des. Tomás Brázdil, Javier Esparza, Stefan Kiefer, Antonín Kucera
2013	J	`jnl`	Approximating the termination value of one-counter MDPs and stochastic games. Inf. Comput. Tomás Brázdil, Václav Brozek, Kousha Etessami, Antonín Kucera
2013	J	`jnl`	Continuous-time stochastic games with time-bounded reachability. Inf. Comput. Tomás Brázdil, Vojtech Forejt, Jan Krcál, Jan Kretínský, Antonín Kucera
2013	—	`ed.`	Mathematical and Engineering Methods in Computer Science, 8th International Doctoral Workshop, MEMICS 2012, Znojmo, Czech Republic, October 25-28, 2012, Revised Selected Papers MEMICS Antonín Kucera, Thomas A. Henzinger, Jaroslav Nesetril, Tomás Vojnar, David Antos
2013	J	`jnl`	Preface. Fundam. Informaticae Agata Ciabattoni, Rusins Freivalds, Antonín Kucera, Igor Potapov, Stefan Szeider
2013	J	`jnl`	The Presburger Award 2014 - Call for Nominations. Bull. EATCS Antonín Kucera
2013	J	`jnl`	Trading Performance for Stability in Markov Decision Processes CoRR Tomás Brázdil, Krishnendu Chatterjee, Vojtech Forejt, Antonín Kucera
2013	A*	`conf`	Trading Performance for Stability in Markov Decision Processes. LICS Tomás Brázdil, Krishnendu Chatterjee, Vojtech Forejt, Antonín Kucera
2012	J	`jnl`	Determinacy in Stochastic Games with Unbounded Payoff Functions CoRR Tomás Brázdil, Antonín Kucera, Petr Novotný
2012	—	`conf`	Determinacy in Stochastic Games with Unbounded Payoff Functions. MEMICS Tomás Brázdil, Antonín Kucera, Petr Novotný
2012	J	`jnl`	Efficient Controller Synthesis for Consumption Games with Multiple Resource Types CoRR Tomás Brázdil, Krishnendu Chatterjee, Antonín Kucera, Petr Novotný
2012	A*	`conf`	Efficient Controller Synthesis for Consumption Games with Multiple Resource Types. CAV Tomás Brázdil, Krishnendu Chatterjee, Antonín Kucera, Petr Novotný
2012	J	`jnl`	Minimizing Expected Termination Time in One-Counter Markov Decision Processes CoRR Tomás Brázdil, Antonín Kucera, Petr Novotný, Dominik Wojtczak
2012	—	`conf`	Minimizing Expected Termination Time in One-Counter Markov Decision Processes. ICALP (2) Tomás Brázdil, Antonín Kucera, Petr Novotný, Dominik Wojtczak
2012	—	`conf`	Playing Games with Counter Automata. RP Antonín Kucera
2012	J	`jnl`	Preface. Theor. Comput. Sci. Petr Hlinený, Antonín Kucera
2012	J	`jnl`	Stochastic game logic. Acta Informatica Christel Baier, Tomás Brázdil, Marcus Größer, Antonín Kucera
2011	J	`jnl`	Approximating the Termination Value of One-Counter MDPs and Stochastic Games CoRR Tomás Brázdil, Václav Brozek, Kousha Etessami, Antonín Kucera
2011	—	`conf`	Approximating the Termination Value of One-Counter MDPs and Stochastic Games. ICALP (2) Tomás Brázdil, Václav Brozek, Kousha Etessami, Antonín Kucera
2011	J	`jnl`	Efficient Analysis of Probabilistic Programs with an Unbounded Counter CoRR Tomás Brázdil, Stefan Kiefer, Antonín Kucera
2011	A*	`conf`	Efficient Analysis of Probabilistic Programs with an Unbounded Counter. CAV Tomás Brázdil, Stefan Kiefer, Antonín Kucera
2011	J	`jnl`	Measuring Performance of Continuous-Time Stochastic Processes using Timed Automata CoRR Tomás Brázdil, Jan Krcál, Jan Kretínský, Antonín Kucera, Vojtech Rehák
2011	—	`conf`	Measuring performance of continuous-time stochastic processes using timed automata. HSCC Tomás Brázdil, Jan Krcál, Jan Kretínský, Antonín Kucera, Vojtech Rehák
2011	J	`jnl`	Qualitative reachability in stochastic BPA games. Inf. Comput. Tomás Brázdil, Václav Brozek, Antonín Kucera, Jan Obdrzálek
2011	—	`conf`	Runtime Analysis of Probabilistic Programs with Unbounded Recursion. ICALP (2) Tomás Brázdil, Stefan Kiefer, Antonín Kucera, Ivana Hutarová Vareková
2011	—	`ch.`	Turn-based stochastic games. Lectures in Game Theory for Computer Scientists Antonín Kucera
2011	A*	`conf`	Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. LICS Tomás Brázdil, Václav Brozek, Krishnendu Chatterjee, Vojtech Forejt, Antonín Kucera
2010	—	`ch.`	Effective Analysis of Infinite State Stochastic Processes Games. Logics and Languages for Reliability and Security Antonín Kucera
2010	B	`ed.`	Mathematical Foundations of Computer Science 2010, 35th International Symposium, MFCS 2010, Brno, Czech Republic, August 23-27, 2010. Proceedings MFCS Petr Hlinený, Antonín Kucera
2010	J	`jnl`	On the complexity of checking semantic equivalences between pushdown processes and finite-state processes. Inf. Comput. Antonín Kucera, Richard Mayr
2010	A*	`conf`	One-Counter Markov Decision Processes. SODA Tomás Brázdil, Václav Brozek, Kousha Etessami, Antonín Kucera, Dominik Wojtczak
2010	J	`jnl`	Qualitative Reachability in Stochastic BPA Games CoRR Tomás Brázdil, Václav Brozek, Antonín Kucera, Jan Obdrzálek
2010	J	`jnl`	Reachability Games on Extended Vector Addition Systems with States CoRR Tomás Brázdil, Petr Jancar, Antonín Kucera
2010	—	`conf`	Reachability Games on Extended Vector Addition Systems with States. ICALP (2) Tomás Brázdil, Petr Jancar, Antonín Kucera
2010	—	`ed.`	Reachability Problems, 4th International Workshop, RP 2010, Brno, Czech Republic, August 28-29, 2010. Proceedings RP Antonín Kucera, Igor Potapov
2010	J	`jnl`	Runtime Analysis of Probabilistic Programs with Unbounded Recursion CoRR Tomás Brázdil, Stefan Kiefer, Antonín Kucera, Ivana Hutarová Vareková
2010	B	`conf`	Stochastic Real-Time Games with Qualitative Timed Automata Objectives. CONCUR Tomás Brázdil, Jan Krcál, Jan Kretínský, Antonín Kucera, Vojtech Rehák
2009	—	`conf`	Continuous-Time Stochastic Games with Time-Bounded Reachability. FSTTCS Tomás Brázdil, Vojtech Forejt, Jan Krcál, Jan Kretínský, Antonín Kucera
2009	J	`jnl`	One-Counter Markov Decision Processes CoRR Tomás Brázdil, Václav Brozek, Kousha Etessami, Antonín Kucera, Dominik Wojtczak
2009	A	`conf`	Qualitative Reachability in Stochastic BPA Games. STACS Tomás Brázdil, Václav Brozek, Antonín Kucera, Jan Obdrzálek
2009	B	`ed.`	SOFSEM 2009: Theory and Practice of Computer Science, 35th Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Mlýn, Czech Republic, January 24-30, 2009. Proceedings SOFSEM Mogens Nielsen, Antonín Kucera, Peter Bro Miltersen, Catuscia Palamidessi, Petr Tuma, Frank D. Valencia
2008	—	`conf`	Controller Synthesis and Verification for Markov Decision Processes with Qualitative Branching Time Objectives. ICALP (2) Tomás Brázdil, Vojtech Forejt, Antonín Kucera
2008	J	`jnl`	Deciding probabilistic bisimilarity over infinite-state probabilistic systems. Acta Informatica Tomás Brázdil, Antonín Kucera, Oldrich Strazovský
2008	B	`conf`	Discounted Properties of Probabilistic Pushdown Automata. LPAR Tomás Brázdil, Václav Brozek, Jan Holecek, Antonín Kucera
2008	J	`jnl`	On the Controller Synthesis for Finite-State Markov Decision Processes. Fundam. Informaticae Antonín Kucera, Oldrich Strazovský
2008	J	`jnl`	Reachability in recursive Markov decision processes. Inf. Comput. Tomás Brázdil, Václav Brozek, Vojtech Forejt, Antonín Kucera
2008	A*	`conf`	The Satisfiability Problem for Probabilistic CTL. LICS Tomás Brázdil, Vojtech Forejt, Jan Kretínský, Antonín Kucera
2007	B	`ed.`	Mathematical Foundations of Computer Science 2007, 32nd International Symposium, MFCS 2007, Ceský Krumlov, Czech Republic, August 26-31, 2007, Proceedings MFCS Ludek Kucera, Antonín Kucera
2007	—	`conf`	Stochastic Game Logic. QEST Christel Baier, Tomás Brázdil, Marcus Größer, Antonín Kucera
2006	J	`jnl`	A general approach to comparing infinite-state systems with their finite-state specifications. Theor. Comput. Sci. Antonín Kucera, Philippe Schnoebelen
2006	J	`jnl`	Equivalence-checking on infinite-state systems: Techniques and results. Theory Pract. Log. Program. Antonín Kucera, Petr Jancar
2006	J	`jnl`	Model Checking Probabilistic Pushdown Automata. Log. Methods Comput. Sci. Antonín Kucera, Javier Esparza, Richard Mayr
2006	B	`conf`	Reachability in Recursive Markov Decision Processes. CONCUR Tomás Brázdil, Václav Brozek, Vojtech Forejt, Antonín Kucera
2006	A*	`conf`	Stochastic Games with Branching-Time Winning Objectives. LICS Tomás Brázdil, Václav Brozek, Vojtech Forejt, Antonín Kucera
2005	A*	`conf`	Analysis and Prediction of the Long-Run Behavior of Probabilistic Sequential Programs with Recursion (Extended Abstract). FOCS Tomás Brázdil, Javier Esparza, Antonín Kucera
2005	B	`conf`	Characteristic Patterns for LTL. SOFSEM Antonín Kucera, Jan Strejcek
2005	—	`conf`	Computing the Expected Accumulated Reward and Gain for a Subclass of Infinite Markov Chains. FSTTCS Tomás Brázdil, Antonín Kucera
2005	J	`jnl`	Equivalence-Checking on Infinite-State Systems: Techniques and Results CoRR Antonín Kucera, Petr Jancar
2005	—	`conf`	Methods for Quantitative Analysis of Probabilistic Pushdown Automata. INFINITY Antonín Kucera
2005	J	`jnl`	Model Checking Probabilistic Pushdown Automata CoRR Javier Esparza, Antonín Kucera, Richard Mayr
2005	—	`conf`	On the Controller Synthesis for Finite-State Markov Decision Processes. FSTTCS Antonín Kucera, Oldrich Strazovský
2005	A	`conf`	On the Decidability of Temporal Properties of Probabilistic Pushdown Automata. STACS Tomás Brázdil, Antonín Kucera, Oldrich Strazovský
2005	A*	`conf`	Quantitative Analysis of Probabilistic Pushdown Automata: Expectations and Variances. LICS Javier Esparza, Antonín Kucera, Richard Mayr
2005	J	`jnl`	The stuttering principle revisited. Acta Informatica Antonín Kucera, Jan Strejcek
2004	B	`conf`	A General Approach to Comparing Infinite-State Systems with Their Finite-State Specifications. CONCUR Antonín Kucera, Philippe Schnoebelen
2004	—	`conf`	A Generic Framework for Checking Semantic Equivalences between Pushdown Automata and Finite-State Automata. IFIP TCS Antonín Kucera, Richard Mayr
2004	J	`jnl`	DP lower bounds for equivalence-checking and model-checking of one-counter automata. Inf. Comput. Petr Jancar, Antonín Kucera, Faron Moller, Zdenek Sawa
2004	B	`conf`	Deciding Probabilistic Bisimilarity Over Infinite-State Probabilistic Systems. CONCUR Tomás Brázdil, Antonín Kucera, Oldrich Strazovský
2004	A*	`conf`	Model Checking Probabilistic Pushdown Automata. LICS Javier Esparza, Antonín Kucera, Richard Mayr
2003	—	`ed.`	4th International Workshop on Verification of Infinite-State Systems (CONCUR 2002 Satellite Workshop), Infinity 2002, Brno, Czech Republic, August 24, 2002 INFINITY Antonín Kucera, Richard Mayr
2003	J	`jnl`	A Logical Viewpoint on Process-algebraic Quotients. J. Log. Comput. Antonín Kucera, Javier Esparza
2003	B	`conf`	Deciding Bisimilarity between BPA and BPP Processes. CONCUR Petr Jancar, Antonín Kucera, Faron Moller
2003	J	`jnl`	Model checking LTL with regular valuations for pushdown systems. Inf. Comput. Javier Esparza, Antonín Kucera, Stefan Schwoon
2003	—	`conf`	On Homogeneous Segments. TSD Robert Batusek, Ivan Kopecek, Antonín Kucera
2003	J	`jnl`	The complexity of bisimilarity-checking for one-counter processes. Theor. Comput. Sci. Antonín Kucera
2002	B	`ed.`	CONCUR 2002 - Concurrency Theory, 13th International Conference, Brno, Czech Republic, August 20-23, 2002, Proceedings CONCUR Lubos Brim, Petr Jancar, Mojmír Kretínský, Antonín Kucera
2002	B	`conf`	Equivalence-Checking with Infinite-State Systems: Techniques and Results. SOFSEM Antonín Kucera, Petr Jancar
2002	B	`conf`	Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds. FoSSaCS Petr Jancar, Antonín Kucera, Faron Moller, Zdenek Sawa
2002	B	`conf`	On the Complexity of Semantic Equivalences for Pushdown Automata and BPA. MFCS Antonín Kucera, Richard Mayr
2002	—	`conf`	Preface. INFINITY Antonín Kucera, Richard Mayr
2002	J	`jnl`	Simulation Preorder over Simple Process Algebras. Inf. Comput. Antonín Kucera, Richard Mayr
2002	B	`conf`	The Stuttering Principle Revisited: On the Expressiveness of Nested X and U Operators in the Logic LTL. CSL Antonín Kucera, Jan Strejcek
2002	J	`jnl`	Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time. Theor. Comput. Sci. Antonín Kucera, Richard Mayr
2002	B	`conf`	Why Is Simulation Harder than Bisimulation? CONCUR Antonín Kucera, Richard Mayr
2001	J	`jnl`	Deciding bisimulation-like equivalences with finite-state processes. Theor. Comput. Sci. Petr Jancar, Antonín Kucera, Richard Mayr
2001	—	`conf`	Model-Checking LTL with Regular Valuations for Pushdown Systems. TACS Javier Esparza, Antonín Kucera, Stefan Schwoon
2000	J	`jnl`	Effective decomposability of sequential behaviours. Theor. Comput. Sci. Antonín Kucera
2000	A*	`conf`	Efficient Verification Algorithms for One-Counter Processes. ICALP Antonín Kucera
2000	—	`conf`	On Simulation-Checking with Sequential Systems. ASIAN Antonín Kucera
2000	A	`conf`	Simulation and Bisimulation over One-Counter Processes. STACS Petr Jancar, Antonín Kucera, Faron Moller
1999	B	`conf`	A Logical Viewpoint on Process-Algebraic Quotients. CSL Antonín Kucera, Javier Esparza
1999	J	`jnl`	Comparing Expressibility of Normed BPA and Normed BPP Processes. Acta Informatica Ivana Cerná, Mojmír Kretínský, Antonín Kucera
1999	J	`jnl`	On Finite Representations of Infinite-State Behaviours. Inf. Process. Lett. Antonín Kucera
1999	J	`jnl`	Regularity of Normed PA Processes. Inf. Process. Lett. Antonín Kucera
1999	A*	`conf`	Simulation Preorder on Simple Process Algebras. ICALP Antonín Kucera, Richard Mayr
1999	B	`conf`	Weak Bisimilarity with Infinite-State Systems Can Be Decided in Polynomial Time. CONCUR Antonín Kucera, Richard Mayr
1998	A*	`conf`	Deciding Bisimulation-Like Equivalences with Finite-State Processes. ICALP Petr Jancar, Antonín Kucera, Richard Mayr
1997	—	`conf`	Bisimilarity of processes with finite-state systems. INFINITY Petr Jancar, Antonín Kucera
1997	B	`conf`	How to Parallelize Sequential Processes. CONCUR Antonín Kucera
1997	B	`conf`	On Finite Representations of Infinite-State Behaviours. SOFSEM Antonín Kucera
1996	—	`conf`	Bisimilarity is decidable in the union of normed BPA and normed BPP processes. INFINITY Ivana Cerná, Mojmír Kretínský, Antonín Kucera
1996	B	`conf`	Regularity is Decidable for Normed BPA and Normed BPP Processes in Polynomial Time. SOFSEM Antonín Kucera
1996	—	`conf`	Regularity is Decidable for Normed PA Processes in Polynomial Time. FSTTCS Antonín Kucera