Seguir
Tomas Brazdil
Tomas Brazdil
Dirección de correo verificada de fi.muni.cz
Título
Citado por
Citado por
Ańo
Verification of Markov decision processes using learning algorithms
T Brázdil, K Chatterjee, M Chmelik, V Forejt, J Křetínský, M Kwiatkowska, ...
Automated Technology for Verification and Analysis: 12th International …, 2014
2492014
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
1152010
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
982005
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
912011
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
762010
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
672008
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
662006
Analyzing probabilistic pushdown automata
T Brázdil, J Esparza, S Kiefer, A Kučera
Formal Methods in System Design 43, 124-163, 2013
562013
One-counter stochastic games
T Brázdil, V Brožek, K Etessami
arXiv preprint arXiv:1009.5636, 2010
552010
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
502011
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
492017
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
482012
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
442009
Analysis and prediction of the long-run behavior of probabilistic sequential programs with recursion
T Brázdil, J Esparza, A Kucera
46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), 521-530, 2005
442005
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
Reachability in recursive Markov decision processes
T Brázdil, V Brožek, V Forejt, A Kučera
Information and Computation 206 (5), 520-537, 2008
392008
Counterexample explanation by learning small strategies in Markov decision processes
T Brázdil, K Chatterjee, M Chmelík, A Fellner, J Křetínský
Computer Aided Verification: 27th International Conference, CAV 2015, San …, 2015
382015
Controller synthesis and verification for Markov decision processes with qualitative branching time objectives
T Brázdil, V Forejt, A Kučera
Automata, Languages and Programming: 35th International Colloquium, ICALP …, 2008
362008
MultiGain: A Controller Synthesis Tool for MDPs with Multiple Mean-Payoff Objectives
T Brázdil, K Chatterjee, V Forejt, A Kučera
Tools and Algorithms for the Construction and Analysis of Systems: 21st …, 2015
332015
Efficient analysis of probabilistic programs with an unbounded counter
T Brázdil, S Kiefer, A Kŭcera
Journal of the ACM (JACM) 61 (6), 1-35, 2014
322014
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20