Papers
Topics
Authors
Recent
Search
2000 character limit reached

Learning Deterministic Multi-Clock Timed Automata

Published 11 Apr 2024 in cs.FL | (2404.07823v2)

Abstract: We present an algorithm for active learning of deterministic timed automata with multiple clocks. The algorithm is within the querying framework of Angluin's $L*$ algorithm and follows the idea proposed in existing work on the active learning of deterministic one-clock timed automata. We introduce an equivalence relation over the reset-clocked language of a timed automaton and then transform the learning problem into learning the corresponding reset-clocked language of the target automaton. Since a reset-clocked language includes the clock reset information which is not observable, we first present the approach of learning from a powerful teacher who can provide reset information by answering reset information queries from the learner. Then we extend the algorithm in a normal teacher situation in which the learner can only ask standard membership query and equivalence query while the learner guesses the reset information. We prove that the learning algorithm terminates and returns a correct deterministic timed automaton. Due to the need of guessing whether the clocks reset at the transitions, the algorithm is of exponential complexity in the size of the target automaton.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (37)
  1. From Passive to Active: Learning Timed Automata Efficiently. In Proceedings of the 12th International Symposium on NASA Formal Methods, NFM 2020 (LNCS, Vol. 12229). Springer, 1–19. https://doi.org/10.1007/978-3-030-55754-6_1
  2. Rajeev Alur and David L. Dill. 1994. A Theory of Timed Automata. Theor. Comput. Sci. 126, 2 (1994), 183–235. https://doi.org/10.1016/0304-3975(94)90010-8
  3. Event-Clock Automata: A Determinizable Class of Timed Automata. Theor. Comput. Sci. 211, 1-2 (1999), 253–273. https://doi.org/10.1016/S0304-3975(97)00173-4
  4. Symbolic Compositional Verification by Learning Assumptions. In Proceedings of the 17th International Conference on Computer Aided Verification, CAV 2005 (LNCS, Vol. 3576). Springer, 548–562. https://doi.org/10.1007/11513988_52
  5. Learning One-Clock Timed Automata. In 26th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2020 (LNCS, Vol. 12078). Springer, 444–462. https://doi.org/10.1007/978-3-030-45190-5_25
  6. Learning real-time automata. Sci. China Inf. Sci. 64, 9 (2021). https://doi.org/10.1007/s11432-019-2767-4
  7. Learning Nondeterministic Real-Time Automata. ACM Trans. Embed. Comput. Syst. 20, 5s (2021), 99:1–99:26. https://doi.org/10.1145/3477030
  8. Dana Angluin. 1978. On the Complexity of Minimum Inference of Regular Sets. Inf. Control. 39, 3 (1978), 337–350. https://doi.org/10.1016/S0019-9958(78)90683-6
  9. Dana Angluin. 1987. Learning Regular Sets from Queries and Counterexamples. Inf. Comput. 75, 2 (1987), 87–106. https://doi.org/10.1016/0890-5401(87)90052-6
  10. Learning Time Delay Mealy Machines From Programmable Logic Controllers. IEEE Trans Autom. Sci. Eng. 13, 2 (2016), 1155–1164. https://doi.org/10.1109/TASE.2015.2496242
  11. TAG: Learning Timed Automata from Logs. In Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022. AAAI Press, 3949–3958. https://ojs.aaai.org/index.php/AAAI/article/view/20311
  12. Catalin Dima. 2001. Real-Time Automata. J. Autom. Lang. Comb. 6, 1 (2001), 3–23. https://doi.org/10.25596/jalc-2001-003
  13. Combining Model Learning and Model Checking to Analyze TCP Implementations. In Proceedings of the 28th International Conference on Computer Aided Verification, CAV 2016 (LNCS, Vol. 9780). Springer, 454–471. https://doi.org/10.1007/978-3-319-41540-6_25
  14. E. Mark Gold. 1978. Complexity of Automaton Identification from Given Data. Inf. Control. 37, 3 (1978), 302–320. https://doi.org/10.1016/S0019-9958(78)90562-4
  15. Learning of event-recording automata. Theor. Comput. Sci. 411, 47 (2010), 4029–4054. https://doi.org/10.1016/j.tcs.2010.07.008
  16. Inference of Event-Recording Automata Using Timed Decision Trees. In Proceedings of the 17th International Conference on Concurrency Theory, CONCUR 2006 (LNCS, Vol. 4137). Springer, 435–449. https://doi.org/10.1007/11817949_29
  17. Active Learning of Timed Automata with Unobservable Resets. In Proceedings of the 18th International Conference on Formal Modeling and Analysis of Timed Systems, FORMATS 2020 (LNCS, Vol. 12288). Springer, 144–160. https://doi.org/10.1007/978-3-030-57628-8_9
  18. John E. Hopcroft and Jeffrey D. Ullman. 1979. Introduction to Automata Theory, Languages and Computation. Addison-Wesley.
  19. Inferring Switched Nonlinear Dynamical Systems. Formal Aspects Comput. 33, 3 (2021), 385–406. https://doi.org/10.1007/S00165-021-00542-7
  20. Michael J. Kearns and Umesh V. Vazirani. 1994. An Introduction to Computational Learning Theory. MIT Press.
  21. Martin Leucker. 2006. Learning Meets Verification. In Proceedings of the 5th International Symposium on Formal Methods for Components and Objects, FMCO 2006 (LNCS, Vol. 4709). Springer, 127–151. https://doi.org/10.1007/978-3-540-74792-5_6
  22. Timed k-Tail: Automatic Inference of Timed Automata. In Proceedings of the 10th IEEE International Conference on Software Testing, Verification and Validation, ICST 2017. IEEE Computer Society, 401–411. https://doi.org/10.1109/ICST.2017.43
  23. Black Box Checking. Journal of Automata, Languages and Combinatorics 7, 2 (2002), 225–246. https://doi.org/10.25596/jalc-2002-225
  24. Refactoring of Legacy Software Using Model Learning and Equivalence Checking: An Industrial Experience Report. In Proceedings of the 12th International Conference on Integrated Formal Methods, IFM 2016 (LNCS, Vol. 9681). Springer, 311–325. https://doi.org/10.1007/978-3-319-33693-0_20
  25. PAC Learning of Deterministic One-Clock Timed Automata. In Proceedings of the 22nd International Conference on Formal Engineering Methods, ICFEM 2020 (LNCS, Vol. 12531). Springer, 129–146. https://doi.org/10.1007/978-3-030-63406-3_8
  26. Introduction to Active Automata Learning from a Practical Perspective. In Proceedings of the 11th International School on Formal Methods for the Design of Computer, Communication and Software Systems - Formal Methods for Eternal Networked Software Systems, SFM 2011 (LNCS, Vol. 6659). Springer, 256–296. https://doi.org/10.1007/978-3-642-21455-4_8
  27. Learning Deterministic One-Clock Timed Automata via Mutation Testing. In Proceedings of the 20th International Symposium on Automated Technology for Verification and Analysis, ATVA 2022 (LNCS, Vol. 13505). Springer, 233–248. https://doi.org/10.1007/978-3-031-19992-9_15
  28. Time to Learn - Learning Timed Automata from Tests. In Proceedings of the 17th International Conference on Formal Modeling and Analysis of Timed Systems, FORMATS 2019 (LNCS, Vol. 11750). Springer, 216–235. https://doi.org/10.1007/978-3-030-29662-9_13
  29. Timed Automata Learning via SMT Solving. In Proceedings of the 14th International Symposium on NASA Formal Methods , NFM 2022 (LNCS, Vol. 13260). Springer, 489–507. https://doi.org/10.1007/978-3-031-06773-0_26
  30. Frits W. Vaandrager. 2017. Model learning. Commun. ACM 60, 2 (2017), 86–95. https://doi.org/10.1145/2967606
  31. Learning Mealy Machines with One Timer. In Proceedings of the 15th International Conference Language and Automata Theory and Applications, LATA 2021 (LNCS, Vol. 12638). Springer, 157–170. https://doi.org/10.1007/978-3-030-68195-1_13
  32. An algorithm for learning real-time automata. In Benelearn 2007: Proceedings of the Annual Machine Learning Conference of Belgium and the Netherlands, Amsterdam, The Netherlands, 14-15 May 2007.
  33. One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit. In Language and Automata Theory and Applications, Third International Conference, LATA 2009, Tarragona, Spain, April 2-8, 2009. Proceedings (Lecture Notes in Computer Science, Vol. 5457), Adrian-Horia Dediu, Armand-Mihai Ionescu, and Carlos Martín-Vide (Eds.). Springer, 740–751. https://doi.org/10.1007/978-3-642-00982-2_63
  34. The efficiency of identifying timed automata and the power of clocks. Inf. Comput. 209, 3 (2011), 606–625. https://doi.org/10.1016/j.ic.2010.11.023
  35. Efficiently identifying deterministic real-time automata from labeled data. Mach. Learn. 86, 3 (2012), 295–333. https://doi.org/10.1007/s10994-011-5265-4
  36. Masaki Waga. 2023. Active Learning of Deterministic Timed Automata with Myhill-Nerode Style Characterization. In CAV 2023 (LNCS, Vol. 13964). Springer, 3–26. https://doi.org/10.1007/978-3-031-37706-8_1
  37. Active Learning of One-Clock Timed Automata Using Constraint Solving. In Proceedings of the 20th International Symposium on Automated Technology for Verification and Analysis, ATVA 2022 (LNCS, Vol. 13505). Springer, 249–265. https://doi.org/10.1007/978-3-031-19992-9_16
Citations (1)
View on Semantic Scholar

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Authors (3)

  1. Yu Teng 
  2. Miaomiao Zhang 
  3. Jie An 

Collections

Sign up for free to add this paper to one or more collections.

Sign Up

Tweets

Sign up for free to view the 2 tweets with 0 likes about this paper.

Sign Up for Free