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

satisfiability, probabilistic ctl, probabilistic temporal logics, pctl

Keywords ordered alphabetically | Keywords ordered by occurrence rate

1.
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 Display description

2.
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

3.
Fiedler, Adam
Faculty: Faculty of Informatics
Year: 2022, studies completed, degree conferred: Mgr.
Programme/field: Theoretical computer science / Principles of programming languages
Master's thesis defence: Deduction in Matching Logic | Theses on a related topic

4.
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

5.
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

6.
Chodil, Miroslav
Faculty: Faculty of Informatics
Year: 2022, studies completed, degree conferred: Mgr.
Programme/field: Theoretical computer science / Theoretical computer science
Master's thesis defence: The satisfiability problem for Probabilistic CTL | Theses on a related topic

7.
Jankaničová, Natália
Faculty: Faculty of Informatics
Year: 2022, studies completed, degree conferred: Mgr.
Programme/field: Informatics / Theoretical Informatics
Master's thesis defence: Algorithms for Counting of Maximal Satisfiable Subsets | Theses on a related topic

8.
Jonáš, Martin
Faculty: Faculty of Informatics
Year: 2019, studies completed, degree conferred: Ph.D.
Programme/field: Informatics (4-years) / Informatics
Doctoral thesis defence: Satisfiability of Quantified Bit-Vector Formulas: Theory and Practice | Theses on a related topic

9.
Jonáš, Martin
Faculty: Faculty of Informatics
Year: 2017, studies completed, degree conferred: RNDr.
Programme/field: Informatics / Informatics
Advanced Master's thesis defence: SMT Solving for the Theory of Bit-Vectors | Theses on a related topic

10.
Podhorská, Zuzana
Faculty: Faculty of Informatics
Year: 2015, studies completed, degree conferred: Bc.
Programme/field: Applied Informatics / Applied Informatics
Bachelor's thesis defence: Animace ve výuce logiky | Theses on a related topic

11.
Síč, Juraj
Faculty: Faculty of Informatics
Year: 2020, studies completed, degree conferred: Mgr.
Programme/field: Informatics / Theoretical Informatics
Master's thesis defence: Satisfiability of DQBF Using Binary Decision Diagrams | Theses on a related topic