A Bounded Domain Property for an Expressive Fragment of First-Order Linear Temporal Logic
Résumé
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.
Origine : Fichiers produits par l'(les) auteur(s)
Loading...