Author:
Verwer Sicco,de Weerdt Mathijs,Witteveen Cees
Publisher
Springer Berlin Heidelberg
Reference9 articles.
1. Alur, R., Dill, D.L.: A theory of timed automata. Theoretical Computer Science 126, 183–235 (1994)
2. Larsen, K.G., Petterson, P., Yi, W.: Uppaal in a nutschell. International journal on software tools for technology transfer 1(1-2), 134–152 (1997)
3. Gold, E.M.: Complexity of automaton identification from given data. Information and Control 37(3), 302–320 (1978)
4. Pitt, L., Warmuth, M.: The minimum consistent dfa problem cannot be approximated within and polynomial. In: Annual ACM Symposium on Theory of Computing, pp. 421–432. ACM, New York (1989)
5. Gold, E.M.: Language identification in the limit. Information and Control 10(5), 447–474 (1967)
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Learning Deterministic Multi-Clock Timed Automata;Proceedings of the 27th ACM International Conference on Hybrid Systems: Computation and Control;2024-05-14
2. Learning Symbolic Timed Models from Concrete Timed Data;Lecture Notes in Computer Science;2023
3. Active Learning of One-Clock Timed Automata Using Constraint Solving;Automated Technology for Verification and Analysis;2022
4. Equivalence checking and intersection of deterministic timed finite state machines;Formal Methods in System Design;2021-12
5. Learning Nondeterministic Real-Time Automata;ACM Transactions on Embedded Computing Systems;2021-10-31