A Decidable and Expressive Fragment of Many-Sorted First-Order Linear Temporal Logic - Archive ouverte HAL Access content directly
Journal Articles Information and Computation Year : 2020

A Decidable and Expressive Fragment of Many-Sorted First-Order Linear Temporal Logic

Abstract

First-Order Linear Temporal Logic (FOLTL) and its Many-Sorted variant (MSFOLTL) are well-suited to specify infinite-state systems. However, the satisfiability of (MS)FOLTL is not even semi-decidable, thus preventing automated verification. In this paper, we exhibit various fragments of increasing scope that provide a pertinent basis for the abstract specification of infinite-state systems. We show that these fragments enjoy the Bounded Domain Property (any satisfiable (MS)FOLTL formula has a model with a finite, bounded FO domains), 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.
Fichier principal
Vignette du fichier
20201002-camera-ready.pdf (273.63 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02976675 , version 1 (23-10-2020)

Identifiers

Cite

Quentin Peyras, Julien Brunel, David Chemouil. A Decidable and Expressive Fragment of Many-Sorted First-Order Linear Temporal Logic. Information and Computation, 2020, pp.104641. ⟨10.1016/j.ic.2020.104641⟩. ⟨hal-02976675⟩

Collections

ONERA
56 View
148 Download

Altmetric

Share

Gmail Facebook X LinkedIn More