A Bounded Domain Property for an Expressive Fragment of First-Order Linear Temporal Logic

Abstract : First-Order Linear Temporal Logic (FOLTL) is well-suited to specify infinite-state systems. However, FOLTL satisfiability is not even semi-decidable, thus preventing automated verification. To address this, a possible track is to constrain specifications to a decidable fragment of FOLTL, but known fragments are too restricted to be usable in practice. In this paper, we exhibit various fragments of increasing scope that provide a pertinent basis for abstract specification of infinite-state systems. We show that these fragments enjoy the Bounded Domain Property (any satisfiable FOLTL formula has a model with a finite, bounded FO domain), which provides a basis for complete, automated verification by reduction to LTL satisfiability. Finally, we present a simple case study illustrating the applicability and limitations of our results.
Document type :
Conference papers
Complete list of metadatas

Cited literature [16 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02332521
Contributor : David Chemouil <>
Submitted on : Thursday, October 24, 2019 - 7:01:12 PM
Last modification on : Wednesday, November 13, 2019 - 5:10:10 PM

File

reprint.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Quentin Peyras, Julien Brunel, David Chemouil. A Bounded Domain Property for an Expressive Fragment of First-Order Linear Temporal Logic. 26th International Symposium on Temporal Representation and Reasoning (TIME 2019), Oct 2019, Málaga, Spain. ⟨10.4230/LIPIcs.TIME.2019.15⟩. ⟨hal-02332521⟩

Share

Metrics

Record views

9

Files downloads

12