Title
SMT-based satisfiability of first-order LTL with event freezing functions and metric operators
Abstract
In this paper, we propose to extend First-Order Linear-time Temporal Logic with Past adding two operators “at next” and “at last”, which take in input a term and a formula and return the value of the term at the next state in the future or last state in the past in which the formula holds. The new logic, named LTL-EF, can be interpreted with different models of time (including discrete, dense, and super-dense time) and with different first-order theories (à la Satisfiability Modulo Theories (SMT)). We show that the “at next” and “at last” can encode (first-order) MTL0,∞ with counting. We provide rewriting procedures to reduce the satisfiability problem to the discrete-time case (to leverage on the mature state-of-the-art corresponding verification techniques) and to remove the extra functional symbols. We implemented these techniques in the nuXmv model checker enabling the analysis of LTL-EF and MTL0,∞ based on SMT-based model checking. We show the feasibility of the approach experimenting with several non-trivial valid and satisfiable formulas.
Year
DOI
Venue
2020
10.1016/j.ic.2019.104502
Information and Computation
Keywords
DocType
Volume
First-order linear-time temporal logic,Metric temporal logic,SMT-based model checking,Temporal satisfiability
Journal
272
ISSN
Citations 
PageRank 
0890-5401
1
0.35
References 
Authors
0
5
Name
Order
Citations
PageRank
Alessandro Cimatti15064323.15
Alberto Griggio262436.37
Enrico Magnago310.35
Marco Roveri4167896.70
Stefano Tonetta557341.61