KUČERA, Antonín and Oldřich STRAŽOVSKÝ. On the Controller Synthesis for Finite-State Markov Decision Processes. In 25th International Conference on Foundations of Software Technology and Theoretical Computer Science. Berlin Heidelberg New York: Springer, 2005, p. 541-552. ISBN 3-540-30495-9.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name On the Controller Synthesis for Finite-State Markov Decision Processes
Name in Czech O syntéze řídících jednotek pro Markovovy rozhodovací procesy s konečně mnoha stavy
Authors KUČERA, Antonín (203 Czech Republic, guarantor) and Oldřich STRAŽOVSKÝ (203 Czech Republic).
Edition Berlin Heidelberg New York, 25th International Conference on Foundations of Software Technology and Theoretical Computer Science, p. 541-552, 12 pp. 2005.
Publisher Springer
Other information
Original language English
Type of outcome Proceedings paper
Field of Study 10201 Computer sciences, information science, bioinformatics
Country of publisher United States of America
Confidentiality degree is not subject to a state or trade secret
RIV identification code RIV/00216224:14330/05:00012780
Organization unit Faculty of Informatics
ISBN 3-540-30495-9
UT WoS 000234885800044
Keywords in English Controller Synthesis; Markov Decision Processes
Tags Controller Synthesis, Markov decision processes
Tags International impact, Reviewed
Changed by Changed by: prof. RNDr. Antonín Kučera, Ph.D., učo 2508. Changed: 30/3/2010 20:22.
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 je studována problematika efektivní syntézy řídících jednotek pro Markovovy rozhodovací procesy s konečně mnoha stavy a třídu vlastností definovatelných v logice PCTL rozšířené o limitní vlastnosti běhů. Je dokázáno, že problém existence takových řídících jednotek je rozhodnutelný a je podán algoritmus pro jejich konstrukci. Je také podrobněji rozebrána otázka stability řídících jednotek.
Links
GA201/03/1161, research and development projectName: Verifikace nekonečně stavových systémů
Investor: Czech Science Foundation, Verification of infinite-state systems
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: 28/5/2024 11:34