Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Antonín Kucera
2010 – today
- 2013
[j35]Agata Ciabattoni, Rusins Freivalds, Antonín Kucera, Igor Potapov, Stefan Szeider: Preface. Fundam. Inform. 123(1) (2013)- [j34]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)
- [j33]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)
- [e6]Antonín Kucera, Thomas A. Henzinger, Jaroslav Nesetril, Tomás Vojnar, David Antos (Eds.): 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
- [i14]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
- [j32]Christel Baier, Tomás Brázdil, Marcus Größer, Antonín Kucera: Stochastic game logic. Acta Inf. 49(4): 203-224 (2012)
- [j31]
- [c51]Antonín Kucera, André Nies: Demuth's Path to Randomness. Computation, Physics and Beyond 2012: 159-173
- [c50]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
- [c49]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
- [c48]Tomás Brázdil, Antonín Kucera, Petr Novotný: Determinacy in Stochastic Games with Unbounded Payoff Functions. MEMICS 2012: 94-105
- [c47]
- [i13]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)
- [i12]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)
- [i11]Tomás Brázdil, Antonín Kucera, Petr Novotný: Determinacy in Stochastic Games with Unbounded Payoff Functions. CoRR abs/1208.1639 (2012)
- 2011
- [j30]Antonín Kucera, André Nies: Demuth randomness and computational complexity. Ann. Pure Appl. Logic 162(7): 504-513 (2011)
- [j29]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)
- [c46]Tomás Brázdil, Stefan Kiefer, Antonín Kucera: Efficient Analysis of Probabilistic Programs with an Unbounded Counter. CAV 2011: 208-224
- [c45]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
- [c44]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
- [c43]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
- [c42]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
- [i10]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)
- [i9]Tomás Brázdil, Stefan Kiefer, Antonín Kucera: Efficient Analysis of Probabilistic Programs with an Unbounded Counter. CoRR abs/1102.2529 (2011)
- [i8]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. CoRR abs/1104.3489 (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
- [j28]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)
- [c41]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
- [c40]Tomás Brázdil, Petr Jancar, Antonín Kucera: Reachability Games on Extended Vector Addition Systems with States. ICALP (2) 2010: 478-489
- [c39]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 (Eds.): 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
- [e4]Antonín Kucera, Igor Potapov (Eds.): Reachability Problems, 4th International Workshop, RP 2010, Brno, Czech Republic, August 28-29, 2010. Proceedings. Lecture Notes in Computer Science 6227, Springer 2010, ISBN 978-3-642-15348-8
- [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
- [j27]
- [c38]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
- [c37]Tomás Brázdil, Václav Brozek, Antonín Kucera, Jan Obdrzálek: Qualitative Reachability in Stochastic BPA Games. STACS 2009: 207-218
- [e3]Mogens Nielsen, Antonín Kucera, Peter Bro Miltersen, Catuscia Palamidessi, Petr Tuma, Frank D. Valencia (Eds.): 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
- [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
- [j26]Tomás Brázdil, Antonín Kucera, Oldrich Strazovský: Deciding probabilistic bisimilarity over infinite-state probabilistic systems. Acta Inf. 45(2): 131-154 (2008)
- [j25]Antonín Kucera, Oldrich Strazovský: On the Controller Synthesis for Finite-State Markov Decision Processes. Fundam. Inform. 82(1-2): 141-153 (2008)
- [j24]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)
- [c36]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
- [c35]Tomás Brázdil, Vojtech Forejt, Jan Kretínský, Antonín Kucera: The Satisfiability Problem for Probabilistic CTL. LICS 2008: 391-402
- [c34]Tomás Brázdil, Václav Brozek, Jan Holecek, Antonín Kucera: Discounted Properties of Probabilistic Pushdown Automata. LPAR 2008: 230-242
- 2007
- [c33]Christel Baier, Tomás Brázdil, Marcus Größer, Antonín Kucera: Stochastic Game Logic. QEST 2007: 227-236
- [e2]Ludek Kucera, Antonín Kucera (Eds.): 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
- 2006
- [j23]Antonín Kucera: Methods for Quantitative Analysis of Probabilistic Pushdown Automata. Electr. Notes Theor. Comput. Sci. 149(1): 3-15 (2006)
- [j22]Antonín Kucera, Javier Esparza, Richard Mayr: Model Checking Probabilistic Pushdown Automata. Logical Methods in Computer Science 2(1) (2006)
- [j21]Antonín Kucera, Ph. Schnoebelen: A general approach to comparing infinite-state systems with their finite-state specifications. Theor. Comput. Sci. 358(2-3): 315-333 (2006)
- [j20]Antonín Kucera, Petr Jancar: Equivalence-checking on infinite-state systems: Techniques and results. TPLP 6(3): 227-264 (2006)
- [c32]Tomás Brázdil, Václav Brozek, Vojtech Forejt, Antonín Kucera: Reachability in Recursive Markov Decision Processes. CONCUR 2006: 358-374
- [c31]Tomás Brázdil, Václav Brozek, Vojtech Forejt, Antonín Kucera: Stochastic Games with Branching-Time Winning Objectives. LICS 2006: 349-358
- 2005
- [j19]
- [c30]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
- [c29]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
- [c28]Antonín Kucera, Oldrich Strazovský: On the Controller Synthesis for Finite-State Markov Decision Processes. FSTTCS 2005: 541-552
- [c27]Javier Esparza, Antonín Kucera, Richard Mayr: Quantitative Analysis of Probabilistic Pushdown Automata: Expectations and Variances. LICS 2005: 117-126
- [c26]
- [c25]Tomás Brázdil, Antonín Kucera, Oldrich Strazovský: On the Decidability of Temporal Properties of Probabilistic Pushdown Automata. STACS 2005: 145-157
- [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
- [j18]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)
- [c24]Tomás Brázdil, Antonín Kucera, Oldrich Strazovský: Deciding Probabilistic Bisimilarity Over Infinite-State Probabilistic Systems. CONCUR 2004: 193-208
- [c23]Antonín Kucera, Ph. Schnoebelen: A General Approach to Comparing Infinite-State Systems with Their Finite-State Specifications. CONCUR 2004: 371-386
- [c22]Antonín Kucera, Richard Mayr: A Generic Framework for Checking Semantic Equivalences between Pushdown Automata and Finite-State Automata. IFIP TCS 2004: 395-408
- [c21]Javier Esparza, Antonín Kucera, Richard Mayr: Model Checking Probabilistic Pushdown Automata. LICS 2004: 12-21
- 2003
- [j17]Javier Esparza, Antonín Kucera, Stefan Schwoon: Model checking LTL with regular valuations for pushdown systems. Inf. Comput. 186(2): 355-376 (2003)
- [j16]Antonín Kucera, Javier Esparza: A Logical Viewpoint on Process-algebraic Quotients. J. Log. Comput. 13(6): 863-880 (2003)
- [j15]Antonín Kucera: The complexity of bisimilarity-checking for one-counter processes. Theor. Comput. Sci. 1-3(304): 157-183 (2003)
- [c20]Petr Jancar, Antonín Kucera, Faron Moller: Deciding Bisimilarity between BPA and BPP Processes. CONCUR 2003: 157-171
- [c19]
- 2002
- [j14]
- [j13]Antonín Kucera, Richard Mayr: Simulation Preorder over Simple Process Algebras. Inf. Comput. 173(2): 184-198 (2002)
- [j12]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)
- [c18]
- [c17]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
- [c16]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
- [c15]Antonín Kucera, Richard Mayr: On the Complexity of Semantic Equivalences for Pushdown Automata and BPA. MFCS 2002: 433-445
- [c14]Antonín Kucera, Petr Jancar: Equivalence-Checking with Infinite-State Systems: Techniques and Results. SOFSEM 2002: 41-73
- [e1]Lubos Brim, Petr Jancar, Mojmír Kretínský, Antonín Kucera (Eds.): CONCUR 2002 - Concurrency Theory, 13th International Conference, Brno, Czech Republic, August 20-23, 2002, Proceedings. Lecture Notes in Computer Science 2421, Springer 2002, ISBN 3-540-44043-7
- 2001
- [j11]Antonín Kucera, Theodore A. Slaman: Randomness and Recursive Enumerability. SIAM J. Comput. 31(1): 199-211 (2001)
- [j10]Petr Jancar, Antonín Kucera, Richard Mayr: Deciding bisimulation-like equivalences with finite-state processes. Theor. Comput. Sci. 258(1-2): 409-433 (2001)
- [c13]Javier Esparza, Antonín Kucera, Stefan Schwoon: Model-Checking LTL with Regular Valuations for Pushdown Systems. TACS 2001: 316-339
- 2000
- [j9]Antonín Kucera: Effective decomposability of sequential behaviours. Theor. Comput. Sci. 242(1-2): 71-89 (2000)
- [c12]
- [c11]
- [c10]Petr Jancar, Antonín Kucera, Faron Moller: Simulation and Bisimulation over One-Counter Processes. STACS 2000: 334-345
1990 – 1999
- 1999
- [j8]Ivana Cerná, Mojmír Kretínský, Antonín Kucera: Comparing Expressibility of Normed BPA and Normed BPP Processes. Acta Inf. 36(3): 233-256 (1999)
- [j7]Antonín Kucera: On Finite Representations of Infinite-State Behaviours. Inf. Process. Lett. 70(1): 23-30 (1999)
- [j6]
- [j5]Antonín Kucera, Sebastiaan Terwijn: Lowness for The Class of Random Sets. J. Symb. Log. 64(4): 1396-1402 (1999)
- [c9]Antonín Kucera, Richard Mayr: Weak Bisimilarity with Infinite-State Systems Can Be Decided in Polynomial Time. CONCUR 1999: 368-382
- [c8]Antonín Kucera, Javier Esparza: A Logical Viewpoint on Process-Algebraic Quotients. CSL 1999: 499-514
- [c7]
- 1998
- [c6]Petr Jancar, Antonín Kucera, Richard Mayr: Deciding Bisimulation-Like Equivalences with Finite-State Processes. ICALP 1998: 200-211
- 1997
- [j4]Petr Jancar, Antonín Kucera: Bisimilarity of processes with finite-state systems. Electr. Notes Theor. Comput. Sci. 9: 41 (1997)
- [c5]
- [c4]
- 1996
- [j3]Ivana Cerná, Mojmír Kretínský, Antonín Kucera: Bisimilarity is decidable in the union of normed BPA and normed BPP processes. Electr. Notes Theor. Comput. Sci. 5: 14 (1996)
- [c3]Antonín Kucera: Regularity is Decidable for Normed PA Processes in Polynomial Time. FSTTCS 1996: 111-122
- [c2]Antonín Kucera: Regularity is Decidable for Normed BPA and Normed BPP Processes in Polynomial Time. SOFSEM 1996: 377-392
- 1993
- [j2]
1980 – 1989
- 1989
- [j1]
- 1986
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-03 20:14 CEST by the dblp team