BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Canada
1 × France
1 × Iceland
1 × Japan
1 × Switzerland
2 × Austria
2 × United Kingdom
6 × USA
Collaborated with:
A.Kucera V.Forejt S.Kiefer P.Novotný K.Chatterjee V.Brozek J.Kretínský P.Jancar D.Klaska D.Wojtczak K.Etessami I.H.Vareková J.Esparza M.Luttenberger M.Chmelik A.Fellner J.Katoen
Talks about:
probabilist (5) process (5) markov (5) decis (5) counter (4) object (4) game (4) synthesi (3) stochast (3) multipl (3)

Person: Tomás Brázdil

DBLP DBLP: Br=aacute=zdil:Tom=aacute=s

Contributed to:

CAV 20152015
LICS 20152015
TACAS 20152015
CAV 20142014
CSL-LICS 20142014
LICS 20132013
CAV 20122012
ICALP (2) 20122012
CAV 20112011
ICALP (2) 20112011
LICS 20112011
ICALP (2) 20102010
ICALP (2) 20082008
LICS 20082008
LICS 20062006

Wrote 17 papers:

CAV-2015-BrazdilCCFK #learning #markov #process
Counterexample Explanation by Learning Small Strategies in Markov Decision Processes (TB, KC, MC, AF, JK), pp. 158–177.
LICS-2015-BrazdilKKN #behaviour #probability
Long-Run Average Behaviour of Probabilistic Vector Addition Systems (TB, SK, AK, PN), pp. 44–55.
TACAS-2015-BrazdilCFK #multi #named #synthesis
MultiGain: A Controller Synthesis Tool for MDPs with Multiple Mean-Payoff Objectives (TB, KC, VF, AK), pp. 181–187.
CAV-2014-BrazdilKKN #low cost
Minimizing Running Costs in Consumption Systems (TB, DK, AK, PN), pp. 457–472.
LICS-CSL-2014-BrazdilKKNK #automaton #multi #probability
Zero-reachability in probabilistic multi-counter automata (TB, SK, AK, PN, JPK), p. 10.
LICS-2013-BrazdilCFK #markov #performance #process
Trading Performance for Stability in Markov Decision Processes (TB, KC, VF, AK), pp. 331–340.
CAV-2012-BrazdilCKN #game studies #multi #performance #synthesis
Efficient Controller Synthesis for Consumption Games with Multiple Resource Types (TB, KC, AK, PN), pp. 23–38.
ICALP-v2-2012-BrazdilKNW #markov #process #termination
Minimizing Expected Termination Time in One-Counter Markov Decision Processes (TB, AK, PN, DW), pp. 141–152.
CAV-2011-BrazdilKK #analysis #bound #performance #probability #source code
Efficient Analysis of Probabilistic Programs with an Unbounded Counter (TB, SK, AK), pp. 208–224.
ICALP-v2-2011-BrazdilBEK #approximate #game studies #probability #termination
Approximating the Termination Value of One-Counter MDPs and Stochastic Games (TB, VB, KE, AK), pp. 332–343.
ICALP-v2-2011-BrazdilKKV #analysis #bound #probability #recursion #runtime #source code
Runtime Analysis of Probabilistic Programs with Unbounded Recursion (TB, SK, AK, IHV), pp. 319–331.
LICS-2011-BrazdilBCFK #markov #multi #process
Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes (TB, VB, KC, VF, AK), pp. 33–42.
ICALP-v2-2010-BrazdilEKL #scheduling
Space-Efficient Scheduling of Stochastically Generated Tasks (TB, JE, SK, ML), pp. 539–550.
ICALP-v2-2010-BrazdilJK #game studies #reachability
Reachability Games on Extended Vector Addition Systems with States (TB, PJ, AK), pp. 478–489.
ICALP-B-2008-BrazdilFK #branch #markov #process #synthesis #verification
Controller Synthesis and Verification for Markov Decision Processes with Qualitative Branching Time Objectives (TB, VF, AK), pp. 148–159.
LICS-2008-BrazdilFKK #probability #problem #satisfiability
The Satisfiability Problem for Probabilistic CTL (TB, VF, JK, AK), pp. 391–402.
LICS-2006-BrazdilBFK #game studies #probability
Stochastic Games with Branching-Time Winning Objectives (TB, VB, VF, AK), pp. 349–358.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.