Model Checking Timed and Stochastic Properties with CSL^{TA}

Donatelli, Susanna; Haddad, Serge; Sproston, Jeremy

doi:10.1109/tse.2008.108

Cited by 79 publications

(111 citation statements)

References 28 publications

Supporting

Mentioning

110

Contrasting

Order By: Relevance

“…Standard and non-standard dependability/performance measures can be computed using the stochastic model checker for the CSL TA [21] logic which is also part of the GreatSPN. A CSL TA formula has the form Φ = Prob α (A ), where is a comparison operator ( ∈ {≤, <, =}), α a probability value and A is a timed automaton with a single clock x that accepts/rejects timed paths of a GSPN.…”

Section: Greatspn Nowmentioning

confidence: 99%

30 Years of GreatSPN

Amparore

Balbo

Beccuti

et al. 2016

Springer Series in Reliability Engineering

View full text Add to dashboard Cite

GreatSPN is a tool for the stochastic analysis of systems modelled as (stochastic) Petri nets. This chapter describes the evolution of the GreatSPN framework over its lifespan of 30 years, from the first stochastic Petri net analyzer implemented in Pascal, to the current, fancy, graphical interface that supports a number of different model analyzers. This chapter reviews, with the help of a manufacturing system example, how GreatSPN is currently used for an integrated qualitative and quantitative analysis of Petri net systems, ranging from symbolic model checking techniques to a stochastic analysis whose efficiency is boosted by lumpability.

show abstract

Section: Greatspn Nowmentioning

confidence: 99%

30 Years of GreatSPN

Amparore

Balbo

Beccuti

et al. 2016

Springer Series in Reliability Engineering

View full text Add to dashboard Cite

show abstract

“…There is a rich literature on model checking techniques for CTMCs, see [1,2,[5][6][7][8]. In [5,6], deterministic timed automata (DTA) are used for specifying path properties.…”

Section: Related Workmentioning

confidence: 99%

“…In [5,6], deterministic timed automata (DTA) are used for specifying path properties. As discussed in [9], nested until CSL path formulas can be expressed in DTA as well, however with a much larger number of states.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Model checking conditional CSL for continuous-time Markov chains

Zhan

Zhang

2013

Information Processing Letters

View full text Add to dashboard Cite

In this paper, we consider the model-checking problem of continuous-time Markov chains (CTMCs) with respect to conditional logic. To the end, we extend Continuous Stochastic Logic introduced in Aziz et al. (2000) [1] to Conditional Continuous Stochastic Logic (CCSL) by introducing a conditional probabilistic operator. CCSL allows us to express a richer class of properties for CTMCs. Based on a parameterized product obtained from the CTMC and an automaton extracted from a given CCSL formula, we propose an approximate model checking algorithm and analyse its complexity.Crown

show abstract

“…These properties can be given either as formulas of e.g. the logic CSL or extensions thereof [15], [16], [17], [18], or (deterministic) timed automata [19]. This has led to the development of exact and approximated model-checking algorithms.…”

Section: Introductionmentioning

confidence: 99%

Almost-Sure Model-Checking of Reactive Timed Automata

Bouyer

Brihaye

Jurdziński

et al. 2012

2012 Ninth International Conference on Quantitative Evaluation of Systems

View full text Add to dashboard Cite

Abstract-We consider the model of stochastic timed automata, a model in which both delays and discrete choices are made probabilistically. We are interested in the almost-sure modelchecking problem, which asks whether the automaton satisfies a given property with probability 1. While this problem was shown decidable for single-clock automata few years ago, it was also proven that the algorithm for this decidability result could not be used for general timed automata. In this paper we describe the subclass of reactive timed automata, and we prove decidability of the almost-sure model-checking problem under that restriction. Decidability relies on the fact that this model is almost-surely fair. As a desirable property of real systems, we show that reactive automata are almost-surely non-Zeno. Finally we show that the almost-sure model-checking problem can be decided for specifications given as deterministic timed automata.

show abstract

Model Checking Timed and Stochastic Properties with CSL^{TA}

Abstract: Markov chains are a well-known stochastic process that provide a balance between being able to adequately model the system '

Cited by 79 publications

References 28 publications

30 Years of GreatSPN

30 Years of GreatSPN

Model checking conditional CSL for continuous-time Markov chains

Almost-Sure Model-Checking of Reactive Timed Automata

Contact Info

Product

Resources

About