Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDAntonín Kucera 0001
Person information
- affiliation: Masaryk University, Brno, Czech Republic
Other persons with the same name
- Antonín Kucera 0002
![[0000-0003-4043-7218]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0003-4043-7218")
— Charles University, Faculty of Mathematics and Physics, Prague, Czech Republic
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2021
[c79]Michal Ajdarów, Antonín Kucera:
Deciding Polynomial Termination Complexity for VASS Programs. CONCUR 2021: 30:1-30:15- [c78]Miroslav Chodil, Antonín Kucera:
The Satisfiability Problem for a Quantitative Fragment of PCTL. FCT 2021: 149-161 - [i32]Michal Ajdarów, Antonín Kucera:
Deciding Polynomial Termination Complexity for VASS Programs. CoRR abs/2102.06889 (2021) - [i31]Miroslav Chodil, Antonín Kucera:
The Satisfiability Problem for a Quantitative Fragment of PCTL. CoRR abs/2107.03794 (2021) - [i30]David Klaska, Antonín Kucera, Vít Musil, Vojtech Rehák:
Regstar: Efficient Strategy Synthesis for Adversarial Patrolling Games. CoRR abs/2108.08950 (2021) - 2020
- [c77]David Klaska, Antonín Kucera, Vojtech Rehák:
Adversarial Patrolling with Drones. AAMAS 2020: 629-637 - [c76]Michael Blondin, Javier Esparza, Martin Helfrich, Antonín Kucera, Philipp J. Meyer:
Checking Qualitative Liveness Properties of Replicated Systems with Stochastic Scheduling. CAV (2) 2020: 372-397 - [c75]Antonín Kucera, Jérôme Leroux, Dominik Velan:
Efficient Analysis of VASS Termination Complexity. LICS 2020: 676-688 - [i29]Michael Blondin, Javier Esparza, Martin Helfrich, Antonín Kucera, Philipp J. Meyer:
Checking Qualitative Liveness Properties of Replicated Systems with Stochastic Scheduling. CoRR abs/2005.03555 (2020)
2010 – 2019
- 2019
- [j34]Christel Baier, Clemens Dubslaff, Lubos Korenciak, Antonín Kucera, Vojtech Rehák:
Mean-payoff Optimization in Continuous-time Markov Chains with Parametric Alarms. ACM Trans. Model. Comput. Simul. 29(4): 28:1-28:26 (2019) - [c74]Tomás Brázdil, Krishnendu Chatterjee, Antonín Kucera, Petr Novotný, Dominik Velan:
Deciding Fast Termination for Probabilistic VASS with Nondeterminism. ATVA 2019: 462-478 - [i28]Tomás Brázdil, Krishnendu Chatterjee, Antonín Kucera, Petr Novotný, Dominik Velan:
Deciding Fast Termination for Probabilistic VASS with Nondeterminism. CoRR abs/1907.11010 (2019) - 2018
- [j33]Antonín Kucera, Richard Mayr:
A generic framework for checking semantic equivalences between pushdown automata and finite-state automata. J. Comput. Syst. Sci. 91: 82-103 (2018) - [c73]David Klaska, Antonín Kucera, Tomás Lamser, Vojtech Rehák:
Automatic Synthesis of Efficient Regular Strategies in Adversarial Patrolling Games. AAMAS 2018: 659-666 - [c72]Michael Blondin, Javier Esparza, Antonín Kucera:
Automatic Analysis of Expected Termination Time for Population Protocols. CONCUR 2018: 33:1-33:16 - [c71]Tomás Brázdil, Antonín Kucera, Vojtech Rehák:
Solving Patrolling Problems in the Internet Environment. IJCAI 2018: 121-127 - [c70]Michael Blondin, Javier Esparza, Stefan Jaax, Antonín Kucera:
Black Ninjas in the Dark: Formal Analysis of Population Protocols. LICS 2018: 1-10 - [c69]Tomás Brázdil, Krishnendu Chatterjee, Antonín Kucera, Petr Novotný, Dominik Velan, Florian Zuleger:
Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS. LICS 2018: 185-194 - [i27]Tomás Brázdil, Krishnendu Chatterjee, Antonín Kucera, Petr Novotný, Dominik Velan, Florian Zuleger:
Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS. CoRR abs/1804.10985 (2018) - [i26]Tomás Brázdil, Antonín Kucera, Vojtech Rehák:
Synthesizing Efficient Solutions for Patrolling Problems in the Internet Environment. CoRR abs/1805.02861 (2018) - [i25]Michael Blondin, Javier Esparza, Antonín Kucera:
Automatic Analysis of Expected Termination Time for Population Protocols. CoRR abs/1807.00331 (2018) - 2017
- [j32]Tomás Brázdil, Krishnendu Chatterjee, Vojtech Forejt, Antonín Kucera:
Trading performance for stability in Markov decision processes. J. Comput. Syst. Sci. 84: 144-170 (2017) - [c68]Christel Baier, Clemens Dubslaff, Lubos Korenciak, Antonín Kucera, Vojtech Rehák:
Synthesis of Optimal Resilient Control Strategies. ATVA 2017: 417-434 - [c67]Christel Baier, Clemens Dubslaff, Lubos Korenciak, Antonín Kucera, Vojtech Rehák:
Mean-Payoff Optimization in Continuous-Time Markov Chains with Parametric Alarms. QEST 2017: 190-206 - [i24]Christel Baier, Clemens Dubslaff, Lubos Korenciak, Antonín Kucera, Vojtech Rehák:
Mean-Payoff Optimization in Continuous-Time Markov Chains with Parametric Alarms. CoRR abs/1706.06486 (2017) - [i23]Tomás Brázdil, Krishnendu Chatterjee, Antonín Kucera, Petr Novotný, Dominik Velan:
Efficient Algorithms for Checking Fast Termination in VASS. CoRR abs/1708.09253 (2017) - 2016
- [c66]Antonín Kucera, Tomás Lamser:
Regular Strategies and Strategy Improvement: Efficient Tools for Solving Large Patrolling Problems. AAMAS 2016: 1171-1179 - [c65]Tomás Brázdil, Antonín Kucera, Petr Novotný:
Optimizing the Expected Mean Payoff in Energy Markov Decision Processes. ATVA 2016: 32-49 - [c64]Tomás Brázdil, Vojtech Forejt, Antonín Kucera, Petr Novotný:
Stability in Graphs and Games. CONCUR 2016: 10:1-10:14 - [c63]Lubos Korenciak, Antonín Kucera, Vojtech Rehák:
Efficient Timeout Synthesis in Fixed-Delay CTMC Using Policy Iteration. MASCOTS 2016: 367-372 - [i22]Tomás Brázdil, Vojtech Forejt, Antonín Kucera, Petr Novotný:
Stability in Graphs and Games. CoRR abs/1604.06386 (2016) - [i21]Lubos Korenciak, Antonín Kucera, Vojtech Rehák:
Efficient Timeout Synthesis in Fixed-Delay CTMC Using Policy Iteration. CoRR abs/1607.00372 (2016) - [i20]Tomás Brázdil, Antonín Kucera, Petr Novotný:
Optimizing the Expected Mean Payoff in Energy Markov Decision Processes. CoRR abs/1607.00678 (2016) - 2015
- [j31]Tomás Brázdil, Stefan Kiefer, Antonín Kucera, Ivana Hutarová Vareková:
Runtime analysis of probabilistic programs with unbounded recursion. J. Comput. Syst. Sci. 81(1): 288-310 (2015) - [c62]Antonín Kucera:
On the Existence and Computability of Long-Run Average Properties in Probabilistic VASS. FCT 2015: 12-24 - [c61]Tomás Brázdil, Stefan Kiefer, Antonín Kucera, Petr Novotný:
Long-Run Average Behaviour of Probabilistic Vector Addition Systems. LICS 2015: 44-55 - [c60]Miroslav Klimos, Antonín Kucera:
Cobra: A Tool for Solving General Deductive Games. LPAR 2015: 31-47 - [c59]Tomás Brázdil, Krishnendu Chatterjee, Vojtech Forejt, Antonín Kucera:
MultiGain: A Controller Synthesis Tool for MDPs with Multiple Mean-Payoff Objectives. TACAS 2015: 181-187 - [i19]Tomás Brázdil, Krishnendu Chatterjee, Vojtech Forejt, Antonín Kucera:
MultiGain: A controller synthesis tool for MDPs with multiple mean-payoff objectives. CoRR abs/1501.03093 (2015) - [i18]Tomás Brázdil, Stefan Kiefer, Antonín Kucera, Petr Novotný:
Long-Run Average Behaviour of Probabilistic Vector Addition Systems. CoRR abs/1505.02655 (2015) - [i17]Tomás Brázdil, Petr Hlinený, Antonín Kucera, Vojtech Rehák, Matús Abaffy:
Strategy Synthesis in Adversarial Patrolling Games. CoRR abs/1507.03407 (2015) - 2014
- [j30]Tomás Brázdil, Václav Brozek, Krishnendu Chatterjee, Vojtech Forejt, Antonín Kucera:
Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. Log. Methods Comput. Sci. 10(1) (2014) - [j29]Tomás Brázdil, Stefan Kiefer, Antonín Kucera:
Efficient Analysis of Probabilistic Programs with an Unbounded Counter. J. ACM 61(6): 41:1-41:35 (2014) - [j28]Tomás Brázdil, Václav Brozek, Vojtech Forejt, Antonín Kucera:
Branching-time model-checking of probabilistic pushdown automata. J. Comput. Syst. Sci. 80(1): 139-156 (2014) - [c58]Michal Abaffy, Tomás Brázdil, Vojtech Rehák, Branislav Bosanský, Antonín Kucera, Jan Krcál:
Solving adversarial patrolling games with bounded error: (extended abstract). AAMAS 2014: 1617-1618 - [c57]Tomás Brázdil, David Klaska, Antonín Kucera, Petr Novotný:
Minimizing Running Costs in Consumption Systems. CAV 2014: 457-472 - [c56]Tomás Brázdil, Stefan Kiefer, Antonín Kucera, Petr Novotný, Joost-Pieter Katoen:
Zero-reachability in probabilistic multi-counter automata. CSL-LICS 2014: 22:1-22:10 - [i16]Tomás Brázdil, Stefan Kiefer, Antonín Kucera, Petr Novotný, Joost-Pieter Katoen:
Zero-Reachability in Probabilistic Multi-Counter Automata. CoRR abs/1401.6840 (2014) - [i15]Tomás Brázdil, David Klaska, Antonín Kucera, Petr Novotný:
Minimizing Running Costs in Consumption Systems. CoRR abs/1402.4995 (2014) - [i14]Miroslav Klimos, Antonín Kucera:
Strategy Synthesis for General Deductive Games Based on SAT Solving. CoRR abs/1407.3926 (2014) - 2013
- [j27]Antonín Kucera:
The Presburger Award 2014 - Call for Nominations. Bull. EATCS 111 (2013) - [j26]Tomás Brázdil, Javier Esparza, Stefan Kiefer, Antonín Kucera:
Analyzing probabilistic pushdown automata. Formal Methods Syst. Des. 43(2): 124-163 (2013) - [j25]Agata Ciabattoni, Rusins Freivalds, Antonín Kucera, Igor Potapov, Stefan Szeider:
Preface. Fundam. Informaticae 123(1) (2013) - [j24]Tomás Brázdil, Václav Brozek, Kousha Etessami, Antonín Kucera:
Approximating the termination value of one-counter MDPs and stochastic games. Inf. Comput. 222: 121-138 (2013) - [j23]Tomás Brázdil, Vojtech Forejt, Jan Krcál, Jan Kretínský, Antonín Kucera:
Continuous-time stochastic games with time-bounded reachability. Inf. Comput. 224: 46-70 (2013) - [c55]Tomás Brázdil, Krishnendu Chatterjee, Vojtech Forejt, Antonín Kucera:
Trading Performance for Stability in Markov Decision Processes. LICS 2013: 331-340 - [e6]Antonín Kucera, Thomas A. Henzinger, Jaroslav Nesetril, Tomás Vojnar, David Antos:
Mathematical and Engineering Methods in Computer Science, 8th International Doctoral Workshop, MEMICS 2012, Znojmo, Czech Republic, October 25-28, 2012, Revised Selected Papers. Lecture Notes in Computer Science 7721, Springer 2013, ISBN 978-3-642-36044-2 [contents] - [i13]Tomás Brázdil, Krishnendu Chatterjee, Vojtech Forejt, Antonín Kucera:
Trading Performance for Stability in Markov Decision Processes. CoRR abs/1305.4103 (2013) - 2012
- [j22]Christel Baier, Tomás Brázdil, Marcus Größer, Antonín Kucera:
Stochastic game logic. Acta Informatica 49(4): 203-224 (2012) - [j21]Petr Hlinený, Antonín Kucera:
Preface. Theor. Comput. Sci. 417: 1 (2012) - [c54]Tomás Brázdil, Krishnendu Chatterjee, Antonín Kucera, Petr Novotný:
Efficient Controller Synthesis for Consumption Games with Multiple Resource Types. CAV 2012: 23-38 - [c53]Tomás Brázdil, Antonín Kucera, Petr Novotný, Dominik Wojtczak:
Minimizing Expected Termination Time in One-Counter Markov Decision Processes. ICALP (2) 2012: 141-152 - [c52]Tomás Brázdil, Antonín Kucera, Petr Novotný:
Determinacy in Stochastic Games with Unbounded Payoff Functions. MEMICS 2012: 94-105 - [c51]Antonín Kucera:
Playing Games with Counter Automata. RP 2012: 29-41 - [i12]Tomás Brázdil, Krishnendu Chatterjee, Antonín Kucera, Petr Novotný:
Efficient Controller Synthesis for Consumption Games with Multiple Resource Types. CoRR abs/1202.0796 (2012) - [i11]Tomás Brázdil, Antonín Kucera, Petr Novotný, Dominik Wojtczak:
Minimizing Expected Termination Time in One-Counter Markov Decision Processes. CoRR abs/1205.1473 (2012) - [i10]Tomás Brázdil, Antonín Kucera, Petr Novotný:
Determinacy in Stochastic Games with Unbounded Payoff Functions. CoRR abs/1208.1639 (2012) - 2011
- [j20]Tomás Brázdil, Václav Brozek, Antonín Kucera, Jan Obdrzálek:
Qualitative reachability in stochastic BPA games. Inf. Comput. 209(8): 1160-1183 (2011) - [c50]Tomás Brázdil, Stefan Kiefer, Antonín Kucera:
Efficient Analysis of Probabilistic Programs with an Unbounded Counter. CAV 2011: 208-224 - [c49]Tomás Brázdil, Jan Krcál, Jan Kretínský, Antonín Kucera, Vojtech Rehák:
Measuring performance of continuous-time stochastic processes using timed automata. HSCC 2011: 33-42 - [c48]Tomás Brázdil, Stefan Kiefer, Antonín Kucera, Ivana Hutarová Vareková:
Runtime Analysis of Probabilistic Programs with Unbounded Recursion. ICALP (2) 2011: 319-331 - [c47]Tomás Brázdil, Václav Brozek, Kousha Etessami, Antonín Kucera:
Approximating the Termination Value of One-Counter MDPs and Stochastic Games. ICALP (2) 2011: 332-343 - [c46]Tomás Brázdil, Václav Brozek, Krishnendu Chatterjee, Vojtech Forejt, Antonín Kucera:
Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. LICS 2011: 33-42 - [p2]Antonín Kucera:
Turn-based stochastic games. Lectures in Game Theory for Computer Scientists 2011: 146-184 - [i9]Tomás Brázdil, Jan Krcál, Jan Kretínský, Antonín Kucera, Vojtech Rehák:
Measuring Performance of Continuous-Time Stochastic Processes using Timed Automata. CoRR abs/1101.4204 (2011) - [i8]Tomás Brázdil, Stefan Kiefer, Antonín Kucera:
Efficient Analysis of Probabilistic Programs with an Unbounded Counter. CoRR abs/1102.2529 (2011) - [i7]Tomás Brázdil, Václav Brozek, Kousha Etessami, Antonín Kucera:
Approximating the Termination Value of One-Counter MDPs and Stochastic Games. CoRR abs/1104.4978 (2011) - 2010
- [j19]Antonín Kucera, Richard Mayr:
On the complexity of checking semantic equivalences between pushdown processes and finite-state processes. Inf. Comput. 208(7): 772-796 (2010) - [c45]Tomás Brázdil, Jan Krcál, Jan Kretínský, Antonín Kucera, Vojtech Rehák:
Stochastic Real-Time Games with Qualitative Timed Automata Objectives. CONCUR 2010: 207-221 - [c44]Tomás Brázdil, Petr Jancar, Antonín Kucera:
Reachability Games on Extended Vector Addition Systems with States. ICALP (2) 2010: 478-489 - [c43]Tomás Brázdil, Václav Brozek, Kousha Etessami, Antonín Kucera, Dominik Wojtczak:
One-Counter Markov Decision Processes. SODA 2010: 863-874 - [p1]Antonín Kucera:
Effective Analysis of Infinite State Stochastic Processes Games. Logics and Languages for Reliability and Security 2010: 155-178 - [e5]Petr Hlinený, Antonín Kucera:
Mathematical Foundations of Computer Science 2010, 35th International Symposium, MFCS 2010, Brno, Czech Republic, August 23-27, 2010. Proceedings. Lecture Notes in Computer Science 6281, Springer 2010, ISBN 978-3-642-15154-5 [contents] - [i6]Tomás Brázdil, Petr Jancar, Antonín Kucera:
Reachability Games on Extended Vector Addition Systems with States. CoRR abs/1002.2557 (2010) - [i5]Tomás Brázdil, Václav Brozek, Antonín Kucera, Jan Obdrzálek:
Qualitative Reachability in Stochastic BPA Games. CoRR abs/1003.0118 (2010) - [i4]Tomás Brázdil, Stefan Kiefer, Antonín Kucera, Ivana Hutarová Vareková:
Runtime Analysis of Probabilistic Programs with Unbounded Recursion. CoRR abs/1007.1710 (2010)
2000 – 2009
- 2009
- [c42]Tomás Brázdil, Vojtech Forejt, Jan Krcál, Jan Kretínský, Antonín Kucera:
Continuous-Time Stochastic Games with Time-Bounded Reachability. FSTTCS 2009: 61-72 - [c41]Tomás Brázdil, Václav Brozek, Antonín Kucera, Jan Obdrzálek:
Qualitative Reachability in Stochastic BPA Games. STACS 2009: 207-218 - [e4]Mogens Nielsen, Antonín Kucera, Peter Bro Miltersen, Catuscia Palamidessi, Petr Tuma, Frank D. Valencia:
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. Lecture Notes in Computer Science 5404, Springer 2009, ISBN 978-3-540-95890-1 [contents] - [i3]Tomás Brázdil, Václav Brozek, Kousha Etessami, Antonín Kucera, Dominik Wojtczak:
One-Counter Markov Decision Processes. CoRR abs/0904.2511 (2009) - 2008
- [j18]Tomás Brázdil, Antonín Kucera, Oldrich Strazovský:
Deciding probabilistic bisimilarity over infinite-state probabilistic systems. Acta Informatica 45(2): 131-154 (2008) - [j17]Antonín Kucera, Oldrich Strazovský:
On the Controller Synthesis for Finite-State Markov Decision Processes. Fundam. Informaticae 82(1-2): 141-153 (2008) - [j16]Tomás Brázdil, Václav Brozek, Vojtech Forejt, Antonín Kucera:
Reachability in recursive Markov decision processes. Inf. Comput. 206(5): 520-537 (2008) - [c40]Tomás Brázdil, Vojtech Forejt, Antonín Kucera:
Controller Synthesis and Verification for Markov Decision Processes with Qualitative Branching Time Objectives. ICALP (2) 2008: 148-159 - [c39]Tomás Brázdil, Vojtech Forejt, Jan Kretínský, Antonín Kucera:
The Satisfiability Problem for Probabilistic CTL. LICS 2008: 391-402 - [c38]Tomás Brázdil, Václav Brozek, Jan Holecek, Antonín Kucera:
Discounted Properties of Probabilistic Pushdown Automata. LPAR 2008: 230-242 - 2007
- [c37]Christel Baier, Tomás Brázdil, Marcus Größer, Antonín Kucera:
Stochastic Game Logic. QEST 2007: 227-236 - [e3]Ludek Kucera, Antonín Kucera:
Mathematical Foundations of Computer Science 2007, 32nd International Symposium, MFCS 2007, Ceský Krumlov, Czech Republic, August 26-31, 2007, Proceedings. Lecture Notes in Computer Science 4708, Springer 2007, ISBN 978-3-540-74455-9 [contents] - 2006
- [j15]Antonín Kucera, Javier Esparza, Richard Mayr:
Model Checking Probabilistic Pushdown Automata. Log. Methods Comput. Sci. 2(1) (2006) - [j14]Antonín Kucera, Philippe Schnoebelen:
A general approach to comparing infinite-state systems with their finite-state specifications. Theor. Comput. Sci. 358(2-3): 315-333 (2006) - [j13]Antonín Kucera, Petr Jancar:
Equivalence-checking on infinite-state systems: Techniques and results. Theory Pract. Log. Program. 6(3): 227-264 (2006) - [c36]Tomás Brázdil, Václav Brozek, Vojtech Forejt, Antonín Kucera:
Reachability in Recursive Markov Decision Processes. CONCUR 2006: 358-374 - [c35]Tomás Brázdil, Václav Brozek, Vojtech Forejt, Antonín Kucera:
Stochastic Games with Branching-Time Winning Objectives. LICS 2006: 349-358 - 2005
- [j12]Antonín Kucera, Jan Strejcek:
The stuttering principle revisited. Acta Informatica 41(7-8): 415-434 (2005) - [c34]Tomás Brázdil, Javier Esparza, Antonín Kucera:
Analysis and Prediction of the Long-Run Behavior of Probabilistic Sequential Programs with Recursion (Extended Abstract). FOCS 2005: 521-530 - [c33]Tomás Brázdil, Antonín Kucera:
Computing the Expected Accumulated Reward and Gain for a Subclass of Infinite Markov Chains. FSTTCS 2005: 372-383 - [c32]Antonín Kucera, Oldrich Strazovský:
On the Controller Synthesis for Finite-State Markov Decision Processes. FSTTCS 2005: 541-552 - [c31]Javier Esparza, Antonín Kucera, Richard Mayr:
Quantitative Analysis of Probabilistic Pushdown Automata: Expectations and Variances. LICS 2005: 117-126 - [c30]Antonín Kucera, Jan Strejcek:
Characteristic Patterns for LTL. SOFSEM 2005: 239-249 - [c29]Tomás Brázdil, Antonín Kucera, Oldrich Strazovský:
On the Decidability of Temporal Properties of Probabilistic Pushdown Automata. STACS 2005: 145-157 - [c28]Antonín Kucera:
Methods for Quantitative Analysis of Probabilistic Pushdown Automata. INFINITY 2005: 3-15 - [i2]Antonín Kucera, Petr Jancar:
Equivalence-Checking on Infinite-State Systems: Techniques and Results. CoRR abs/cs/0505025 (2005) - [i1]Javier Esparza, Antonín Kucera, Richard Mayr:
Model Checking Probabilistic Pushdown Automata. CoRR abs/cs/0508003 (2005) - 2004
- [j11]Petr Jancar, Antonín Kucera, Faron Moller, Zdenek Sawa:
DP lower bounds for equivalence-checking and model-checking of one-counter automata. Inf. Comput. 188(1): 1-19 (2004) - [c27]Tomás Brázdil, Antonín Kucera, Oldrich Strazovský:
Deciding Probabilistic Bisimilarity Over Infinite-State Probabilistic Systems. CONCUR 2004: 193-208 - [c26]Antonín Kucera, Philippe Schnoebelen:
A General Approach to Comparing Infinite-State Systems with Their Finite-State Specifications. CONCUR 2004: 371-386 - [c25]Antonín Kucera, Richard Mayr:
A Generic Framework for Checking Semantic Equivalences between Pushdown Automata and Finite-State Automata. IFIP TCS 2004: 395-408 - [c24]Javier Esparza, Antonín Kucera, Richard Mayr:
Model Checking Probabilistic Pushdown Automata. LICS 2004: 12-21 - 2003
- [j10]Javier Esparza, Antonín Kucera, Stefan Schwoon:
Model checking LTL with regular valuations for pushdown systems. Inf. Comput. 186(2): 355-376 (2003) - [j9]Antonín Kucera, Javier Esparza:
A Logical Viewpoint on Process-algebraic Quotients. J. Log. Comput. 13(6): 863-880 (2003) - [j8]Antonín Kucera:
The complexity of bisimilarity-checking for one-counter processes. Theor. Comput. Sci. 304(1-3): 157-183 (2003) - [c23]Petr Jancar, Antonín Kucera, Faron Moller:
Deciding Bisimilarity between BPA and BPP Processes. CONCUR 2003: 157-171 - [c22]Robert Batusek, Ivan Kopecek, Antonín Kucera:
On Homogeneous Segments. TSD 2003: 152-157 - [e2]Antonín Kucera, Richard Mayr:
4th International Workshop on Verification of Infinite-State Systems (CONCUR 2002 Satellite Workshop), Infinity 2002, Brno, Czech Republic, August 24, 2002. Electronic Notes in Theoretical Computer Science 68(6), Elsevier 2003 [contents] - 2002
- [j7]Antonín Kucera, Richard Mayr:
Simulation Preorder over Simple Process Algebras. Inf. Comput. 173(2): 184-198 (2002) - [j6]Antonín Kucera, Richard Mayr:
Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time. Theor. Comput. Sci. 270(1-2): 677-700 (2002) - [c21]Antonín Kucera, Richard Mayr:
Why Is Simulation Harder than Bisimulation? CONCUR 2002: 594-610 - [c20]Antonín Kucera, Jan Strejcek:
The Stuttering Principle Revisited: On the Expressiveness of Nested X and U Operators in the Logic LTL. CSL 2002: 276-291 - [c19]Petr Jancar, Antonín Kucera, Faron Moller, Zdenek Sawa:
Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds. FoSSaCS 2002: 172-186 - [c18]