HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

On Solving Temporal Logic Queries

Abstract : Temporal query checking is an extension of temporal model checking where one asks what propositional formulae can be inserted in a temporal query (a temporal formula with a placeholder) so that the resulting formula is satisfied in the model at hand. We study the problem of computing all minimal solutions to a temporal query without restricting to so-called "valid" queries (queries guaranteed to have a unique minimal solution). While this problem is intractable in general, we show that deciding uniqueness of the minimal solution (and computing it) can be done in polynomial-time.
Document type :
Conference papers
Complete list of metadata

Cited literature [9 references]  Display  Hide  Download

https://hal.inria.fr/hal-01756107
Contributor : Samuel Hornus Connect in order to contact the contributor
Submitted on : Saturday, March 31, 2018 - 5:36:13 PM
Last modification on : Monday, November 29, 2021 - 7:46:02 PM

File

HS-amast2002.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

S Hornus, Ph Schnoebelen. On Solving Temporal Logic Queries. 9th International Conference on Algebraic Methodology and Software Technology (AMAST'02), Sep 2002, Saint Gilles les Bains, Réunion. ⟨10.1007/3-540-45719-4_12⟩. ⟨hal-01756107⟩

Share

Metrics

Record views

45

Files downloads

58