×

zbMATH — the first resource for mathematics

Kucera, Antonin

Compute Distance To:
Author ID: kucera.antonin.1 Recent zbMATH articles by "Kucera, Antonin"
Published as: Kučera, Antonín; Kučera, A.; Kucera, Antonin; Kučera, Antonin; Kucera, Antonín; Kŭcera, Antonín; Kucěra, Antonín; Kucera, A.
Homepage: http://www.fi.muni.cz/usr/kucera/homepage.html
External Links: ResearchGate · dblp
Documents Indexed: 91 Publications since 1992, including 9 Books

Publications by Year

Citations contained in zbMATH Open

59 Publications have been cited 288 times in 138 Documents Cited by Year
A numerical investigation of non-spherical rebounding bubbles. Zbl 0825.76472
Best, J. P.; Kucera, A.
36
1992
Model checking LTL with regular valuations for pushdown systems. Zbl 1078.68081
Esparza, Javier; Kučera, Antonín; Schwoon, Stefan
22
2003
Deciding bisimulation-like equivalences with finite-state processes. Zbl 0974.68131
Jančar, P.; Kučera, A.; Mayr, R.
17
2001
Model checking probabilistic pushdown automata. Zbl 1126.68053
Kučera, Antonín; Esparza, Javier; Mayr, Richard
15
2006
Reachability games on extended vector addition systems with states. Zbl 1288.68179
Brázdil, Tomáš; Jančar, Petr; Kučera, Antonín
12
2010
One-counter Markov decision processes. Zbl 1288.90119
Brázdil, T.; Brožek, V.; Etessami, K.; Kučera, A.; Wojtczak, D.
11
2010
Reachability in recursive Markov decision processes. Zbl 1145.91011
Brázdil, Tomáš; Brožek, Václav; Forejt, Vojtěch; Kučera, Antonín
10
2008
Model-checking LTL with regular valuations for pushdown systems. Zbl 1087.68542
Esparza, Javier; Kučera, Antonín; Schwoon, Stefan
10
2001
On the decidability of temporal properties of probabilistic pushdown automata. Zbl 1118.68520
Brázdil, Tomáš; Kučera, Antonín; Stražovský, Oldřich
8
2005
Simulation preorder over simple process algebras. Zbl 1009.68083
Kučera, Antonín; Mayr, Richard
6
2002
Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time. Zbl 0988.68118
Kučera, Antonín; Mayr, Richard
6
2002
Equivalence-checking on infinite-state systems: techniques and results. Zbl 1101.68700
Kučera, Antonín; Jančar, Petr
6
2006
Qualitative reachability in stochastic BPA games. Zbl 1237.91035
Brázdil, Tomáš; Brožek, Václav; Kučera, Antonín; Obdržálek, Jan
6
2011
Why is simulation harder than bisimulation? Zbl 1012.68140
Kučera, Antonín; Mayr, Richard
5
2002
On the complexity of semantic equivalences for pushdown automata and BPA. Zbl 1014.68103
Kučera, Antonín; Mayr, Richard
5
2002
DP lower bounds for equivalence-checking and model-checking of one-counter automata. Zbl 1078.68087
Jančar, Petr; Kučera, Antonín; Moller, Faron; Sawa, Zdeněk
5
2004
The stuttering principle revisited. Zbl 1079.03008
Kučera, Antonín; Strejček, Jan
5
2005
A general approach to comparing infinite-state systems with their finite-state specifications. Zbl 1097.68075
Kučera, Antonín; Schnoebelen, Philippe
5
2006
Markov decision processes with multiple long-run average objectives. Zbl 1326.90101
Brázdil, Tomáš; Brožek, Václav; Chatterjee, Krishnendu; Forejt, Vojtěch; Kučera, Antonín
5
2014
Approximating the termination value of one-counter MDPs and stochastic games. Zbl 1334.68113
Brázdil, Tomáš; Brožek, Václav; Etessami, Kousha; Kučera, Antonín
5
2011
Discounted properties of probabilistic pushdown automata. Zbl 1182.68100
Brázdil, Tomáš; Brožek, Václav; Holeček, Jan; Kučera, Antonín
4
2008
Controller synthesis and verification for Markov decision processes with qualitative branching time objectives. Zbl 1155.68427
Brázdil, Tomáš; Forejt, Vojtěch; Kučera, Antonín
4
2008
Simulation and bisimulation over one-counter processes. Zbl 0962.68121
Jančar, Petr; Kučera, Antonín; Moller, Faron
4
2000
A generic framework for checking semantic equivalences between pushdown automata and finite-state automata. Zbl 1094.68050
Kučera, Antonín; Mayr, Richard
4
2004
Efficient verification algorithms for one-counter processes. Zbl 0973.68163
Kučera, Antonín
4
2000
On the complexity of checking semantic equivalences between pushdown processes and finite-state processes. Zbl 1194.68162
Kučera, Antonín; Mayr, Richard
4
2010
Continuous-time stochastic games with time-bounded reachability. Zbl 1264.91016
Brázdil, Tomáš; Forejt, Vojtěch; Krčál, Jan; Křetínský, Jan; Kučera, Antonín
4
2013
Qualitative reachability in stochastic BPA games. Zbl 1236.68078
Brázdil, Tomáš; Brožek, Václav; Kučera, Antonín; Obdržálek, Jan
4
2009
Analyzing probabilistic pushdown automata. Zbl 1291.68226
Brázdil, Tomáš; Esparza, Javier; Kiefer, Stefan; Kučera, Antonín
4
2013
Trading performance for stability in Markov decision processes. Zbl 1366.68087
Brázdil, Tomáš; Chatterjee, Krishnendu; Forejt, Vojtěch; Kučera, Antonín
4
2013
Comparing expressibility of normed BPA and normed BPP processes. Zbl 0947.68109
Černá, Ivana; Křetínský, Mojmír; Kučera, Antonín
3
1999
Weak bisimilarity with infinite-state systems can be decided in polynomial time. Zbl 0939.68082
Kučera, Antonín; Mayr, Richard
3
1999
Equivalence-checking with one-counter automata: A generic method for proving lower bounds. Zbl 1077.68653
Jančar, Petr; Kučera, Antonín; Moller, Faron; Sawa, Zdeněk
3
2002
On simulation-checking with sequential systems. Zbl 0987.68045
Kučera, Antonín
3
2000
Deciding probabilistic bisimilarity over infinite-state probabilistic systems. Zbl 1138.68039
Brázdil, Tomáš; Kučera, Antonín; Stražovský, Oldřich
2
2008
Computing the expected accumulated reward and gain for a subclass of infinite Markov chains. Zbl 1172.68539
Brázdil, Tomáš; Kučera, Antonín
2
2005
Effective decomposability of sequential behaviours. Zbl 0944.68065
Kučera, Antonín
2
2000
On finite representations of infinite-state behaviours. Zbl 1002.68093
Kučera, Antonín
2
1999
A logical viewpoint on process-algebraic quotients. Zbl 1093.68066
Kučera, Antonín; Esparza, Javier
2
2003
Trading performance for stability in Markov decision processes. Zbl 1359.90147
Brázdil, Tomáš; Chatterjee, Krishnendu; Forejt, Vojtěch; Kučera, Antonín
2
2017
Continuous-time stochastic games with time-bounded reachability. Zbl 1250.91015
Brázdil, Tomáš; Forejt, Vojtech; Krčál, Jan; Křetínský, Jan; Kučera, Antonin
2
2009
Minimizing expected termination time in one-counter Markov decision processes. Zbl 1367.68162
Brázdil, Tomáš; Kučera, Antonín; Novotný, Petr; Wojtczak, Dominik
2
2012
Stochastic real-time games with qualitative timed automata objectives. Zbl 1287.68124
Brázdil, Tomáš; Krčál, Jan; Křetínský, Jan; Kučera, Antonín; Řehák, Vojtěch
2
2010
Runtime analysis of probabilistic programs with unbounded recursion. Zbl 1242.68064
Brázdil, Tomáš; Kiefer, Stefan; Kučera, Antonín; Vařeková, Ivana Hutařová
2
2011
Runtime analysis of probabilistic programs with unbounded recursion. Zbl 1410.68083
Brázdil, Tomáš; Kiefer, Stefan; Kučera, Antonín; Hutařová Vařeková, Ivana
2
2015
The stuttering principle revisited: On the expressiveness of nested \(X\) and \(U\) operators in the logic LTL. Zbl 1020.03026
Kučera, Antonín; Strejček, Jan
1
2002
Bisimilarity is decidable in the union of normed BPA and normed BPP processes. Zbl 0911.68065
Černá, I.; Křetínský, M.; Kučera, A.
1
1997
The complexity of bisimilarity-checking for one-counter processes. Zbl 1044.68099
Kučera, Antonín
1
2003
Reachability in recursive Markov decision processes. Zbl 1151.68509
Brázdil, Tomáš; Brožek, Václav; Forejt, Vojtěch; Kučera, Antonín
1
2006
Deciding bisimilarity between BPA and BPP processes. Zbl 1274.68236
Jančar, Petr; Kučera, Antonín; Moller, Faron
1
2003
On the controller synthesis for finite-state Markov decision processes. Zbl 1172.93337
Kučera, Antonín; Stražovský, Oldřich
1
2005
Deciding probabilistic bisimilarity over infinite-state probabilistic systems. Zbl 1099.68065
Brázdil, Tomáš; Kučera, Antonín; Stražovský, Oldřich
1
2004
Long-run average behaviour of probabilistic vector addition systems. Zbl 1392.68284
Brázdil, Tomáš; Kiefer, Stefan; Kučera, Antonín; Novotný, Petr
1
2015
A generic framework for checking semantic equivalences between pushdown automata and finite-state automata. Zbl 1378.68106
Kučera, Antonín; Mayr, Richard
1
2018
Branching-time model-checking of probabilistic pushdown automata. Zbl 1311.68084
Brázdil, Tomáš; Brožek, Václav; Forejt, Vojtěch; Kučera, Antonín
1
2014
Equivalence-checking with infinite-state systems: techniques and results. Zbl 1278.68218
Kučera, Antonín; Jančar, Petr
1
2002
Approximating the termination value of one-counter MDPs and stochastic games. Zbl 1267.68160
Brázdil, Tomáš; Brožek, Václav; Etessami, Kousha; Kučera, Antonín
1
2013
Efficient analysis of probabilistic programs with an unbounded counter. Zbl 1321.68186
Brázdil, Tomás; Kiefer, Stefan; Kŭcera, Antonín
1
2014
Measuring performance of continuous-time stochastic processes using timed automata. Zbl 1361.68136
Brázdil, Tomáš; Krčál, Jan; Křetínský, Jan; Kučera, Antonín; Řehák, Vojtěch
1
2011
A generic framework for checking semantic equivalences between pushdown automata and finite-state automata. Zbl 1378.68106
Kučera, Antonín; Mayr, Richard
1
2018
Trading performance for stability in Markov decision processes. Zbl 1359.90147
Brázdil, Tomáš; Chatterjee, Krishnendu; Forejt, Vojtěch; Kučera, Antonín
2
2017
Runtime analysis of probabilistic programs with unbounded recursion. Zbl 1410.68083
Brázdil, Tomáš; Kiefer, Stefan; Kučera, Antonín; Hutařová Vařeková, Ivana
2
2015
Long-run average behaviour of probabilistic vector addition systems. Zbl 1392.68284
Brázdil, Tomáš; Kiefer, Stefan; Kučera, Antonín; Novotný, Petr
1
2015
Markov decision processes with multiple long-run average objectives. Zbl 1326.90101
Brázdil, Tomáš; Brožek, Václav; Chatterjee, Krishnendu; Forejt, Vojtěch; Kučera, Antonín
5
2014
Branching-time model-checking of probabilistic pushdown automata. Zbl 1311.68084
Brázdil, Tomáš; Brožek, Václav; Forejt, Vojtěch; Kučera, Antonín
1
2014
Efficient analysis of probabilistic programs with an unbounded counter. Zbl 1321.68186
Brázdil, Tomás; Kiefer, Stefan; Kŭcera, Antonín
1
2014
Continuous-time stochastic games with time-bounded reachability. Zbl 1264.91016
Brázdil, Tomáš; Forejt, Vojtěch; Krčál, Jan; Křetínský, Jan; Kučera, Antonín
4
2013
Analyzing probabilistic pushdown automata. Zbl 1291.68226
Brázdil, Tomáš; Esparza, Javier; Kiefer, Stefan; Kučera, Antonín
4
2013
Trading performance for stability in Markov decision processes. Zbl 1366.68087
Brázdil, Tomáš; Chatterjee, Krishnendu; Forejt, Vojtěch; Kučera, Antonín
4
2013
Approximating the termination value of one-counter MDPs and stochastic games. Zbl 1267.68160
Brázdil, Tomáš; Brožek, Václav; Etessami, Kousha; Kučera, Antonín
1
2013
Minimizing expected termination time in one-counter Markov decision processes. Zbl 1367.68162
Brázdil, Tomáš; Kučera, Antonín; Novotný, Petr; Wojtczak, Dominik
2
2012
Qualitative reachability in stochastic BPA games. Zbl 1237.91035
Brázdil, Tomáš; Brožek, Václav; Kučera, Antonín; Obdržálek, Jan
6
2011
Approximating the termination value of one-counter MDPs and stochastic games. Zbl 1334.68113
Brázdil, Tomáš; Brožek, Václav; Etessami, Kousha; Kučera, Antonín
5
2011
Runtime analysis of probabilistic programs with unbounded recursion. Zbl 1242.68064
Brázdil, Tomáš; Kiefer, Stefan; Kučera, Antonín; Vařeková, Ivana Hutařová
2
2011
Measuring performance of continuous-time stochastic processes using timed automata. Zbl 1361.68136
Brázdil, Tomáš; Krčál, Jan; Křetínský, Jan; Kučera, Antonín; Řehák, Vojtěch
1
2011
Reachability games on extended vector addition systems with states. Zbl 1288.68179
Brázdil, Tomáš; Jančar, Petr; Kučera, Antonín
12
2010
One-counter Markov decision processes. Zbl 1288.90119
Brázdil, T.; Brožek, V.; Etessami, K.; Kučera, A.; Wojtczak, D.
11
2010
On the complexity of checking semantic equivalences between pushdown processes and finite-state processes. Zbl 1194.68162
Kučera, Antonín; Mayr, Richard
4
2010
Stochastic real-time games with qualitative timed automata objectives. Zbl 1287.68124
Brázdil, Tomáš; Krčál, Jan; Křetínský, Jan; Kučera, Antonín; Řehák, Vojtěch
2
2010
Qualitative reachability in stochastic BPA games. Zbl 1236.68078
Brázdil, Tomáš; Brožek, Václav; Kučera, Antonín; Obdržálek, Jan
4
2009
Continuous-time stochastic games with time-bounded reachability. Zbl 1250.91015
Brázdil, Tomáš; Forejt, Vojtech; Krčál, Jan; Křetínský, Jan; Kučera, Antonin
2
2009
Reachability in recursive Markov decision processes. Zbl 1145.91011
Brázdil, Tomáš; Brožek, Václav; Forejt, Vojtěch; Kučera, Antonín
10
2008
Discounted properties of probabilistic pushdown automata. Zbl 1182.68100
Brázdil, Tomáš; Brožek, Václav; Holeček, Jan; Kučera, Antonín
4
2008
Controller synthesis and verification for Markov decision processes with qualitative branching time objectives. Zbl 1155.68427
Brázdil, Tomáš; Forejt, Vojtěch; Kučera, Antonín
4
2008
Deciding probabilistic bisimilarity over infinite-state probabilistic systems. Zbl 1138.68039
Brázdil, Tomáš; Kučera, Antonín; Stražovský, Oldřich
2
2008
Model checking probabilistic pushdown automata. Zbl 1126.68053
Kučera, Antonín; Esparza, Javier; Mayr, Richard
15
2006
Equivalence-checking on infinite-state systems: techniques and results. Zbl 1101.68700
Kučera, Antonín; Jančar, Petr
6
2006
A general approach to comparing infinite-state systems with their finite-state specifications. Zbl 1097.68075
Kučera, Antonín; Schnoebelen, Philippe
5
2006
Reachability in recursive Markov decision processes. Zbl 1151.68509
Brázdil, Tomáš; Brožek, Václav; Forejt, Vojtěch; Kučera, Antonín
1
2006
On the decidability of temporal properties of probabilistic pushdown automata. Zbl 1118.68520
Brázdil, Tomáš; Kučera, Antonín; Stražovský, Oldřich
8
2005
The stuttering principle revisited. Zbl 1079.03008
Kučera, Antonín; Strejček, Jan
5
2005
Computing the expected accumulated reward and gain for a subclass of infinite Markov chains. Zbl 1172.68539
Brázdil, Tomáš; Kučera, Antonín
2
2005
On the controller synthesis for finite-state Markov decision processes. Zbl 1172.93337
Kučera, Antonín; Stražovský, Oldřich
1
2005
DP lower bounds for equivalence-checking and model-checking of one-counter automata. Zbl 1078.68087
Jančar, Petr; Kučera, Antonín; Moller, Faron; Sawa, Zdeněk
5
2004
A generic framework for checking semantic equivalences between pushdown automata and finite-state automata. Zbl 1094.68050
Kučera, Antonín; Mayr, Richard
4
2004
Deciding probabilistic bisimilarity over infinite-state probabilistic systems. Zbl 1099.68065
Brázdil, Tomáš; Kučera, Antonín; Stražovský, Oldřich
1
2004
Model checking LTL with regular valuations for pushdown systems. Zbl 1078.68081
Esparza, Javier; Kučera, Antonín; Schwoon, Stefan
22
2003
A logical viewpoint on process-algebraic quotients. Zbl 1093.68066
Kučera, Antonín; Esparza, Javier
2
2003
The complexity of bisimilarity-checking for one-counter processes. Zbl 1044.68099
Kučera, Antonín
1
2003
Deciding bisimilarity between BPA and BPP processes. Zbl 1274.68236
Jančar, Petr; Kučera, Antonín; Moller, Faron
1
2003
Simulation preorder over simple process algebras. Zbl 1009.68083
Kučera, Antonín; Mayr, Richard
6
2002
Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time. Zbl 0988.68118
Kučera, Antonín; Mayr, Richard
6
2002
Why is simulation harder than bisimulation? Zbl 1012.68140
Kučera, Antonín; Mayr, Richard
5
2002
On the complexity of semantic equivalences for pushdown automata and BPA. Zbl 1014.68103
Kučera, Antonín; Mayr, Richard
5
2002
Equivalence-checking with one-counter automata: A generic method for proving lower bounds. Zbl 1077.68653
Jančar, Petr; Kučera, Antonín; Moller, Faron; Sawa, Zdeněk
3
2002
The stuttering principle revisited: On the expressiveness of nested \(X\) and \(U\) operators in the logic LTL. Zbl 1020.03026
Kučera, Antonín; Strejček, Jan
1
2002
Equivalence-checking with infinite-state systems: techniques and results. Zbl 1278.68218
Kučera, Antonín; Jančar, Petr
1
2002
Deciding bisimulation-like equivalences with finite-state processes. Zbl 0974.68131
Jančar, P.; Kučera, A.; Mayr, R.
17
2001
Model-checking LTL with regular valuations for pushdown systems. Zbl 1087.68542
Esparza, Javier; Kučera, Antonín; Schwoon, Stefan
10
2001
Simulation and bisimulation over one-counter processes. Zbl 0962.68121
Jančar, Petr; Kučera, Antonín; Moller, Faron
4
2000
Efficient verification algorithms for one-counter processes. Zbl 0973.68163
Kučera, Antonín
4
2000
On simulation-checking with sequential systems. Zbl 0987.68045
Kučera, Antonín
3
2000
Effective decomposability of sequential behaviours. Zbl 0944.68065
Kučera, Antonín
2
2000
Comparing expressibility of normed BPA and normed BPP processes. Zbl 0947.68109
Černá, Ivana; Křetínský, Mojmír; Kučera, Antonín
3
1999
Weak bisimilarity with infinite-state systems can be decided in polynomial time. Zbl 0939.68082
Kučera, Antonín; Mayr, Richard
3
1999
On finite representations of infinite-state behaviours. Zbl 1002.68093
Kučera, Antonín
2
1999
Bisimilarity is decidable in the union of normed BPA and normed BPP processes. Zbl 0911.68065
Černá, I.; Křetínský, M.; Kučera, A.
1
1997
A numerical investigation of non-spherical rebounding bubbles. Zbl 0825.76472
Best, J. P.; Kucera, A.
36
1992
all top 5

Cited by 195 Authors

23 Kucera, Antonin
13 Brázdil, Tomáš
9 Forejt, Vojtěch
9 Jančar, Petr
8 Chatterjee, Krishnendu
7 Baier, Christel
7 Brožek, Václav
7 Kiefer, Stefan
7 Mayr, Richard M.
6 Etessami, Kousha
6 Kwiatkowska, Marta Z.
5 Bozzelli, Laura
5 Demri, Stéphane P.
5 Esparza, Javier
5 Raskin, Jean-François
5 Schnoebelen, Philippe
5 Yannakakis, Mihalis
4 Katoen, Joost-Pieter
4 Randour, Mickael
4 Song, Fu
4 Stewart, Alistair
4 Strejček, Jan
4 Touili, Tayssir
3 Moller, Faron
3 Niskanen, Reino
3 Potapov, Igor
3 Řehák, Vojtěch
3 Sangnier, Arnaud
3 Sawa, Zdeněk
3 Srba, Jiří
3 Worrell, James B.
2 Abdulla, Parosh Aziz
2 Bertrand, Nathalie
2 Bouajjani, Ahmed
2 Dubslaff, Clemens
2 Gascon, Régis
2 Göller, Stefan
2 Gorlin, Andrey
2 Haase, Christoph
2 Hague, Matthew
2 Halava, Vesa
2 Harju, Tero
2 Henzinger, Thomas A.
2 Juhl, Line
2 Klein, Joachim
2 Klüppelholz, Sascha
2 Křetínský, Jan
2 Křetínský, Mojmír
2 La Torre, Salvatore
2 Larsen, Kim Guldstrand
2 Lasota, Sławomir
2 Lazić, Ranko
2 Lohrey, Markus
2 Lugiez, Denis
2 Norman, Gethin
2 Peron, Adriano
2 Rabinovich, Alexander
2 Ramakrishnan, C. R.
2 Ranzato, Francesco
2 Smolka, Scott A.
2 Tapparo, Francesco
2 Vařeková, Ivana Hutařová
2 Velner, Yaron
2 Wunderlich, Sascha
2 Zhang, Lijun
1 Aceto, Luca
1 Alechina, Natasha
1 Alur, Rajeev
1 Avni, Guy
1 Baghoolizadeh, Shirin
1 Barbot, Benoît
1 Basset, Nicolas
1 Becker, Bernd
1 Berg, Manuela
1 Bloem, Roderick
1 Böhm, Stanislav
1 Braitling, Bettina
1 Brihaye, Thomas
1 Bruyère, Véronique
1 Bulling, Nils
1 Chen, Haiyan
1 Chen, Taolue
1 Chiari, Michele
1 Chonev, Ventsislav
1 Ciobanu, Radu
1 Clemente, Lorenzo
1 Cloth, Lucia
1 Dal Lago, Ugo
1 Day, A. Nicholas
1 de Alfaro, Luca
1 Dégremont, Cédric
1 Delgrange, Florent
1 Deutch, Daniel
1 Dhar, Amit Kumar
1 Doyen, Laurent
1 Duan, Zhenhua
1 Fahrenberg, Uli
1 Falgas-Ravry, Victor
1 Fearnley, John
1 Feng, Yuan
...and 95 more Authors

Citations by Year