Improved Learning for Stochastic Timed Models by State-Merging Algorithms
暂无分享,去创建一个
[1] Sicco Verwer. Efficient Identification of Timed Automata: Theory and practice , 2010 .
[2] Kim G. Larsen,et al. Learning deterministic probabilistic automata from a model checking perspective , 2016, Machine Learning.
[3] Mahesh Viswanathan,et al. Learning continuous time Markov chains from sample executions , 2004, First International Conference on the Quantitative Evaluation of Systems, 2004. QEST 2004. Proceedings..
[4] Colin de la Higuera,et al. PAutomaC: a probabilistic automata and hidden Markov models learning competition , 2013, Machine Learning.
[5] Rajeev Alur,et al. A Theory of Timed Automata , 1994, Theor. Comput. Sci..
[6] Kim G. Larsen,et al. Learning Probabilistic Automata for Model Checking , 2011, 2011 Eighth International Conference on Quantitative Evaluation of SysTems.
[7] Axel Legay,et al. ASTROLABE , 2016, ACM Trans. Embed. Comput. Syst..
[8] Éric Tanter,et al. Supporting dynamic crosscutting with partial behavioral reflection: a case study , 2004, XXIV International Conference of the Chilean Computer Science Society.
[9] José Oncina,et al. Learning Stochastic Regular Grammars by Means of a State Merging Method , 1994, ICGI.
[10] Axel Legay,et al. Statistical Model Checking: An Overview , 2010, RV.
[11] Colin de la Higuera,et al. Grammatical Inference: Learning Automata and Grammars , 2010 .
[12] Oliver Niggemann,et al. Anomaly Detection in Production Plants using Timed Automata - Automated Learning of Models from Observations , 2011, ICINCO.
[13] Marta Z. Kwiatkowska,et al. Symbolic model checking for probabilistic timed automata , 2007, Inf. Comput..
[14] Dana Angluin,et al. Learning Regular Sets from Queries and Counterexamples , 1987, Inf. Comput..
[15] Simão Melo de Sousa,et al. Learning Stochastic Timed Automata from Sample Executions , 2012, ISoLA.