Learning One-Clock Timed Automata

  title={Learning One-Clock Timed Automata},
  author={Jie An and Mingshuai Chen and Bohua Zhan and Naijun Zhan and Miaomiao Zhang},
  journal={Tools and Algorithms for the Construction and Analysis of Systems},
  pages={444 - 462}
We present an algorithm for active learning of deterministic timed automata with a single clock. The algorithm is within the framework of Angluin’s \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$L^*$$\end{document} algorithm and inspired by existing work on the active learning of symbolic automata. Due to the need… 

Active Learning of One-Clock Timed Automata using Constraint Solving

This paper introduces a new algorithm for active learning of deterministic one-clock timed automata and timed Mealy machines that uses observation tables that do not commit to specific choices of reset, but instead rely on constraint solving to determine reset choices that satisfy readiness conditions.

Active learning of timed automata with unobservable resets

Central to the contribution is the notion of invalidity, and the algorithm and data structures to deal with it, allowing on-the-fly detection and pruning of reset hypotheses that contradict observations, a key to any efficient active-learning procedure for generic timed automata.

Learning Nondeterministic Real-Time Automata

An active learning algorithm named NRTALearning for nondeterministic real-time automata (NRTAs) is presented and its correctness and polynomial complexity are proved, and it is proved that there exists a minimal RRTA to recognize any given real- time language.

PAC Learning of Deterministic One-Clock Timed Automata

This work studied the problem of learning deterministic one-clock timed automata in the framework of PAC (probably approximately correct) learning, implemented a prototype for the learning algorithm, and conducted experiments using the TCP protocol as well as a number of randomly generated automata.

The Learning Algorithm of Real-Time Automata

  • Junri MiJin Xu
  • Computer Science
    2020 IEEE 6th International Conference on Computer and Communications (ICCC)
  • 2020
A new data structure is designed to store the information obtained by membership queries, which is a kind of tree structure, and improves the efficiency of the active learning for real-time RTA because this structure can process counter-examples effectively.

Conservative Hybrid Automata from Development Artifacts

This paper devises an automatic construction algorithm that utilizes information contained in artifacts of the development process: a runtime monitoring specification and recorded test traces that provide sufficient information so that the construction process scales well for large systems.

Formal Methods and Software Engineering: 22nd International Conference on Formal Engineering Methods, ICFEM 2020, Singapore, Singapore, March 1–3, 2021, Proceedings

The available ADTree constructs are extended with reactive patterns that cover further security scenarios, and all constructs with attributes such as time and cost to allow for quantitative analyses, and an extension of Asynchronous MultiAgents Systems: EAMAS is model.

Learning Mealy Machines with One Timer

It is shown how to obtain learning algorithms for MM1Ts via a reduction to the problem of learning Mealy machines, and an implementation of an MM1T learner on top of LearnLib is described and its performance is compared with recent algorithms proposed.

MM1T Learner for the 4-Way Handshake Protocol

  • Computer Science
  • 2022
This research investigates a proposed solution, the use of Mealy Machines with 1 Timer (MM1Ts), and applies the MM1T model learner on the Wi-Fi 4-way handshake protocol, and concludes that theMM1T learner can be a potential solution for learning real-life applications such as network protocols.

Inferring Switched Nonlinear Dynamical Systems

This paper study the identification problem for switched dynamical systems with polynomial ODEs, which combines estimating coefficients for nonlinear dynamics and determining boundaries between modes, and proposes two different algorithms, depending on whether to perform prior segmentation of trajectories.



The Learnability of Symbolic Automata

A novel \(L^*\)-style algorithm for learning symbolic automata using membership and equivalence queries, which treats the predicates appearing on transitions as their own learnable entities and can efficiently learn automata that cannot be learned using existing algorithms and significantly outperforms existing automata learning algorithms over large alphabets.

Learning Symbolic Automata

This paper defines notions of learnability that are parametric in the alphabet theories of the symbolic automata and shows how these notions nicely compose and how existing algorithms for learning automata over large alphabets nicely fall in this framework.

Time to Learn - Learning Timed Automata from Tests

A novel method for learning timed automata, finite state machines extended with real-valued clocks is presented, based on genetic programming, a search-based technique for automatic program creation.

A Theory of Timed Automata

An algorithm for learning real-time automata

The results are promising and show that learning a real-time automaton directly from timed data outperforms a method that uses sampling in order to deal with the timed data.

Active learning for extended finite state machines

A black-box active learning algorithm for inferring extended finite state machines (EFSM) by dynamic black- box analysis based on a novel learning model based on so-called tree queries that induces a generalization of the classical Nerode equivalence and canonical automata construction to the symbolic setting.

Efficiently identifying deterministic real-time automata from labeled data

It is shown that if the authors obtain data from a real-time system, it is easier to identify a DRTA from this data than to identify an equivalent DFA, and this is the first algorithm that can identify a timed automaton model from time-stamped event sequences.

The efficiency of identifying timed automata and the power of clocks

Event-Clock Automata: A Determinizable Class of Timed Automata

On the language inclusion problem for timed automata: closing a decidability gap

  • J. OuaknineJ. Worrell
  • Computer Science, Mathematics
    Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004.
  • 2004
The crux of the proof consists in reducing the language inclusion problem to a reachability question on an infinite graph, and constructing a suitable well-quasi-order on the nodes of this graph, which ensures the termination of the search algorithm.