Bc. Dávid Meluš

Bachelor's thesis

Extending the Synthesis Algorithm for Consumption MDPs with LTL Objectives

Extending the Synthesis Algorithm for Consumption MDPs with LTL Objectives
Abstract:
Záverečná práca rozširuje algoritmus pre syntézu stratégií v Markovových rozhodovacích procesoch s obmedzenými zdrojmi (CMDPs) s ponechaním polynomiálnej časovej zložitosti. Rozširujeme existujúci algoritmus o všeobecné CMDPs a všeobecnejšie omega-regulárne kritériá. Za týmto účelom sa definuje niekoľko problémov pre CMDPs, kde každý problém je potrebný na vyriešenie nadchádzajúceho. Ďalej ukazujeme …more
Abstract:
This thesis is focused on extending the strategy synthesis algorithm for consumption Markov decision processes (CMDPs) while preserving polynomial time complexity. We extend the existing algorithm to general CMDPs and more general omega-regular objectives. To achieve this, we define several problems for CMDPs, each of which is required to solve the following one.Furthermore, we provide a lower complexity …more
 

Keywords

Markov decision process consumption MDP decreasing CMDP reload state safety objective positive reachability Büchi Parity Rabin objective memoryless strategy finite memory strategy polynomial time strategy synthesis
 
Language used: English
Date on which the thesis was submitted / produced: 25. 5. 2021
Identifier: https://is.muni.cz/th/uwna5/

Thesis defence

  • Date of defence: 1. 7. 2021
  • Supervisor: RNDr. Petr Novotný, Ph.D.
  • Reader: RNDr. David Klaška

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