Metraipolis › archive › dc_ea33e5527fae
Learning GR(1) Specifications from Traces — arXiv:2608.06546
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.06546
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-23T15:19:02.810Z
- SHA-256 of the archived text
732bad535ff4b846ba2e00b709e08c869d5e4cd8a94f47e4c0b9dac0f1c5f94f- Stable URL of this page
https://metraipolis.com/documento/dc_ea33e5527fae
How to cite
Learning GR(1) Specifications from Traces — arXiv:2608.06546 — arXiv (en), https://arxiv.org/abs/2608.06546 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ea33e5527fae (Metraipolis archive dc_ea33e5527fae, sha256 732bad535ff4b846ba2e00b709e08c869d5e4cd8a94f47e4c0b9dac0f1c5f94f)
BibTeX
@misc{dcea33e5527fae,
title = {Learning GR(1) Specifications from Traces — arXiv:2608.06546},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.06546},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ea33e5527fae; sha256 732bad535ff4b846ba2e00b709e08c869d5e4cd8a94f47e4c0b9dac0f1c5f94f},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.06546. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Constrained specification mining enables the automatic discovery of desired properties from system traces. Generalized Reactivity of Rank 1, or GR(1), is a fragment of LTL with polynomial-time synthesis that natively encodes assume-guarantee properties present in most hardware and robotics domains. In this paper, we present GR1MINE, a SAT-based tool for efficiently learning GR(1) formulas from examples. We exploit the GR(1) temporal skeleton to incrementally enumerate formula candidates, leveraging learnt clauses to avoid recomputation. On the Boolean GR(1) Syntech suite, GR1MINE learns a realizable formula for all 60 benchmarks over 30X faster than generic and constrained LTL mining tools. On non-GR(1) specifications from SYNTCOMP, GR1MINE is still able to recover >2X more realizable specifications than baselines within the timeout. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-10 in cs.LO). Categorie arXiv: Logic in Computer Science (cs.LO) ; Formal Languages and Automata Theory (cs.FL); Software Engineering (cs.SE). Pagina del lavoro: https://arxiv.org/abs/2608.06546 — 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-23T15:09:24.945Z dalla pagina https://arxiv.org/catchup/cs.LO/2026-08-10?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).