doc. RNDr. Tomáš Brázdil, Ph.D.
Associate professor, Department of Machine Learning and Data Processing
Office: S214
Botanická 554/68a
602 00 Brno
Phone: | +420 549 49 3922 |
---|---|
E‑mail: |
social and academic networks: |
---|
Total number of publications: 80
2009
-
Continuous-Time Stochastic Games with Time-Bounded Reachability
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2009), year: 2009
-
On the memory consumption of probabilistic pushdown automata
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2009), year: 2009
-
Qualitative Reachability in Stochastic BPA Games
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, year: 2009
2008
-
Controller Synthesis and Verification for Markov Decision Processes with Qualitative Branching Time Objectives
Automata, Languages and Programming. 35th International Colloquium, ICALP 2008. Reykjavik, Iceland, July 2008. Proceedings, Part II., year: 2008
-
Deciding probabilistic bisimilarity over infinite-state probabilistic systems
Acta informatica, year: 2008, volume: 45, edition: 2
-
Discounted Properties of Probabilistic Pushdown Automata
Logic for Programming, Artificial Intelligence, and Reasoning, 15th International Conference, LPAR 2008, year: 2008
-
Reachability in Recursive Markov Decision Processes
Information and Computation, year: 2008, volume: 206, edition: 5
-
The Satisfiability Problem for Probabilistic CTL
23rd IEEE Symposium on Logic in Computer Science (LICS 2008), 24-27 June 2008, Pittsburgh, USA, Proceedings, year: 2008
2007
-
Branching-Time Model-Checking of Probabilistic Pushdown Automata
Proc. of 9th Internat. Workshop on Verification of Infinite-State Systems, year: 2007
-
Branching-Time Model-Checking of Probabilistic Pushdown Automata
Year: 2007, type: Appeared in Conference without Proceedings