![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Tomás Brázdil
Person information
- affiliation: Masaryk University, Brno, Czech Republic
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c58]Tomás Brázdil:
A Summary and Personal Perspective on Recent Advances in Privacy Risk Assessment in Digital Pathology Through Formal Methods. Taming the Infinities of Concurrency 2024: 148-154 - [i39]Tomás Brázdil, Krishnendu Chatterjee, Martin Chmelik, Vojtech Forejt, Jan Kretínský, Marta Kwiatkowska, Tobias Meggendorfer, David Parker, Mateusz Ujma:
Learning Algorithms for Verification of Markov Decision Processes. CoRR abs/2403.09184 (2024) - 2023
- [j16]Jirí Horák, Katarína Furmanová, Barbora Kozlíková, Tomás Brázdil, Petr Holub
, M. Kacenga, Matej Gallo
, R. Nenutil
, Jan Byska
, Vít Rusnák:
xOpat: eXplainable Open Pathology Analysis Tool. Comput. Graph. Forum 42(3): 63-73 (2023) - 2022
- [c57]Tomás Brázdil, David Klaska, Antonín Kucera, Vít Musil, Petr Novotný, Vojtech Rehák:
On-the-fly adaptation of patrolling strategies in changing environments. UAI 2022: 244-254 - [i38]Tomás Brázdil, David Klaska, Antonín Kucera, Vít Musil, Petr Novotný, Vojtech Rehák:
On-the-fly Adaptation of Patrolling Strategies in Changing Environments. CoRR abs/2206.08096 (2022) - 2020
- [c56]Tomás Brázdil, Krishnendu Chatterjee, Petr Novotný
, Jiri Vahala:
Reinforcement Learning of Risk-Constrained Policies in Markov Decision Processes. AAAI 2020: 9794-9801 - [c55]Frantisek Blahoudek
, Tomás Brázdil, Petr Novotný
, Melkior Ornik, Pranay Thangeda, Ufuk Topcu
:
Qualitative Controller Synthesis for Consumption Markov Decision Processes. CAV (2) 2020: 421-447 - [i37]Tomás Brázdil, Krishnendu Chatterjee, Petr Novotný, Jiri Vahala:
Reinforcement Learning of Risk-Constrained Policies in Markov Decision Processes. CoRR abs/2002.12086 (2020) - [i36]Frantisek Blahoudek, Tomás Brázdil, Petr Novotný, Melkior Ornik, Pranay Thangeda, Ufuk Topcu:
Qualitative Controller Synthesis for Consumption Markov Decision Processes. CoRR abs/2005.07227 (2020)
2010 – 2019
- 2019
- [c54]Natasha Alechina, Tomás Brázdil, Giuseppe De Giacomo, Paolo Felli, Brian Logan, Moshe Y. Vardi:
Unbounded Orchestrations of Transducers for Manufacturing. AAAI 2019: 2646-2653 - [c53]Tomás Brázdil, Krishnendu Chatterjee, Antonín Kucera, Petr Novotný
, Dominik Velan:
Deciding Fast Termination for Probabilistic VASS with Nondeterminism. ATVA 2019: 462-478 - [c52]Pranav Ashok
, Tomás Brázdil, Krishnendu Chatterjee, Jan Kretínský, Christoph H. Lampert, Viktor Toman
:
Strategy Representation by Decision Trees with Linear Classifiers. QEST 2019: 109-128 - [i35]Pranav Ashok, Tomás Brázdil, Krishnendu Chatterjee, Jan Kretínský, Christoph H. Lampert, Viktor Toman:
Strategy Representation by Decision Trees with Linear Classifiers. CoRR abs/1906.08178 (2019) - [i34]Tomás Brázdil, Krishnendu Chatterjee, Antonín Kucera, Petr Novotný, Dominik Velan:
Deciding Fast Termination for Probabilistic VASS with Nondeterminism. CoRR abs/1907.11010 (2019) - 2018
- [c51]Tomás Brázdil, Antonín Kucera, Vojtech Rehák:
Solving Patrolling Problems in the Internet Environment. IJCAI 2018: 121-127 - [c50]Pranav Ashok
, Tomás Brázdil, Jan Kretínský, Ondrej Slámecka:
Monte Carlo Tree Search for Verifying Reachability in Markov Decision Processes. ISoLA (2) 2018: 322-335 - [c49]Tomás Brázdil, Krishnendu Chatterjee
, Antonín Kucera
, Petr Novotný
, Dominik Velan, Florian Zuleger
:
Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS. LICS 2018: 185-194 - [c48]Tomás Brázdil, Krishnendu Chatterjee, Jan Kretínský
, Viktor Toman
:
Strategy Representation by Decision Trees in Reactive Synthesis. TACAS (1) 2018: 385-407 - [i33]Tomás Brázdil, Krishnendu Chatterjee, Jan Kretínský, Viktor Toman:
Strategy Representation by Decision Trees in Reactive Synthesis. CoRR abs/1802.00758 (2018) - [i32]Tomás Brázdil, Krishnendu Chatterjee, Antonín Kucera, Petr Novotný, Dominik Velan, Florian Zuleger:
Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS. CoRR abs/1804.10985 (2018) - [i31]Tomás Brázdil, Antonín Kucera, Vojtech Rehák:
Synthesizing Efficient Solutions for Patrolling Problems in the Internet Environment. CoRR abs/1805.02861 (2018) - [i30]Pranav Ashok, Tomás Brázdil, Jan Kretínský, Ondrej Slámecka:
Monte Carlo Tree Search for Verifying Reachability in Markov Decision Processes. CoRR abs/1809.03299 (2018) - 2017
- [j15]Tomás Brázdil, Krishnendu Chatterjee
, Vojtech Forejt, Antonín Kucera
:
Trading performance for stability in Markov decision processes. J. Comput. Syst. Sci. 84: 144-170 (2017) - [j14]Ezio Bartocci
, Luca Bortolussi
, Tomás Brázdil, Dimitrios Milios, Guido Sanguinetti
:
Policy learning in continuous-time Markov decision processes using Gaussian Processes. Perform. Evaluation 116: 84-100 (2017) - [i29]Tomás Brázdil, Krishnendu Chatterjee, Antonín Kucera, Petr Novotný, Dominik Velan:
Efficient Algorithms for Checking Fast Termination in VASS. CoRR abs/1708.09253 (2017) - 2016
- [c47]Tomás Brázdil, Krishnendu Chatterjee, Martin Chmelik, Anchit Gupta, Petr Novotný:
Stochastic Shortest Path with Energy Constraints in POMDPs: (Extended Abstract). AAMAS 2016: 1465-1466 - [c46]Tomás Brázdil, Antonín Kucera
, Petr Novotný
:
Optimizing the Expected Mean Payoff in Energy Markov Decision Processes. ATVA 2016: 32-49 - [c45]Tomás Brázdil, Vojtech Forejt, Antonín Kucera, Petr Novotný
:
Stability in Graphs and Games. CONCUR 2016: 10:1-10:14 - [c44]Ezio Bartocci
, Luca Bortolussi
, Tomás Brázdil, Dimitrios Milios, Guido Sanguinetti
:
Policy Learning for Time-Bounded Reachability in Continuous-Time Markov Decision Processes via Doubly-Stochastic Gradient Ascent. QEST 2016: 244-259 - [i28]Tomás Brázdil, Krishnendu Chatterjee, Martin Chmelik, Anchit Gupta, Petr Novotný:
Stochastic Shortest Path with Energy Constraints in POMDPs. CoRR abs/1602.07565 (2016) - [i27]Tomás Brázdil, Vojtech Forejt, Antonín Kucera, Petr Novotný:
Stability in Graphs and Games. CoRR abs/1604.06386 (2016) - [i26]Ezio Bartocci, Luca Bortolussi, Tomás Brázdil, Dimitrios Milios, Guido Sanguinetti:
Policy learning for time-bounded reachability in Continuous-Time Markov Decision Processes via doubly-stochastic gradient ascent. CoRR abs/1605.09703 (2016) - [i25]Tomás Brázdil, Antonín Kucera, Petr Novotný:
Optimizing the Expected Mean Payoff in Energy Markov Decision Processes. CoRR abs/1607.00678 (2016) - 2015
- [j13]Tomás Brázdil, Stefan Kiefer, Antonín Kucera
, Ivana Hutarová Vareková:
Runtime analysis of probabilistic programs with unbounded recursion. J. Comput. Syst. Sci. 81(1): 288-310 (2015) - [c43]Tomás Brázdil, Krishnendu Chatterjee, Martin Chmelik, Andreas Fellner, Jan Kretínský:
Counterexample Explanation by Learning Small Strategies in Markov Decision Processes. CAV (1) 2015: 158-177 - [c42]Tomás Brázdil, Stefan Kiefer, Antonín Kucera
, Petr Novotný
:
Long-Run Average Behaviour of Probabilistic Vector Addition Systems. LICS 2015: 44-55 - [c41]Tomás Brázdil, Lubos Korenciak, Jan Krcál, Petr Novotný
, Vojtech Rehák
:
Optimizing Performance of Continuous-Time Stochastic Systems Using Timeout Synthesis. QEST 2015: 141-159 - [c40]Tomás Brázdil, Krishnendu Chatterjee, Vojtech Forejt, Antonín Kucera:
MultiGain: A Controller Synthesis Tool for MDPs with Multiple Mean-Payoff Objectives. TACAS 2015: 181-187 - [i24]Tomás Brázdil, Krishnendu Chatterjee, Vojtech Forejt, Antonín Kucera:
MultiGain: A controller synthesis tool for MDPs with multiple mean-payoff objectives. CoRR abs/1501.03093 (2015) - [i23]Tomás Brázdil, Krishnendu Chatterjee, Martin Chmelik, Andreas Fellner, Jan Kretínský:
Counterexample Explanation by Learning Small Strategies in Markov Decision Processes. CoRR abs/1502.02834 (2015) - [i22]Tomás Brázdil, Stefan Kiefer, Antonín Kucera, Petr Novotný:
Long-Run Average Behaviour of Probabilistic Vector Addition Systems. CoRR abs/1505.02655 (2015) - [i21]Tomás Brázdil, Petr Hlinený, Antonín Kucera, Vojtech Rehák, Matús Abaffy:
Strategy Synthesis in Adversarial Patrolling Games. CoRR abs/1507.03407 (2015) - 2014
- [j12]Tomás Brázdil, Václav Brozek, Krishnendu Chatterjee
, Vojtech Forejt, Antonín Kucera
:
Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. Log. Methods Comput. Sci. 10(1) (2014) - [j11]Tomás Brázdil, Stefan Kiefer, Antonín Kucera
:
Efficient Analysis of Probabilistic Programs with an Unbounded Counter. J. ACM 61(6): 41:1-41:35 (2014) - [j10]Tomás Brázdil, Václav Brozek, Vojtech Forejt, Antonín Kucera
:
Branching-time model-checking of probabilistic pushdown automata. J. Comput. Syst. Sci. 80(1): 139-156 (2014) - [c39]Michal Abaffy, Tomás Brázdil, Vojtech Rehák, Branislav Bosanský, Antonín Kucera, Jan Krcál:
Solving adversarial patrolling games with bounded error: (extended abstract). AAMAS 2014: 1617-1618 - [c38]Tomás Brázdil, Krishnendu Chatterjee, Martin Chmelik, Vojtech Forejt, Jan Kretínský, Marta Z. Kwiatkowska, David Parker
, Mateusz Ujma:
Verification of Markov Decision Processes Using Learning Algorithms. ATVA 2014: 98-114 - [c37]Tomás Brázdil, David Klaska, Antonín Kucera, Petr Novotný
:
Minimizing Running Costs in Consumption Systems. CAV 2014: 457-472 - [c36]Tomás Brázdil, Stefan Kiefer, Antonín Kucera, Petr Novotný
, Joost-Pieter Katoen
:
Zero-reachability in probabilistic multi-counter automata. CSL-LICS 2014: 22:1-22:10 - [i20]Tomás Brázdil, Stefan Kiefer, Antonín Kucera, Petr Novotný, Joost-Pieter Katoen:
Zero-Reachability in Probabilistic Multi-Counter Automata. CoRR abs/1401.6840 (2014) - [i19]Tomás Brázdil, Krishnendu Chatterjee, Martin Chmelik, Vojtech Forejt, Jan Kretínský, Marta Z. Kwiatkowska, David Parker, Mateusz Ujma:
Verification of Markov Decision Processes using Learning Algorithms. CoRR abs/1402.2967 (2014) - [i18]Tomás Brázdil, David Klaska, Antonín Kucera, Petr Novotný:
Minimizing Running Costs in Consumption Systems. CoRR abs/1402.4995 (2014) - [i17]Tomás Brázdil, Lubos Korenciak, Jan Krcál, Petr Novotný, Vojtech Rehák:
Optimizing Performance of Continuous-Time Stochastic Systems using Timeout Synthesis. CoRR abs/1407.4777 (2014) - 2013
- [j9]Tomás Brázdil, Javier Esparza
, Stefan Kiefer, Antonín Kucera
:
Analyzing probabilistic pushdown automata. Formal Methods Syst. Des. 43(2): 124-163 (2013) - [j8]Tomás Brázdil, Václav Brozek, Kousha Etessami, Antonín Kucera
:
Approximating the termination value of one-counter MDPs and stochastic games. Inf. Comput. 222: 121-138 (2013) - [j7]Tomás Brázdil, Vojtech Forejt, Jan Krcál, Jan Kretínský, Antonín Kucera
:
Continuous-time stochastic games with time-bounded reachability. Inf. Comput. 224: 46-70 (2013) - [c35]Tomás Brázdil, Taolue Chen
, Vojtech Forejt, Petr Novotný
, Aistis Simaitis:
Solvency Markov Decision Processes with Interest. FSTTCS 2013: 487-499 - [c34]Tomás Brázdil, Krishnendu Chatterjee, Vojtech Forejt, Antonín Kucera
:
Trading Performance for Stability in Markov Decision Processes. LICS 2013: 331-340 - [c33]Tomás Brázdil, Lubos Korenciak, Jan Krcál, Jan Kretínský, Vojtech Rehák
:
On time-average limits in deterministic and stochastic petri nets. ICPE 2013: 421-422 - [i16]Tomás Brázdil, Krishnendu Chatterjee, Vojtech Forejt, Antonín Kucera:
Trading Performance for Stability in Markov Decision Processes. CoRR abs/1305.4103 (2013) - [i15]Tomás Brázdil, Taolue Chen, Vojtech Forejt, Petr Novotný, Aistis Simaitis:
Solvency Markov Decision Processes with Interest. CoRR abs/1310.3119 (2013) - 2012
- [j6]Christel Baier
, Tomás Brázdil, Marcus Größer, Antonín Kucera
:
Stochastic game logic. Acta Informatica 49(4): 203-224 (2012) - [j5]Tomás Brázdil, Javier Esparza
, Stefan Kiefer, Michael Luttenberger:
Space-efficient scheduling of stochastically generated tasks. Inf. Comput. 210: 87-110 (2012) - [c32]Tomás Brázdil, Krishnendu Chatterjee, Antonín Kucera, Petr Novotný
:
Efficient Controller Synthesis for Consumption Games with Multiple Resource Types. CAV 2012: 23-38 - [c31]Tomás Brázdil, Holger Hermanns
, Jan Krcál, Jan Kretínský, Vojtech Rehák
:
Verification of Open Interactive Markov Chains. FSTTCS 2012: 474-485 - [c30]Tomás Brázdil, Antonín Kucera, Petr Novotný, Dominik Wojtczak
:
Minimizing Expected Termination Time in One-Counter Markov Decision Processes. ICALP (2) 2012: 141-152 - [c29]Tomás Brázdil, Antonín Kucera, Petr Novotný
:
Determinacy in Stochastic Games with Unbounded Payoff Functions. MEMICS 2012: 94-105 - [c28]Tomás Brázdil, Stefan Kiefer:
Stabilization of Branching Queueing Networks. STACS 2012: 507-518 - [i14]Tomás Brázdil, Krishnendu Chatterjee, Antonín Kucera, Petr Novotný:
Efficient Controller Synthesis for Consumption Games with Multiple Resource Types. CoRR abs/1202.0796 (2012) - [i13]Tomás Brázdil, Antonín Kucera, Petr Novotný, Dominik Wojtczak
:
Minimizing Expected Termination Time in One-Counter Markov Decision Processes. CoRR abs/1205.1473 (2012) - [i12]Tomás Brázdil, Antonín Kucera, Petr Novotný:
Determinacy in Stochastic Games with Unbounded Payoff Functions. CoRR abs/1208.1639 (2012) - 2011
- [j4]Tomás Brázdil, Václav Brozek, Antonín Kucera
, Jan Obdrzálek:
Qualitative reachability in stochastic BPA games. Inf. Comput. 209(8): 1160-1183 (2011) - [c27]Tomás Brázdil, Stefan Kiefer, Antonín Kucera:
Efficient Analysis of Probabilistic Programs with an Unbounded Counter. CAV 2011: 208-224 - [c26]Tomás Brázdil, Jan Krcál, Jan Kretínský, Vojtech Rehák:
Fixed-Delay Events in Generalized Semi-Markov Processes Revisited. CONCUR 2011: 140-155 - [c25]Tomás Brázdil, Jan Krcál, Jan Kretínský, Antonín Kucera, Vojtech Rehák:
Measuring performance of continuous-time stochastic processes using timed automata. HSCC 2011: 33-42 - [c24]Tomás Brázdil, Stefan Kiefer, Antonín Kucera, Ivana Hutarová Vareková:
Runtime Analysis of Probabilistic Programs with Unbounded Recursion. ICALP (2) 2011: 319-331 - [c23]Tomás Brázdil, Václav Brozek, Kousha Etessami, Antonín Kucera:
Approximating the Termination Value of One-Counter MDPs and Stochastic Games. ICALP (2) 2011: 332-343 - [c22]Tomás Brázdil, Václav Brozek, Krishnendu Chatterjee, Vojtech Forejt, Antonín Kucera
:
Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. LICS 2011: 33-42 - [i11]Tomás Brázdil, Jan Krcál, Jan Kretínský, Antonín Kucera, Vojtech Rehák:
Measuring Performance of Continuous-Time Stochastic Processes using Timed Automata. CoRR abs/1101.4204 (2011) - [i10]Tomás Brázdil, Stefan Kiefer, Antonín Kucera:
Efficient Analysis of Probabilistic Programs with an Unbounded Counter. CoRR abs/1102.2529 (2011) - [i9]Tomás Brázdil, Václav Brozek, Kousha Etessami, Antonín Kucera:
Approximating the Termination Value of One-Counter MDPs and Stochastic Games. CoRR abs/1104.4978 (2011) - [i8]Tomás Brázdil, Jan Krcál, Jan Kretínský, Vojtech Rehák:
Fixed-delay Events in Generalized Semi-Markov Processes Revisited. CoRR abs/1106.1424 (2011) - [i7]Tomás Brázdil, Stefan Kiefer:
Stabilization of Branching Queueing Networks. CoRR abs/1112.1041 (2011) - 2010
- [c21]Tomás Brázdil, Jan Krcál, Jan Kretínský, Antonín Kucera, Vojtech Rehák:
Stochastic Real-Time Games with Qualitative Timed Automata Objectives. CONCUR 2010: 207-221 - [c20]Tomás Brázdil, Václav Brozek, Kousha Etessami:
One-Counter Stochastic Games. FSTTCS 2010: 108-119 - [c19]Tomás Brázdil, Petr Jancar
, Antonín Kucera:
Reachability Games on Extended Vector Addition Systems with States. ICALP (2) 2010: 478-489 - [c18]Tomás Brázdil, Javier Esparza
, Stefan Kiefer, Michael Luttenberger:
Space-Efficient Scheduling of Stochastically Generated Tasks. ICALP (2) 2010: 539-550 - [c17]Tomás Brázdil, Václav Brozek, Kousha Etessami, Antonín Kucera, Dominik Wojtczak
:
One-Counter Markov Decision Processes. SODA 2010: 863-874 - [i6]Tomás Brázdil, Petr Jancar, Antonín Kucera:
Reachability Games on Extended Vector Addition Systems with States. CoRR abs/1002.2557 (2010) - [i5]Tomás Brázdil, Václav Brozek, Antonín Kucera, Jan Obdrzálek:
Qualitative Reachability in Stochastic BPA Games. CoRR abs/1003.0118 (2010) - [i4]Tomás Brázdil, Javier Esparza, Stefan Kiefer, Michael Luttenberger:
Space-efficient scheduling of stochastically generated tasks. CoRR abs/1004.4286 (2010) - [i3]Tomás Brázdil, Stefan Kiefer, Antonín Kucera, Ivana Hutarová Vareková:
Runtime Analysis of Probabilistic Programs with Unbounded Recursion. CoRR abs/1007.1710 (2010) - [i2]Tomás Brázdil, Václav Brozek, Kousha Etessami:
One-Counter Stochastic Games. CoRR abs/1009.5636 (2010)
2000 – 2009
- 2009
- [c16]Tomás Brázdil, Javier Esparza
, Stefan Kiefer:
On the Memory Consumption of Probabilistic Pushdown Automata. FSTTCS 2009: 49-60 - [c15]Tomás Brázdil, Vojtech Forejt, Jan Krcál, Jan Kretínský, Antonín Kucera:
Continuous-Time Stochastic Games with Time-Bounded Reachability. FSTTCS 2009: 61-72 - [c14]Tomás Brázdil, Václav Brozek, Antonín Kucera, Jan Obdrzálek:
Qualitative Reachability in Stochastic BPA Games. STACS 2009: 207-218 - [c13]Tomás Brázdil, Václav Brozek, Vojtech Forejt:
Branching-Time Model-Checking of Probabilistic Pushdown Automata. INFINITY 2009: 73-83 - [i1]Tomás Brázdil, Václav Brozek, Kousha Etessami, Antonín Kucera, Dominik Wojtczak
:
One-Counter Markov Decision Processes. CoRR abs/0904.2511 (2009) - 2008
- [j3]Tomás Brázdil, Antonín Kucera
, Oldrich Strazovský:
Deciding probabilistic bisimilarity over infinite-state probabilistic systems. Acta Informatica 45(2): 131-154 (2008) - [j2]Tomás Brázdil, Václav Brozek, Vojtech Forejt, Antonín Kucera
:
Reachability in recursive Markov decision processes. Inf. Comput. 206(5): 520-537 (2008) - [c12]Tomás Brázdil, Vojtech Forejt, Antonín Kucera:
Controller Synthesis and Verification for Markov Decision Processes with Qualitative Branching Time Objectives. ICALP (2) 2008: 148-159 - [c11]Tomás Brázdil, Vojtech Forejt, Jan Kretínský, Antonín Kucera
:
The Satisfiability Problem for Probabilistic CTL. LICS 2008: 391-402 - [c10]Tomás Brázdil, Václav Brozek, Jan Holecek, Antonín Kucera
:
Discounted Properties of Probabilistic Pushdown Automata. LPAR 2008: 230-242 - 2007
- [c9]Tomás Brázdil, Vojtech Forejt:
Strategy Synthesis for Markov Decision Processes and Branching-Time Logics. CONCUR 2007: 428-444 - [c8]Christel Baier, Tomás Brázdil, Marcus Größer, Antonín Kucera
:
Stochastic Game Logic. QEST 2007: 227-236 - 2006
- [j1]Tomás Brázdil, Ivana Cerná:
Model Checking of RegCTL. Comput. Artif. Intell. 25(1): 81-97 (2006) - [c7]Tomás Brázdil, Václav Brozek, Vojtech Forejt, Antonín Kucera:
Reachability in Recursive Markov Decision Processes. CONCUR 2006: 358-374 - [c6]Tomás Brázdil, Václav Brozek, Vojtech Forejt, Antonín Kucera
:
Stochastic Games with Branching-Time Winning Objectives. LICS 2006: 349-358 - 2005
- [c5]Tomás Brázdil, Javier Esparza
, Antonín Kucera
:
Analysis and Prediction of the Long-Run Behavior of Probabilistic Sequential Programs with Recursion (Extended Abstract). FOCS 2005: 521-530 - [c4]Tomás Brázdil, Antonín Kucera:
Computing the Expected Accumulated Reward and Gain for a Subclass of Infinite Markov Chains. FSTTCS 2005: 372-383 - [c3]Tomás Brázdil, Antonín Kucera, Oldrich Strazovský:
On the Decidability of Temporal Properties of Probabilistic Pushdown Automata. STACS 2005: 145-157 - 2004
- [c2]Tomás Brázdil, Antonín Kucera, Oldrich Strazovský:
Deciding Probabilistic Bisimilarity Over Infinite-State Probabilistic Systems. CONCUR 2004: 193-208 - 2002
- [c1]Tomás Brázdil, Ivana Cerná
:
Local Distributed Model Checking of RegCTL. PDMC@CONCUR 2002: 575-588
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint