Antonin Kucera
Antonin Kucera
Geverifieerd e-mailadres voor fi.muni.cz - Homepage
Titel
Geciteerd door
Geciteerd door
Jaar
Model checking probabilistic pushdown automata
J Esparza, A Kucera, R Mayr
Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science …, 2004
1732004
Model checking LTL with regular valuations for pushdown systems
J Esparza, A Kučera, S Schwoon
Information and Computation 186 (2), 355-376, 2003
1282003
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
992010
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
862001
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
862001
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
812005
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
722001
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
702005
Two views on multiple mean-payoff objectives in Markov decision processes
K Chatterjee, V Forejt, A Kucera
2011 IEEE 26th Annual Symposium on Logic in Computer Science, 33-42, 2011
662011
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
662010
Equivalence-checking on infinite-state systems: Techniques and results
A Kucera, P Jancar
arXiv preprint cs/0505025, 2005
652005
Equivalence-checking on infinite-state systems: Techniques and results
A Kucera, P Jancar
arXiv preprint cs/0505025, 2005
652005
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
552008
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
512006
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
442004
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
432009
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
422011
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
422005
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
402000
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
392012
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20