Learning Probabilistic Systems from Tree Samples

DOI10.1109/LICS.2012.54zbMath1362.68122arXiv1207.5091MaRDI QIDQ2986820

Anvesh Komuravelli, Edmund M. Clarke, Corina S. Păsăreanu

Publication date: 16 May 2017

Published in: 2012 27th Annual IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1207.5091

zbMATH Keywords

partitionsimulationprobabilityconformancetransition systemactive learningassume-guaranteetree sample

Mathematics Subject Classification ID

Computational learning theory (68Q32) Specification and verification (program logics, model checking, etc.) (68Q60) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items

A space-efficient simulation algorithm on probabilistic automata, Compositional Reasoning, Minimal counterexamples for linear-time probabilistic verification, Learning deterministic probabilistic automata from a model checking perspective, \(L^\ast\)-based learning of Markov decision processes (extended version)