Bc. Adam Tuček
Master's thesis
Paritní hry
Parity games
Abstract:
Paritní hry jsou důležitým výpočetním problémem v informatice. Problém řešení paritních her je ekvivalentní problému ověřování modelů μ-kalkulu. Ale ani po velkém pokroku v posledních letech není známo jestli problém řešení paritních her je v P nebo je NP-kompletní. Tato práce prezentuje mnoho důležitých algoritmů pro řešení paritních her, vysvětluje jak pracují a sjednocuje jazyk používaný mezi těmito …moreAbstract:
Parity games are an important computational problem in computer science. The problem of solving a parity game is equivalent to the problem of model checking of μ-calculus. But even after a lot of progress in the recent years, it is not known whether or not solving parity games is in P or it is NP-complete. This thesis presents many important algorithms for solving parity games, explains how they work …more
Language used: English
Date on which the thesis was submitted / produced: 11. 12. 2019
Identifier:
https://is.muni.cz/th/vfh4f/
Thesis defence
- Date of defence: 3. 2. 2020
- Supervisor: doc. Mgr. Jan Obdržálek, PhD.
- Reader: doc. RNDr. Jan Strejček, Ph.D.
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 InformaticsMaster programme / field:
Informatics / Theoretical Informatics
Theses on a related topic
-
Formal Methods for Model Selection in Systems Biology
Matej Hajnal -
Exploration of formal methods and their applicability in verification of multiprecision arithmetic libraries
Himanshu Kumar Haran -
Automata for Formal Methods: Little Steps Towards Perfection
František Blahoudek -
Formal Methods in Optimal Discrete Path Planning with Uncertainty
Mária Svoreňová -
Quantitative Formal Methods for High-level Robot Path Planning
Jana Tůmová -
Formal representation of graphical models of biological systems
Samuel Kulíšek