Model checking probabilistic pushdown automata J Esparza, A Kucera, R Mayr Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science …, 2004 | 175 | 2004 |

Model checking LTL with regular valuations for pushdown systems J Esparza, A Kučera, S Schwoon Information and Computation 186 (2), 355-376, 2003 | 132 | 2003 |

Reachability games on extended vector addition systems with states T Brázdil, P Jančar, A Kučera International Colloquium on Automata, Languages, and Programming, 478-489, 2010 | 100 | 2010 |

Deciding bisimulation-like equivalences with finite-state processes P Jančar, A Kučera, R Mayr Theoretical Computer Science 258 (1-2), 409-433, 2001 | 85 | 2001 |

Deciding bisimulation-like equivalences with finite-state processes P Jančar, A Kučera, R Mayr Theoretical Computer Science 258 (1-2), 409-433, 2001 | 85 | 2001 |

On the decidability of temporal properties of probabilistic pushdown automata T Brázdil, A Kučera, O Stražovský Annual Symposium on Theoretical Aspects of Computer Science, 145-157, 2005 | 81 | 2005 |

Model-checking LTL with regular valuations for pushdown systems J Esparza, A Kučera, S Schwoon International Symposium on Theoretical Aspects of Computer Software, 316-339, 2001 | 72 | 2001 |

Quantitative analysis of probabilistic pushdown automata: Expectations and variances J Esparza, A Kucera, R Mayr 20th Annual IEEE Symposium on Logic in Computer Science (LICS'05), 117-126, 2005 | 70 | 2005 |

Equivalence-checking on infinite-state systems: Techniques and results A Kučera, P Jančar Theory and Practice of Logic Programming 6 (3), 227-264, 2006 | 68* | 2006 |

Equivalence-checking on infinite-state systems: Techniques and results A Kučera, P Jančar Theory and Practice of Logic Programming 6 (3), 227-264, 2006 | 68* | 2006 |

One-counter Markov decision processes T Brázdil, V Brožek, K Etessami, A Kučera, D Wojtczak Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010 | 67 | 2010 |

Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. T Brázdil, V Brozek, K Chatterjee, V Forejt, A Kucera LICS, 33-42, 2011 | 66 | 2011 |

The satisfiability problem for probabilistic CTL T Brázdil, V Forejt, J Kretínský, A Kucera 2008 23rd Annual IEEE Symposium on Logic in Computer Science, 391-402, 2008 | 55 | 2008 |

Stochastic games with branching-time winning objectives T Brázdil, V Brozek, V Forejt, A Kucera 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06), 349-358, 2006 | 53 | 2006 |

On the controller synthesis for finite-state Markov decision processes A Kučera, O Stražovský International Conference on Foundations of Software Technology and …, 2005 | 45 | 2005 |

DP lower bounds for equivalence-checking and model-checking of one-counter automata P Jančar, A Kučera, F Moller, Z Sawa Information and Computation 188 (1), 1-19, 2004 | 45 | 2004 |

Continuous-time stochastic games with time-bounded reachability T Brázdil, V Forejt, J Krcal, J Kretinsky, A Kucera IARCS Annual Conference on Foundations of Software Technology and …, 2009 | 44 | 2009 |

Qualitative reachability in stochastic BPA games T Brázdil, V Brožek, A Kučera, J Obdržálek Information and Computation 209 (8), 1160-1183, 2011 | 43 | 2011 |

Simulation and bisimulation over one-counter processes P Jančar, A Kučera, F Moller Annual Symposium on Theoretical Aspects of Computer Science, 334-345, 2000 | 41 | 2000 |

Efficient controller synthesis for consumption games with multiple resource types T Brázdil, K Chatterjee, A Kučera, P Novotný International Conference on Computer Aided Verification, 23-38, 2012 | 39 | 2012 |