2009 | OriginalPaper | Chapter
INFAMY: An Infinite-State Markov Model Checker
Authors : Ernst Moritz Hahn, Holger Hermanns, Björn Wachter, Lijun Zhang
Published in: Computer Aided Verification
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.