Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Modeling and analysis of stochastic systems
Modeling and analysis of stochastic systems
Model-checking continuous-time Markov chains
ACM Transactions on Computational Logic (TOCL)
Performance Analysis of Communication Systems with Non-Markovian Stochastic Petri Nets
Performance Analysis of Communication Systems with Non-Markovian Stochastic Petri Nets
Model Checking Continuous-Time Markov Chains by Transient Analysis
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Verifying Continuous Time Markov Chains
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
PRISM: Probabilistic Symbolic Model Checker
TOOLS '02 Proceedings of the 12th International Conference on Computer Performance Evaluation, Modelling Techniques and Tools
Model Checking CSL until Formulae with Random Time Bounds
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
HLDVT '02 Proceedings of the Seventh IEEE International High-Level Design Validation and Test Workshop
Stochastic modeling of a power-managed system-construction and optimization
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Mixing logics and rewards for the component-oriented specification of performance measures
Theoretical Computer Science
Consecutive customer losses in regular and oscillating MX/G/1/n systems
Queueing Systems: Theory and Applications
SFM'07 Proceedings of the 7th international conference on Formal methods for performance evaluation
Exploring parameter space of stochastic biochemical systems using quantitative model checking
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Hi-index | 0.09 |
In this paper, we extend CSL (continuous stochastic logic) with an expected time and an expected reward operator, both of which are parameterized by a random terminal time. With the help of such operators we can state, for example, that the expected sojourn time in a set of goal states within some generally distributed delay is at most (at least) some time threshold. In addition, certain performance measures of systems which contain general distributions can be calculated with the aid of this extended logic. We extend the efficient model checking of CTMCs against the logic CSL developed by Katoen et al. [1] to cater for the new operator. Our method involves precomputing a family of mixed Poisson expected sojourn time coefficients for a range of random variables which includes Pareto, uniform and gamma distributions, but otherwise carries the same computational cost as calculating CSL until formulae.