Strict Divergence for Probabilistic Timed Automata
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
A component-based solution method for non-ergodic Markov regenerative processes
EPEW'10 Proceedings of the 7th European performance engineering conference on Computer performance engineering
Efficient CTMC model checking of linear real-time objectives
TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
Automata-based CSL model checking
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Time-bounded verification of CTMCs against real-time specifications
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
Observing continuous-time MDPs by 1-clock timed automata
RP'11 Proceedings of the 5th international conference on Reachability problems
HASL: an expressive language for statistical verification of stochastic models
Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools
Weighted lumpability on markov chains
PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics
Model checking conditional CSL for continuous-time Markov chains
Information Processing Letters
Expressive statistical model checking of genetic networks with delayed stochastic dynamics
CMSB'12 Proceedings of the 10th international conference on Computational Methods in Systems Biology
Approximating acceptance probabilities of CTMC-paths on multi-clock deterministic timed automata
Proceedings of the 16th international conference on Hybrid systems: computation and control
Proceedings of the 2013 ACM SIGSIM conference on Principles of advanced discrete simulation
A component-based solution for reducible Markov regenerative processes
Performance Evaluation
Expressing and computing passage time measures of GSPN models with HASL
PETRI NETS'13 Proceedings of the 34th international conference on Application and Theory of Petri Nets and Concurrency
Backward Solution of Markov Chains and Markov Regenerative Processes: Formalization and Applications
Electronic Notes in Theoretical Computer Science (ENTCS)
Model checking markov population models by central limit approximation
QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems
Temporal Logics for Phylogenetic Analysis via Model Checking
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
On-the-fly verification and optimization of DTA-properties for large Markov chains
Formal Methods in System Design
| Hi-index | 0.00 |
Markov chains are a well-known stochastic process that provide a balance between being able to adequately model the system's behavior and being able to afford the cost of the model solution. The definition of stochastic temporal logics like Continuous Stochastic Logic (CSL) and its variant asCSL, and of their model-checking algorithms, allows a unified approach to the verification of systems, allowing the mix of performance evaluation and probabilistic verification. In this paper we present the stochastic logic CSLTA, which is more expressive than CSL and asCSL, and in which properties can be specified using automata (more precisely, timed automata with a single clock). The extension with respect to expressiveness allows the specification of properties referring to the probability of a finite sequence of timed events. A typical example is the responsiveness property "with probability at least 0.75, a message sent at time 0 by a system A will be received before time 5 by system B and the acknowledgment will be back at A before time 7", a property that cannot be expressed in either CSL or asCSL. We also present a model-checking algorithm for CSLTA.