Algorithms for Analyzing and Verifying Infinite-State Recursive Probabilistic Systems

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.
Original languageEnglish
Title of host publicationLanguage and Automata Theory and Applications - 7th International Conference, LATA 2013, Bilbao, Spain, April 2-5, 2013. Proceedings
Subtitle of host publication7th International Conference, LATA 2013, Bilbao, Spain, April 2-5, 2013. Proceedings
PublisherSpringer Berlin Heidelberg
Pages12
Number of pages1
Volume7810
ISBN (Electronic)978-3-642-37064-9
ISBN (Print)978-3-642-37063-2
DOIs
Publication statusPublished - 2013

Fingerprint

Dive into the research topics of 'Algorithms for Analyzing and Verifying Infinite-State Recursive Probabilistic Systems'. Together they form a unique fingerprint.

Cite this