Bc. Miroslav Chodil

Master's thesis

Problém splnitelnosti pro pravděpodobnostní temporální logiky

The satisfiability problem for probabilistic temporal logics
Abstract:
Táto práca sa zaoberá problémom splnitelnosti pre pravdepodobnostnú logiku PCTL. PCTL je populárny formalizmus pre špecifikáciu vlastností stochastických systémov. Problém splnitelnosti pre PCTL je dlhodobo otvorený problém zaujímavý z teoretickej stránky, jeho riešenie by ale malo aj praktické využitie, ako napríklad overovanie konzistencie špecifikácií. Najprv práca podáva prehľad známych výsledkov …more
Abstract:
In this thesis, we study the satisfiability problem for PCTL. PCTL is a popular formalism for specifying properties of stochastic systems. The satisfiability problem for PCTL is a longstanding open problem interesting from a theoretical perspective, although its solution would also have various practical applications, such as consistency checking for specifications. We give an overview of known results …more
 

Keywords

pctl probabilistic ctl satisfiability probabilistic temporal logics
 
Language used: English
Date on which the thesis was submitted / produced: 20. 5. 2019
Identifier: https://is.muni.cz/th/zn1az/

Thesis defence

  • Date of defence: 20. 6. 2019
  • Supervisor: prof. RNDr. Antonín Kučera, Ph.D.
  • Reader: doc. RNDr. Tomáš Brázdil, Ph.D.

Citation record

Cite this text

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 informatiky
Složka Reference to the local database directory of the institution

Masaryk University

Faculty of Informatics

Master programme / field:
Informatics / Theoretical Informatics

Theses on a related topic

List of theses with an identical keyword.