A uniformization-based algorithm for model checking the CSL until operator on labeled queueing networks

Anne Katharina Ingrid Remke, Boudewijn R.H.M. Haverkort

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    83 Downloads (Pure)


    We present a model checking procedure for the CSL until operator on the CTMCs that underlie Jackson queueing networks. The key issue lies in the fact that the underlying CTMC is infinite in as many dimension as there are queues in the JQN. We need to compute the transient state probabilities for all goal states and for all possible starting states. However, for these transient probabilities no computational procedures are readily available. The contribution of this paper is the proposal of a new uniformization-based approach to compute the transient state probabilities. Furthermore, we show how the highly structured state space of JQNs allows us to compute the possible infinite satisfaction set for until formulas. A case study on an e-business site shows the feasibility of our approach.
    Original languageUndefined
    Title of host publicationThe 6th International Conference on Formal Modelling and Analysis of Timed Systems
    Place of PublicationBerlin
    Number of pages15
    Publication statusPublished - 15 Sep 2008
    Event6th International Conference on Formal Modeling and Analysis of Timed Systems, FORMATS 2008 - Palais du grand Large, St. Malo, France
    Duration: 15 Sep 200817 Sep 2008
    Conference number: 6

    Publication series

    NameLecture Notes in Computer Science
    PublisherSpringer Verlag
    ISSN (Print)0302-9743


    Conference6th International Conference on Formal Modeling and Analysis of Timed Systems, FORMATS 2008
    Abbreviated titleFORMATS
    CitySt. Malo
    Internet address


    • EWI-12928
    • IR-64827
    • METIS-251031

    Cite this