Abstract / Description of output
Until recent years, research on automated verification and model checking of probabilistic systems was largely confined to using finite-state Markov chains (MCs) and finite-state Markov Decision processes (MDPs) as the core underlying models. In recent years, researchers have begun to develop new algorithms for, and study the computational complexity of, analysis and verification problems for classes of finitely-presented infinite-state probabilistic systems that arise as probabilistic extensions to classic infinite-state automata-theoretic models.
|Title of host publication||Language and Automata Theory and Applications - 7th International Conference, LATA 2013, Bilbao, Spain, April 2-5, 2013. Proceedings|
|Subtitle of host publication||7th International Conference, LATA 2013, Bilbao, Spain, April 2-5, 2013. Proceedings|
|Publisher||Springer Berlin Heidelberg|
|Number of pages||1|
|Publication status||Published - 2013|