BibSLEIGH — Antonin

Travelled to:

1 × Canada
1 × Czech Republic
1 × Denmark
1 × Finland
1 × Iceland
1 × Japan
1 × Spain
2 × Austria
2 × France
2 × Switzerland
3 × United Kingdom
6 × USA

Collaborated with:

T.Brázdil V.Forejt R.Mayr P.Novotný J.Esparza S.Kiefer K.Chatterjee P.Jancar V.Brozek J.Strejcek ∅ D.Klaska D.Wojtczak K.Etessami I.H.Vareková J.Kretínský F.Moller Z.Sawa J.Katoen

Talks about:

process (8) probabilist (7) counter (6) automata (4) object (4) markov (4) decis (4) game (4) one (4) synthesi (3)

Person: Antonín Kucera

DBLP: Kucera:Anton=iacute=n

Contributed to:

2015

2014

2013

2012

2011

2010

2008

2006

2005

2004

2002

2000

1999

1998

Wrote 23 papers:

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-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.
LICS-2005-EsparzaKM #analysis #automaton #probability: Quantitative Analysis of Probabilistic Pushdown Automata: Expectations and Variances (JE, AK, RM), pp. 117–126.
LICS-2004-EsparzaKM #automaton #model checking #probability: Model Checking Probabilistic Pushdown Automata (JE, AK, RM), pp. 12–21.
CSL-2002-KuceraS #logic #ltl: The Stuttering Principle Revisited: On the Expressiveness of Nested X and U Operators in the Logic LTL (AK, JS), pp. 276–291.
FoSSaCS-2002-JancarKMS #automaton #bound #proving: Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds (PJ, AK, FM, ZS), pp. 172–186.
ICALP-2000-Kucera #algorithm #performance #process #verification: Efficient Verification Algorithms for One-Counter Processes (AK), pp. 317–328.
CSL-1999-KuceraE #algebra #logic: A Logical Viewpoint on Process-Algebraic Quotients (AK, JE), pp. 499–514.
ICALP-1999-KuceraM #algebra #process #simulation: Simulation Preorder on Simple Process Algebras (AK, RM), pp. 503–512.
ICALP-1998-JancarKM #bisimulation #finite #process: Deciding Bisimulation-Like Equivalences with Finite-State Processes (PJ, AK, RM), pp. 200–211.