INFAMY: An Infinite-State Markov Model Checker

Ernst Moritz Hahn, Holger Hermanns, Björn Wachter, Lijun Zhang

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

18 Citations (Scopus)


The design of complex concurrent systems often involves intricate performance and dependability considerations. Continuous-time Markov chains (CTMCs) are a widely used modeling formalism, where performance and dependability properties are analyzable by model checking. We present INFAMY, a model checker for arbitrarily structured infinite-state CTMCs. It checks probabilistic timing properties expressible in continuous stochastic logic (CSL). Conventional model checkers explore the given model exhaustively, which is often costly, due to state explosion, and impossible if the model is infinite. INFAMY only explores the model up to a finite depth, with the depth bound being computed on-the-fly. The computation of depth bounds is configurable to adapt to the characteristics of different classes of models.
Original languageEnglish
Title of host publicationComputer Aided Verification, 21st International Conference, CAV 2009, Grenoble, France, June 26 - July 2, 2009. Proceedings
Number of pages7
Publication statusPublished - 2009
Externally publishedYes

Fingerprint Dive into the research topics of 'INFAMY: An Infinite-State Markov Model Checker'. Together they form a unique fingerprint.

Cite this