On Synthesis of Metric Interval Temporal Logics
Not on the map. Why?
Abstract (arXiv)
Automated mining of formal specifications is vital for verifying real-time systems. However, existing passive learning approaches remain restricted to deterministic specifications or limited fragments of Timed Regular Expressions (TRE). To our knowledge, this paper presents the first framework to tackle precise passive learning for an expressive timed logic, Metric Interval Temporal Logic (MITL) without relying on predefined templates or restricted logic fragments. Our approach formally reduces the timed learning problem into a scalable untimed one. By identifying quantitative timing differences between positive and negative traces, we synthesise precise timed constraints and inject them as new Boolean atomic propositions. This embeds timing into the alphabet, delegating the complex formula evaluation to highly optimised, off-the-shelf untimed LTL tools. Crucially, our framework is complete, guaranteeing a separating specification can always be found. We evaluate our implementation across several benchmarks, demonstrating the effectiveness of our approach.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 14 of its 44 references that are in the map. First posted on arXiv 1 Sep 2026.
Builds on
14 of 44 references.
References · 14
- 2016Reinforcement Learning With Temporal Logic Rewardscited by 117
- 2018Learning Linear Temporal Propertiescited by 41
- 2019Transfer of Temporal Logic Formulas in Reinforcement Learningcited by 31
- 2019Interpretable Classification of Time-Series Data using Efficient Enumerative Techniquescited by 20
- 2022Learning Interpretable Temporal Properties from Positive Examples Onlycited by 12
- 2023How Effective are Large Language Models in Generating Software Specifications?cited by 12
- 2020Interval Temporal Logic Decision Tree Learningcited by 7
- 2024LTL learning on GPUscited by 6
- 2022Differentiable Inference of Temporal Logic Formulascited by 5
- 2020Active learning of timed automata with unobservable resetscited by 3
- 2022Active Learning of One-Clock Timed Automata using Constraint Solvingcited by 3
- 2023Synthesizing Efficiently Monitorable Formulas in Metric Temporal Logiccited by 3
2 more
- 2025On Synthesis of Timed Regular Expressionscited by 1
- 2025LTLf Learning Meets Boolean Set Covercited by 1
Built on by
Not cited yet.