ViraScience.
Open-access article

Model-checking continuous-time Markov chains

AdnanAziz, KumudSanwal, VigyanSinghal, RobertBrayton

Abstract

No abstract recorded for this item.

Similar items

  • Model Checking Continuous-Time Markov Chains by Transient Analysis

    Scholarly record2000CAVChristel Baier, Boudewijn R. Haverkort, Holger Hermanns, Joost-Pieter Katoen

    The verification of continuous-time Markov chains (CTMCs) against continuous stochastic logic (CSL) [3, 6], a stochastic branchingtime temporal logic, is considered. CSL facilitates among others the specification of steady-state properties and the specification of probabilistic t

  • Erratum to: Model-checking continuous-time Markov chains by Aziz et al

    Scholarly record2011CoRRDavid N. Jansen

    This note corrects a discrepancy between the semantics and the algorithm of the multiple until operator of CSL, like in Pr>0.0025(a U[1,2] b U[3,4] c), of the article: Model-checking continuous-time Markov chains by Aziz, Sanwal, Singhal and Brayton, TOCL 1(1), July 2000, pp. 162

  • Linear Autonomous Compartmental Models as Continuous-Time Markov Chains: Transit-Time and Age Distributions

    Open-access article2017Mathematical GeosciencesHolgerMetzler, Carlos A.Sierra

  • Model-Checking Algorithms for Continuous-Time Markov Chains

    Scholarly record2003IEEE Trans. Software Eng.Christel Baier, Boudewijn R. Haverkort, Holger Hermanns, Joost-Pieter Katoen

    Continuous-time Markov chains (CTMCs) have been widely used to determine system performance and dependability characteristics. Their analysis most often concerns the computation of steady-state and transient-state probabilities. This paper introduces a branching temporal logic fo

  • Approximate Symbolic Model Checking of Continuous-Time Markov Chains

    Scholarly record1999CONCURChristel Baier, Joost-Pieter Katoen, Holger Hermanns

    This paper presents a symbolic model checking algorithm for continuous-time Markov chains for an extension of the continuous stochastic logic CSL of Aziz et al 1]. The considered logic contains a time-bounded until-operator and a novel operator to express steady-state probabiliti

  • Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications

    Scholarly record2011Logical Methods in Computer ScienceTaolue Chen, Tingting Han, Joost-Pieter Katoen, Alexandru Mereacre

    We study the verification of a finite continuous-time Markov chain (CTMC) C against a linear real-time specification given as a deterministic timed automaton (DTA) A with finite or Muller acceptance conditions. The central question that we address is: what is the probability of t