Learning Stochastic Timed Automata from Sample Executions-Reference-Cited by-同舟云学术

Learning Stochastic Timed Automata from Sample Executions

Published:2012 Issue: Volume: Page:508-523
ISSN:0302-9743
Container-title:Leveraging Applications of Formal Methods, Verification and Validation. Technologies for Mastering Change
language:
Short-container-title:

Author:

de Matos Pedro André,Crocker Paul Andrew,de Sousa Simão Melo

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-34026-0_38

Reference24 articles.

1. Bollig, B., Habermehl, P., Kern, C., Leucker, M.: Angluin-style learning of nfa. In: Proceedings of the 21st International Joint Conference on Artifical Intelligence, IJCAI 2009, San Francisco, CA, USA, pp. 1004–1009. Morgan Kaufmann Publishers Inc. (2009)

2. Lecture Notes in Computer Science;B. Bollig,2010

3. Carrasco, R.C., Oncina, J.: Learning deterministic regular grammars from stochastic samples in polynomial time. RAIRO (Theoretical Informatics and Applications) 33, 1–20 (1999)

4. Cassandras, C.G., Lafortune, S.: Cassandras and Stephane Lafortune. In: Introduction to Discrete Event Systems. Springer-Verlag New York, Inc., Secaucus (2006)

5. Lecture Notes in Computer Science;A. David,2011

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Learning Symbolic Timed Models from Concrete Timed Data;Lecture Notes in Computer Science;2023

2. CTL Model Checking Based on Binary Classification of Machine Learning;The International Arab Journal of Information Technology;2022

3. From Passive to Active: Learning Timed Automata Efficiently;Lecture Notes in Computer Science;2020

4. Time to Learn – Learning Timed Automata from Tests;Lecture Notes in Computer Science;2019

5. Improved Learning for Stochastic Timed Models by State-Merging Algorithms;Lecture Notes in Computer Science;2017