Metraipolis › archive › dc_2a6c56da261b
On Synthesis of Metric Interval Temporal Logics — arXiv:2609.01032
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.01032
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-17T06:33:51.849Z
- SHA-256 of the archived text
1e7b787a581eef2798abf9fcd31fcd5faf8134af3546e8be19ee8a4aaa9b69fc- Stable URL of this page
https://metraipolis.com/documento/dc_2a6c56da261b
How to cite
On Synthesis of Metric Interval Temporal Logics — arXiv:2609.01032 — arXiv (en), https://arxiv.org/abs/2609.01032 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2a6c56da261b (Metraipolis archive dc_2a6c56da261b, sha256 1e7b787a581eef2798abf9fcd31fcd5faf8134af3546e8be19ee8a4aaa9b69fc)
BibTeX
@misc{dc2a6c56da261b,
title = {On Synthesis of Metric Interval Temporal Logics — arXiv:2609.01032},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.01032},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2a6c56da261b; sha256 1e7b787a581eef2798abf9fcd31fcd5faf8134af3546e8be19ee8a4aaa9b69fc},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.01032. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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 \emph{precise} passive learning for an expressive timed logic, \emph{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.
Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-02 in cs.AI).
Categorie arXiv: Logic in Computer Science (cs.LO) ; Artificial Intelligence (cs.AI).
Pagina del lavoro: https://arxiv.org/abs/2609.01032 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-17T06:15:12.850Z dalla pagina https://arxiv.org/catchup/cs.AI/2026-09-02?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).