Verification of Probabilistic Recursive Sequential Programs – RNDr. Tomáš Brázdil, Ph.D.
RNDr. Tomáš Brázdil, Ph.D.
Doctoral thesis
Verification of Probabilistic Recursive Sequential Programs
Verification of Probabilistic Recursive Sequential Programs
Abstract:
This work studies algorithmic verification of infinite-state probabilistic systems generated by probabilistic pushdown automata (pPDA). Probabilistic pushdown automata are obtained as a probabilistic variant of pushdown automata that proved to be a successful abstract model of recursive sequential programs. The main aim of this work is to study decidability and complexity of the problem whether a given …more
Language used: English
Date on which the thesis was submitted / produced: 20. 4. 2007
Identifier:
https://is.muni.cz/th/pxz9s/
Thesis defence
- Date of defence: 20. 4. 2007
- Supervisor: prof. RNDr. Antonín Kučera, Ph.D.
Citation record
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 InformaticsDoctoral programme / field:
Informatics / Informatics