| 2009 |
|---|
| 69 | EE | 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
Springer 2009 |
| 68 | EE | Tomás Brázdil,
Václav Brozek,
Antonín Kucera,
Jan Obdrzálek:
Qualitative Reachability in Stochastic BPA Games.
STACS 2009: 207-218 |
| 67 | EE | 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 |
|---|
| 66 | EE | 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 |
| 65 | EE | Tomás Brázdil,
Vojtech Forejt,
Jan Kretínský,
Antonín Kucera:
The Satisfiability Problem for Probabilistic CTL.
LICS 2008: 391-402 |
| 64 | EE | Tomás Brázdil,
Václav Brozek,
Jan Holecek,
Antonín Kucera:
Discounted Properties of Probabilistic Pushdown Automata.
LPAR 2008: 230-242 |
| 63 | EE | Tomás Brázdil,
Antonín Kucera,
Oldrich Strazovský:
Deciding probabilistic bisimilarity over infinite-state probabilistic systems.
Acta Inf. 45(2): 131-154 (2008) |
| 62 | EE | Antonín Kucera,
Oldrich Strazovský:
On the Controller Synthesis for Finite-State Markov Decision Processes.
Fundam. Inform. 82(1-2): 141-153 (2008) |
| 61 | EE | 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) |
| 2007 |
|---|
| 60 | | 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
Springer 2007 |
| 59 | EE | Christel Baier,
Tomás Brázdil,
Marcus Größer,
Antonín Kucera:
Stochastic Game Logic.
QEST 2007: 227-236 |
| 2006 |
|---|
| 58 | EE | Tomás Brázdil,
Václav Brozek,
Vojtech Forejt,
Antonín Kucera:
Reachability in Recursive Markov Decision Processes.
CONCUR 2006: 358-374 |
| 57 | EE | Tomás Brázdil,
Václav Brozek,
Vojtech Forejt,
Antonín Kucera:
Stochastic Games with Branching-Time Winning Objectives.
LICS 2006: 349-358 |
| 56 | EE | Antonín Kucera:
Methods for Quantitative Analysis of Probabilistic Pushdown Automata.
Electr. Notes Theor. Comput. Sci. 149(1): 3-15 (2006) |
| 55 | EE | Antonín Kucera,
Javier Esparza,
Richard Mayr:
Model Checking Probabilistic Pushdown Automata.
Logical Methods in Computer Science 2(1): (2006) |
| 54 | EE | Antonín Kucera,
Petr Jancar:
Equivalence-checking on infinite-state systems: Techniques and results.
TPLP 6(3): 227-264 (2006) |
| 53 | EE | 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) |
| 2005 |
|---|
| 52 | EE | 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 |
| 51 | EE | 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 |
| 50 | EE | Antonín Kucera,
Oldrich Strazovský:
On the Controller Synthesis for Finite-State Markov Decision Processes.
FSTTCS 2005: 541-552 |
| 49 | EE | Javier Esparza,
Antonín Kucera,
Richard Mayr:
Quantitative Analysis of Probabilistic Pushdown Automata: Expectations and Variances.
LICS 2005: 117-126 |
| 48 | EE | Antonín Kucera,
Jan Strejcek:
Characteristic Patterns for LTL.
SOFSEM 2005: 239-249 |
| 47 | EE | Tomás Brázdil,
Antonín Kucera,
Oldrich Strazovský:
On the Decidability of Temporal Properties of Probabilistic Pushdown Automata.
STACS 2005: 145-157 |
| 46 | EE | Antonín Kucera,
Jan Strejcek:
The stuttering principle revisited.
Acta Inf. 41(7-8): 415-434 (2005) |
| 45 | EE | Antonín Kucera,
Petr Jancar:
Equivalence-Checking on Infinite-State Systems: Techniques and Results
CoRR abs/cs/0505025: (2005) |
| 44 | EE | Javier Esparza,
Antonín Kucera,
Richard Mayr:
Model Checking Probabilistic Pushdown Automata
CoRR abs/cs/0508003: (2005) |
| 2004 |
|---|
| 43 | EE | Tomás Brázdil,
Antonín Kucera,
Oldrich Strazovský:
Deciding Probabilistic Bisimilarity Over Infinite-State Probabilistic Systems.
CONCUR 2004: 193-208 |
| 42 | EE | Antonín Kucera,
Ph. Schnoebelen:
A General Approach to Comparing Infinite-State Systems with Their Finite-State Specifications.
CONCUR 2004: 371-386 |
| 41 | | Antonín Kucera,
Richard Mayr:
A Generic Framework for Checking Semantic Equivalences between Pushdown Automata and Finite-State Automata.
IFIP TCS 2004: 395-408 |
| 40 | EE | Javier Esparza,
Antonín Kucera,
Richard Mayr:
Model Checking Probabilistic Pushdown Automata.
LICS 2004: 12-21 |
| 39 | EE | 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) |
| 2003 |
|---|
| 38 | EE | Petr Jancar,
Antonín Kucera,
Faron Moller:
Deciding Bisimilarity between BPA and BPP Processes.
CONCUR 2003: 157-171 |
| 37 | EE | Robert Batusek,
Ivan Kopecek,
Antonín Kucera:
On Homogeneous Segments.
TSD 2003: 152-157 |
| 36 | EE | Javier Esparza,
Antonín Kucera,
Stefan Schwoon:
Model checking LTL with regular valuations for pushdown systems.
Inf. Comput. 186(2): 355-376 (2003) |
| 35 | EE | Antonín Kucera,
Javier Esparza:
A Logical Viewpoint on Process-algebraic Quotients.
J. Log. Comput. 13(6): 863-880 (2003) |
| 34 | EE | Antonín Kucera:
The complexity of bisimilarity-checking for one-counter processes.
Theor. Comput. Sci. 1-3(304): 157-183 (2003) |
| 2002 |
|---|
| 33 | | Lubos Brim,
Petr Jancar,
Mojmír Kretínský,
Antonín Kucera:
CONCUR 2002 - Concurrency Theory, 13th International Conference, Brno, Czech Republic, August 20-23, 2002, Proceedings
Springer 2002 |
| 32 | EE | Antonín Kucera,
Richard Mayr:
Why Is Simulation Harder than Bisimulation?
CONCUR 2002: 594-610 |
| 31 | EE | 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 |
| 30 | EE | 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 |
| 29 | EE | Antonín Kucera,
Richard Mayr:
On the Complexity of Semantic Equivalences for Pushdown Automata and BPA.
MFCS 2002: 433-445 |
| 28 | EE | Antonín Kucera,
Petr Jancar:
Equivalence-Checking with Infinite-State Systems: Techniques and Results.
SOFSEM 2002: 41-73 |
| 27 | EE | Antonín Kucera,
Richard Mayr:
Preface.
Electr. Notes Theor. Comput. Sci. 68(6): (2002) |
| 26 | EE | Antonín Kucera,
Richard Mayr:
Simulation Preorder over Simple Process Algebras.
Inf. Comput. 173(2): 184-198 (2002) |
| 25 | EE | 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) |
| 2001 |
|---|
| 24 | EE | Javier Esparza,
Antonín Kucera,
Stefan Schwoon:
Model-Checking LTL with Regular Valuations for Pushdown Systems.
TACS 2001: 316-339 |
| 23 | EE | Antonín Kucera,
Theodore A. Slaman:
Randomness and Recursive Enumerability.
SIAM J. Comput. 31(1): 199-211 (2001) |
| 22 | EE | Petr Jancar,
Antonín Kucera,
Richard Mayr:
Deciding bisimulation-like equivalences with finite-state processes.
Theor. Comput. Sci. 258(1-2): 409-433 (2001) |
| 2000 |
|---|
| 21 | EE | Antonín Kucera:
On Simulation-Checking with Sequential Systems.
ASIAN 2000: 133-148 |
| 20 | EE | Antonín Kucera:
Efficient Verification Algorithms for One-Counter Processes.
ICALP 2000: 317-328 |
| 19 | EE | Petr Jancar,
Antonín Kucera,
Faron Moller:
Simulation and Bisimulation over One-Counter Processes.
STACS 2000: 334-345 |
| 18 | EE | Antonín Kucera:
Effective decomposability of sequential behaviours.
Theor. Comput. Sci. 242(1-2): 71-89 (2000) |
| 1999 |
|---|
| 17 | EE | Antonín Kucera,
Richard Mayr:
Weak Bisimilarity with Infinite-State Systems Can Be Decided in Polynomial Time.
CONCUR 1999: 368-382 |
| 16 | | Antonín Kucera,
Javier Esparza:
A Logical Viewpoint on Process-Algebraic Quotients.
CSL 1999: 499-514 |
| 15 | EE | Antonín Kucera,
Richard Mayr:
Simulation Preorder on Simple Process Algebras.
ICALP 1999: 503-512 |
| 14 | EE | 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) |
| 13 | EE | Antonín Kucera:
On Finite Representations of Infinite-State Behaviours.
Inf. Process. Lett. 70(1): 23-30 (1999) |
| 12 | EE | Antonín Kucera:
Regularity of Normed PA Processes.
Inf. Process. Lett. 72(1-2): 9-17 (1999) |
| 11 | | Antonín Kucera,
Sebastiaan Terwijn:
Lowness for The Class of Random Sets.
J. Symb. Log. 64(4): 1396-1402 (1999) |
| 1998 |
|---|
| 10 | EE | Petr Jancar,
Antonín Kucera,
Richard Mayr:
Deciding Bisimulation-Like Equivalences with Finite-State Processes.
ICALP 1998: 200-211 |
| 1997 |
|---|
| 9 | | Antonín Kucera:
How to Parallelize Sequential Processes.
CONCUR 1997: 302-316 |
| 8 | | Antonín Kucera:
On Finite Representations of Infinite-State Behaviours.
SOFSEM 1997: 481-488 |
| 7 | EE | Petr Jancar,
Antonín Kucera:
Bisimilarity of processes with finite-state systems.
Electr. Notes Theor. Comput. Sci. 9: (1997) |
| 1996 |
|---|
| 6 | | Antonín Kucera:
Regularity is Decidable for Normed PA Processes in Polynomial Time.
FSTTCS 1996: 111-122 |
| 5 | | Antonín Kucera:
Regularity is Decidable for Normed BPA and Normed BPP Processes in Polynomial Time.
SOFSEM 1996: 377-392 |
| 4 | EE | 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: (1996) |
| 1993 |
|---|
| 3 | | Antonín Kucera:
On Relative Randomness.
Ann. Pure Appl. Logic 63(1): 61-67 (1993) |
| 1989 |
|---|
| 2 | | Petr Hájek,
Antonín Kucera:
On Recursion Theory in I Sigma1.
J. Symb. Log. 54(2): 576-589 (1989) |
| 1986 |
|---|
| 1 | | Antonín Kucera:
An Alternative, Priority-Free, Solution to Post's Problem.
MFCS 1986: 493-500 |
