Improved learning for stochastic timed models by state-merging algorithms

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

Abstract

The construction of faithful system models for quantitative analysis, e.g., performance evaluation, is challenging due to the inherent systems’ complexity and unknown operating conditions. To overcome such difficulties, we are interested in the automated construction of system models by learning from actual execution traces. We focus on the timing aspects of systems that are assumed to be of stochastic nature. In this context, we study a state-merging procedure for learning stochastic timed models and we propose several enhancements at the level of the learned model structure and the underlying algorithms. The results obtained on different examples show a significant improvement of timing accuracy of the learned models.

Cite

CITATION STYLE

APA

Mediouni, B. L., Nouri, A., Bozga, M., & Bensalem, S. (2017). Improved learning for stochastic timed models by state-merging algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10227 LNCS, pp. 178–193). Springer Verlag. https://doi.org/10.1007/978-3-319-57288-8_13

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