The satisfiability problem for Probabilistic CTL – Mgr. Chodil Chodil
Mgr. Chodil Chodil
Advanced ('rigorózní') thesis
The satisfiability problem for Probabilistic CTL
The satisfiability problem for Probabilistic CTL
Abstract:
Probabilistic CTL (PCTL) je pravdepodobnostné rozšírenie známej temporálnej logiky vetviaceho času CTL. V PCTL sú existenčné a univerzálne kvantifikátory ciest nahradené pravdepodobnostným kvantifikátorom ciest, čo umožňuje kvantifikáciu nad pravdepodobnosťou ciest spĺňajúcich nejakú formulu ciest. Navrhovaná dizertačná práca je zameraná na štúdium problému splnitelnosti pre PCTL. Problém splnitelnosti …moreAbstract:
Probabilistic CTL (PCTL) is a probabilistic extension of the well-known temporal branching-time logic CTL. In PCTL, the existential and universal path quantifiers are replaced by a probabilistic path quantifier, which allows it to quantify over probability of paths that satisfy path formulae. The proposed thesis aims to study the satisfiability problem for PCTL. The satisfiability problem for PCTL …more
Language used: English
Date on which the thesis was submitted / produced: 24. 2. 2022
Identifier:
https://is.muni.cz/th/flkcr/
Thesis defence
- Date of defence: 26. 5. 2022
- Reader: doc. Dr. rer. nat. RNDr. Mgr. Bc. Jan Křetínský, Ph.D., Prof. Nir Piterman
Full text of thesis
Contents of on-line thesis archive
Published in Theses:- světu
Other ways of accessing the text
Institution archiving the thesis and making it accessible: Masarykova univerzita, Fakulta informatikyMasaryk University
Faculty of InformaticsAdvanced ('rigorózní řízení') programme / field:
Theoretical computer science / Theoretical computer science