Model Checking and Decision Procedures for Probabilistic Automata and Markov Chains

Finite-state probabilistic automata were introduced by Michael Rabin in the 1960s and have recently been the subject of renewed interest. In the first half of this tutorial we review classical results and open problems on the complexity of decision problems for probabilistic automata, including the...

Full description

Saved in:
Bibliographic Details
Published inProceedings, Quantitative Evaluation of Systems : QEST 2008 : 14-17 September 2008, St. Malo, France p. 322
Main Author Worrell, J.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.09.2008
Subjects
Automata
Biological system modeling
Complexity theory
Computational modeling
Probabilistic logic
Tutorials
Online AccessGet full text

Cover

More Information
Summary:Finite-state probabilistic automata were introduced by Michael Rabin in the 1960s and have recently been the subject of renewed interest. In the first half of this tutorial we review classical results and open problems on the complexity of decision problems for probabilistic automata, including the analogs of language inclusion, language equivalence and language emptiness.
ISBN:0769533604
9780769533605
DOI:10.1109/QEST.2008.54