Follow
Antonin Kucera
Antonin Kucera
Verified email at fi.muni.cz - Homepage
Title
Cited by
Cited by
Year
Model checking probabilistic pushdown automata
J Esparza, A Kucera, R Mayr
Logical Methods in Computer Science 2, 2006
2022006
Model checking LTL with regular valuations for pushdown systems
J Esparza, A Kučera, S Schwoon
Information and Computation 186 (2), 355-376, 2003
1492003
Reachability games on extended vector addition systems with states
T Brázdil, P Jančar, A Kučera
Automata, Languages and Programming: 37th International Colloquium, ICALP …, 2010
1162010
On the decidability of temporal properties of probabilistic pushdown automata
T Brázdil, A Kučera, O Stražovský
STACS 2005: 22nd Annual Symposium on Theoretical Aspects of Computer Science …, 2005
932005
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
902001
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
902001
Two views on multiple mean-payoff objectives in Markov decision processes
T Br, K Chatterjee, V Forejt, A Kucera
2011 IEEE 26th Annual Symposium on Logic in Computer Science, 33-42, 2011
852011
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
812001
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
782005
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
752010
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
71*2006
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
632006
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
622008
On the controller synthesis for finite-state Markov decision processes
A Kučera, O Stražovský
FSTTCS 2005: Foundations of Software Technology and Theoretical Computer …, 2005
502005
Trading performance for stability in Markov decision processes
T Brázdil, K Chatterjee, V Forejt, A Kučera
Journal of Computer and System Sciences 84, 144-170, 2017
482017
Analyzing probabilistic pushdown automata
T Brázdil, J Esparza, S Kiefer, A Kučera
Formal Methods in System Design 43, 124-163, 2013
472013
Efficient controller synthesis for consumption games with multiple resource types
T Brázdil, K Chatterjee, A Kučera, P Novotný
Computer Aided Verification: 24th International Conference, CAV 2012 …, 2012
472012
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
472011
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
462004
Approximating the termination value of one-counter MDPs and stochastic games
T Brázdil, V Brožek, K Etessami, A Kučera
Information and Computation 222, 121-138, 2013
432013
The system can't perform the operation now. Try again later.
Articles 1–20