By Topic

CSL^TA: an Expressive Logic for Continuous-Time Markov Chains

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Donatelli, S. ; Univ. di Torino, Turin ; Haddad, S. ; Sproston, J.

The stochastic temporal logic CSL can be used to describe formally properties of continuous-time Markov chains, and has been extended with expressions over states and actions to obtain the logic asCSL. However, properties referring to the probability of a finite sequence of timed events (such as "with probability at least 0.75, the system will be in state set A at time 5, then in state set B at time 7, then in state set C at time 20") cannot be expressed in either CSL or asCSL. With the aim of increasing the expressive power of temporal logics for continuous- time Markov chains, we introduce the logic CSLTA and its model-checking algorithm. CSLTA extends CSL and asCSL by allowing the specification of timed properties through a deterministic one-clock timed automata.

Published in:

Quantitative Evaluation of Systems, 2007. QEST 2007. Fourth International Conference on the

Date of Conference:

17-19 Sept. 2007