KUČERA, Antonín and Oldřich STRAŽOVSKÝ. On the Controller Synthesis for Finite-State Markov Decision Processes. Fundamenta Informaticae. Polsko: IOS Press, Nizozemí, vol. 82, 1-2, p. 141-153. ISSN 0169-2968. 2008.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name On the Controller Synthesis for Finite-State Markov Decision Processes
Name in Czech Algoritmická syntéza řídících jednotek pro konečné Markovovy rozhodovací procesy
Authors KUČERA, Antonín (203 Czech Republic, guarantor) and Oldřich STRAŽOVSKÝ (203 Czech Republic).
Edition Fundamenta Informaticae, Polsko, IOS Press, Nizozemí, 2008, 0169-2968.
Other information
Original language English
Type of outcome Article in a journal
Field of Study 10201 Computer sciences, information science, bioinformatics
Country of publisher Netherlands
Confidentiality degree is not subject to a state or trade secret
Impact factor Impact factor: 0.715
RIV identification code RIV/00216224:14330/08:00025760
Organization unit Faculty of Informatics
UT WoS 000252980000010
Keywords in English Markov decision process; temporal logic
Tags Markov decision process, temporal logic
Tags International impact, Reviewed
Changed by Changed by: prof. RNDr. Antonín Kučera, Ph.D., učo 2508. Changed: 22/5/2009 15:13.
Abstract
We study the problem of effective controller synthesis for finite-state Markov decision processes (MDPs) and the class of properties definable in the logic PCTL extended with long-run average propositions. We show that the existence of such a controller is decidable, and we give an algorithm which computes the controller if it exists. We also address the issue of ``controller robustness'', i.e., the problem whether there is a controller which still guarantees the satisfaction of a given property when the probabilities in the considered MDP slightly deviate from their original values. From a practical point of view, this is an important aspect since the probabilities are often determined empirically and hence they are inherently imprecise. We show that the existence of robust controllers is also decidable, and that such controllers are effectively computable if they exist.
Abstract (in Czech)
V článku se zkoumá problematika algoritmické syntézy řídících jednotek pro konečné Markovovy rozhodovací procesy a třídu vlastností definovatelných pomocí temporální logiky PCTL rozšířené o predikáty umožňující popsat limitní chování běhů. Je ukázáno, že problém existence vhodné řídící jednotky je algoritmicky rozhodnutelný a je podán algoritmus na jeho konstrukci.
Links
MSM0021622419, plan (intention)Name: Vysoce paralelní a distribuované výpočetní systémy
Investor: Ministry of Education, Youth and Sports of the CR, Highly Parallel and Distributed Computing Systems
1M0545, research and development projectName: Institut Teoretické Informatiky
Investor: Ministry of Education, Youth and Sports of the CR, Institute for Theoretical Computer Science
PrintDisplayed: 18/4/2024 07:44