CHARDA: Causal Hybrid Automata Recovery via Dynamic Analysis
Not on the map. Why?
Abstract (arXiv)
We propose and evaluate a new technique for learning hybrid automata automatically by observing the runtime behavior of a dynamical system. Working from a sequence of continuous state values and predicates about the environment, CHARDA recovers the distinct dynamic modes, learns a model for each mode from a given set of templates, and postulates causal guard conditions which trigger transitions between modes. Our main contribution is the use of information-theoretic measures (1)~as a cost function for data segmentation and model selection to penalize over-fitting and (2)~to determine the likely causes of each transition. CHARDA is easily extended with different classes of model templates, fitting methods, or predicates. In our experiments on a complex videogame character, CHARDA successfully discovers a reasonable over-approximation of the character's true behaviors. Our results also compare favorably against recent work in automatically learning probabilistic timed automata in an aircraft domain: CHARDA exactly learns the modes of these simpler automata.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 11 Jul 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1.
1 paper.
- 2022Synthesis of Parametric Hybrid Automata from Time Seriescited by 0
- 2022Synthesis of Parametric Hybrid Automata from Time Series13 Jul 2022