Abstract
This paper provides an experimental study of the efficiency of simulation-based model-checking algorithms for continuous-time Markov chains by comparing: MRMC - the only tool that implements (new) confidence-interval-based algorithms for verification of all main CSL formulae; Ymer - that allows for verification oftime-bounded and time-interval until using sequential acceptance sampling; and VESTA - that can verify time-bounded and unbounded until by means of simple hypothesis testing. The study shows that MRMC provides the most accurate verification results. Ymer and VESTA, unlike MRMC, have almost constant memory consumption. Ymer requiresthe least number of observations to assess the model-checking problem, but MRMC is mostly the fastest. This indicates that the tools' efficiency does not so muchdepend on sampling but is rather determined by extra computations.
Original language | Undefined |
---|---|
Title of host publication | Sixth International Conference on the Quantitative Evaluation of Systems |
Place of Publication | Los Alamitos |
Publisher | IEEE |
Pages | 31-40 |
Number of pages | 10 |
ISBN (Print) | 978-1-42444-942-2 |
DOIs | |
Publication status | Published - Sept 2009 |
Event | 6th International Conference on Quantitative Evaluation of SysTems, QEST 2009 - Technical University of Budapest, Budapest, Hungary Duration: 13 Sept 2009 → 16 Sept 2009 Conference number: 6 http://www.qest.org/qest2009/ |
Publication series
Name | |
---|---|
Publisher | IEEE Computer Society Press |
Conference
Conference | 6th International Conference on Quantitative Evaluation of SysTems, QEST 2009 |
---|---|
Abbreviated title | QEST |
Country/Territory | Hungary |
City | Budapest |
Period | 13/09/09 → 16/09/09 |
Internet address |
Keywords
- METIS-264290
- EWI-17103
- IR-69307