Algorithms for Analyzing and Verifying Infinite-State Recursive Probabilistic Systems

Kousha Etessami

doi:10.1007/978-3-642-37064-9_2

Algorithms for Analyzing and Verifying Infinite-State Recursive Probabilistic Systems

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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.

Original language	English
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
Pages	12
Number of pages	1
Volume	7810
ISBN (Electronic)	978-3-642-37064-9
ISBN (Print)	978-3-642-37063-2
DOIs	https://doi.org/10.1007/978-3-642-37064-9_2
Publication status	Published - 2013

Access to Document

10.1007/978-3-642-37064-9_2

http://dx.doi.org/10.1007/978-3-642-37064-9_2

Cite this

Etessami, K. (2013). Algorithms for Analyzing and Verifying Infinite-State Recursive Probabilistic Systems. In Language and Automata Theory and Applications - 7th International Conference, LATA 2013, Bilbao, Spain, April 2-5, 2013. Proceedings: 7th International Conference, LATA 2013, Bilbao, Spain, April 2-5, 2013. Proceedings (Vol. 7810, pp. 12). Springer. https://doi.org/10.1007/978-3-642-37064-9_2

@inproceedings{89b247f28a5d47b988bdf2674d47db64,

title = "Algorithms for Analyzing and Verifying Infinite-State Recursive Probabilistic Systems",

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.",

author = "Kousha Etessami",

year = "2013",

doi = "10.1007/978-3-642-37064-9_2",

language = "English",

isbn = "978-3-642-37063-2",

volume = "7810",

pages = "12",

booktitle = "Language and Automata Theory and Applications - 7th International Conference, LATA 2013, Bilbao, Spain, April 2-5, 2013. Proceedings",

publisher = "Springer",

}

Etessami, K 2013, Algorithms for Analyzing and Verifying Infinite-State Recursive Probabilistic Systems. in Language and Automata Theory and Applications - 7th International Conference, LATA 2013, Bilbao, Spain, April 2-5, 2013. Proceedings: 7th International Conference, LATA 2013, Bilbao, Spain, April 2-5, 2013. Proceedings. vol. 7810, Springer, pp. 12. https://doi.org/10.1007/978-3-642-37064-9_2

Algorithms for Analyzing and Verifying Infinite-State Recursive Probabilistic Systems. / Etessami, Kousha.
Language and Automata Theory and Applications - 7th International Conference, LATA 2013, Bilbao, Spain, April 2-5, 2013. Proceedings: 7th International Conference, LATA 2013, Bilbao, Spain, April 2-5, 2013. Proceedings. Vol. 7810 Springer, 2013. p. 12.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Algorithms for Analyzing and Verifying Infinite-State Recursive Probabilistic Systems

AU - Etessami, Kousha

PY - 2013

Y1 - 2013

N2 - 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.

AB - 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.

U2 - 10.1007/978-3-642-37064-9_2

DO - 10.1007/978-3-642-37064-9_2

M3 - Conference contribution

SN - 978-3-642-37063-2

VL - 7810

SP - 12

BT - Language and Automata Theory and Applications - 7th International Conference, LATA 2013, Bilbao, Spain, April 2-5, 2013. Proceedings

PB - Springer

ER -

Etessami K. Algorithms for Analyzing and Verifying Infinite-State Recursive Probabilistic Systems. In Language and Automata Theory and Applications - 7th International Conference, LATA 2013, Bilbao, Spain, April 2-5, 2013. Proceedings: 7th International Conference, LATA 2013, Bilbao, Spain, April 2-5, 2013. Proceedings. Vol. 7810. Springer. 2013. p. 12 doi: 10.1007/978-3-642-37064-9_2

Algorithms for Analyzing and Verifying Infinite-State Recursive Probabilistic Systems

Abstract / Description of output

Access to Document

Fingerprint

Cite this