Theses on a related topic (having the same keywords):

probabilistic computation tree logic, pctl, the satisfiability problem for pctl

Keywords ordered alphabetically | Keywords ordered by occurrence rate

1.
Brožek, Václav
Faculty: Faculty of Informatics
Year: 2007, studies completed, degree conferred: Mgr.
Programme/field: Informatics / Informatics
Master's thesis defence: Decidability and complexity of infinite-state stochastic games | Theses on a related topic Display description

2.
Forejt, Vojtěch
Faculty: Faculty of Informatics
Year: 2007, studies completed, degree conferred: Mgr.
Programme/field: Informatics / Informatics
Master's thesis defence: Decidability and complexity of finite-state stochastic games | Theses on a related topic

3.
Forejt, Vojtěch
Faculty: Faculty of Informatics
Year: 2008, studies completed, degree conferred: RNDr.
Programme/field: Informatics / Informatics
Advanced Master's thesis defence: Formal Verification of Finite-State Stochastic Systems | Theses on a related topic

4.
Chodil, Miroslav
Faculty: Faculty of Informatics
Year: 2019, studies completed, degree conferred: Mgr.
Programme/field: Informatics / Theoretical Informatics
Master's thesis defence: Problém splnitelnosti pro pravděpodobnostní temporální logiky | Theses on a related topic

5.
Křetínský, Jan
Faculty: Faculty of Informatics
Year: 2009, studies completed, degree conferred: Mgr.
Programme/field: Informatics / Parallel and Distributed Systems
Master's thesis defence: Fundamental Properties of Probabilistic Branching-Time Logics | Theses on a related topic