2009 | OriginalPaper | Buchkapitel
INFAMY: An Infinite-State Markov Model Checker
verfasst von : Ernst Moritz Hahn, Holger Hermanns, Björn Wachter, Lijun Zhang
Erschienen in: Computer Aided Verification
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. 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.