Model-checking and simulation for stochastic timed systems

11Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

For verification and performance evaluation, system models that can express stochastic as well as real-time behaviour are of increasing importance. Although an integrated stochastic-timed verification procedure is highly desirable, both model-checking and simulation currently fall short of providing a complete, fully automatic verification solution. For model-checking, the problem lies in the extreme expressiveness of such a model, while simulation is limited to stochastic processes and cannot deal with nondeterminism. In this paper, we review the use of stochastic timed automata as an overarching formalism to model stochastic timed systems and present two analysis approaches: Model-checking for the (large) subset corresponding to probabilistic timed automata with deadlines, for which solid implementations are appearing, and simulation, which we have recently shown to be applicable to models that also include spurious nondeterministic choices. © 2011 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Hartmanns, A. (2011). Model-checking and simulation for stochastic timed systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6957 LNCS, pp. 372–391). https://doi.org/10.1007/978-3-642-25271-6_20

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free