Learning deterministic probabilistic automata from a model checking perspective

Research output: Contribution to journalJournal articleResearchpeer-review

44 Citations (Scopus)
385 Downloads (Pure)


Probabilistic automata models play an important role in the formal design and analysis of hard- and software systems. In this area of applications, one is often interested in formal model-checking procedures for verifying critical system properties. Since adequate system models are often difficult to design manually, we are interested in learning models from observed system behaviors. To this end we adopt techniques for learning finite probabilistic automata, notably the Alergia algorithm. In this paper we show how to extend the basic algorithm to also learn automata models for both reactive and timed systems. A key question of our investigation is to what extent one can expect a learned model to be a good approximation for the kind of probabilistic properties one wants to verify by model checking. We establish theoretical convergence properties for the learning algorithm as well as for probability estimates of system properties expressed in linear time temporal logic and linear continuous stochastic logic. We empirically compare the learning algorithm with statistical model checking and demonstrate the feasibility of the approach for practical system verification.
Original languageEnglish
JournalMachine Learning
Issue number2
Pages (from-to)255-299
Number of pages45
Publication statusPublished - 2016


Dive into the research topics of 'Learning deterministic probabilistic automata from a model checking perspective'. Together they form a unique fingerprint.

Cite this