Abstract
Real-time automata (RTAs) are a subclass of timed automata with only one clock which resets at each transition. In this paper, we present an active learning algorithm for deterministic real-time automata (DRTAs) in both continuous-time semantics and discrete-time semantics. For a target language recognized by a DRTA \(\mathcal{A}\), we convert the problem of learning DRTA \(\mathcal{A}\) to the problem of learning a canonical real-time automaton \(\mathbb{A}\) with the same recognized language, i.e., \(\mathcal{L}(\mathbb{A})=\mathcal{L}(\mathcal{A})\). The algorithm is inspired by existing learning algorithms for symbolic automata.
Similar content being viewed by others
References
Angluin D. Learning regular sets from queries and counterexamples. Inf Computat, 1987, 75: 87–106
Aarts F, Vaandrager F W. Learning I/O automata. In: Proceedings of the 21st International Conference on Concurrency Theory, Paris, 2010. 71–85
Howar F, Steffen B, Jonsson B, et al. Inferring canonical register automata. In: Proceedings of the 13th International Conference on Verification, Model Checking, and Abstract Interpretation, Philadelphia, 2012. 251–266
Aarts F, Fiterau-Brostean P, Kuppens H, et al. Learning register automata with fresh value generation. In: Proceedings of the 12th International Colloquium on Theoretical Aspects of Computing, 2015. 165–183
Cassel S, Howar F, Jonsson B, et al. Active learning for extended finite state machines. Form Asp Comput, 2016, 28: 233–263
Bollig B, Habermehl P, Kern C, et al. Angluin-style learning of NFA. In: Proceedings of the 21st International Joint Conference on Artificial Intelligence, Pasadena, 2009. 1004–1009
Farzan A, Chen Y, Clarke E M, et al. Extending automated compositional verification to the full class of omega-regular languages. In: Proceedings of the 14th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Budapest, 2008. 2–17
Li Y, Chen Y, Zhang L J, et al. A novel learning algorithm for büchi automata based on family of dfas and classification trees. In: Proceedings of the 23rd International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Uppsala, 2017. 208–226
Bollig B, Katoen J, Kern C, et al. libalf: the automata learning framework. In: Proceedings of the 22nd International Conference on Computer Aided Verification, Edinburgh, 2010. 360–364
Isberner M, Howar F, Steffen B. The open-source learnlib—a framework for active automata learning. In: Proceedings of the 27th International Conference on Computer Aided Verification, San Francisco, 2015. 487–495
Fiterau-Brostean P, Janssen R, Vaandrager F W. Combining model learning and model checking to analyze TCP implementations. In: Proceedings of the 28th International Conference on Computer Aided Verification, Toronto, 2016. 454–471
Verwer S, de Weerdt M, Witteveen C. Efficiently identifying deterministic real-time automata from labeled data. Mach Learn, 2012, 86: 295–333
Dima C. Real-time automata. J Autom Languages Combinat, 2001, 6: 3–23
Verwer S, Weerdt M, Witteveen C. The efficiency of identifying timed automata and the power of clocks. Inf Comput, 2011, 209: 606–625
Alur R, Fix L, Henzinger T A. Event-clock automata: a determinizable class of timed automata. Theor Comput Sci, 1999, 211: 253–273
Grinchtein O, Jonsson B, Leucker M. Learning of event-recording automata. Theor Comput Sci, 2010, 411: 4029–4054
Maler O, Mens I. Learning regular languages over large alphabets. In: Proceedings of the 20th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Grenoble, 2014. 485–499
Drews S, D’Antoni L. Learning symbolic automata. In: Proceedings of the 23rd International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Uppsala, 2017. 173–189
Alur R, Dill D L. A theory of timed automata. Theor Comput Sci, 1994, 126: 183–235
Stigge M, Ekberg P, Guan N, et al. The digraph real-time task model. In: Proceedings of the 17th IEEE Real-Time and Embedded Technology and Applications Symposium, Chicago, 2011. 71–80
Abdullah J, Dai G, Mohaqeqi M, et al. Schedulability analysis and software synthesis for graph-based task models with resource sharing. In: Proceedings of the 24th IEEE Real-Time and Embedded Technology and Applications Symposium, Porto, 2018. 261–270
Denning D E, Sacco G M. Timestamps in key distribution protocols. Commun ACM, 1981, 24: 533–536
Verwer S, Weerdt M D, Witteveen C. An algorithm for learning real-time automata. In: Proceedings of the 18th Annual Machine Learning Conference of Belgium and the Netherlands, Amsterdam, 2007. 57–64
Tappler M, Aichernig B K, Larsen K G, et al. Learning timed automata via genetic programming. 2018. ArXiv: 1808.07744
Schmidt J, Ghorbani A, Hapfelmeier A, et al. Learning probabilistic real-time automata from multi-attribute event logs. Intell Data Anal, 2013, 17: 93–123
Berg T, Grinchtein O, Jonsson B, et al. On the correspondence between conformance testing and regular inference. In: Proceedings of the 8th International Conference on Fundamental Approaches to Software Engineering, Edinburgh, 2005. 175–189
Hopcroft J E, Ullman J D. Introduction to Automata Theory, Languages, and Computation. Boston: Addison-Wesley Publishing Company, 1979
Ouaknine J, Worrell J. On the language inclusion problem for timed automata: closing a decidability gap. In: Proceedings of the 19th IEEE Symposium on Logic in Computer Science, Turku, 2004. 54–63
Wang L T, Zhan N J, An J. The opacity of real-time automata. IEEE Trans Comput-Aided Des Integr Circ Syst, 2018, 37: 2845–2856
Acknowledgements
Jie AN and Miaomiao ZHANG have been supported partly by National Natural Science Foundation of China (Grant Nos. 61972284, 61472279). Jie AN, Lingtai WANG, Bohua ZHAN and Naijun ZHAN have been supported partly by National Natural Science Foundation of China (Grant Nos. 61625206, 61732001, 61872341). Bohua ZHAN has been partly supported by CAS Pioneer Hundred Talents Program (Grant No. Y9RC585036). The authors would like to thank the anonymous reviewers for their insightful comments and suggestions raised in the reviewing process.
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
About this article
Cite this article
An, J., Wang, L., Zhan, B. et al. Learning real-time automata. Sci. China Inf. Sci. 64, 192103 (2021). https://doi.org/10.1007/s11432-019-2767-4
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s11432-019-2767-4