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.
@InProceedings{peyras_et_al:LIPIcs.TIME.2019.15, author = {Peyras, Quentin and Brunel, Julien and Chemouil, David}, title = {{A Bounded Domain Property for an Expressive Fragment of First-Order Linear Temporal Logic}}, booktitle = {26th International Symposium on Temporal Representation and Reasoning (TIME 2019)}, pages = {15:1--15:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-127-6}, ISSN = {1868-8969}, year = {2019}, volume = {147}, editor = {Gamper, Johann and Pinchinat, Sophie and Sciavicco, Guido}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TIME.2019.15}, URN = {urn:nbn:de:0030-drops-113731}, doi = {10.4230/LIPIcs.TIME.2019.15}, annote = {Keywords: First-Order Linear Temporal Logic, Bounded Domain Property, Finite Domain Property, Decidability} }
Feedback for Dagstuhl Publishing