On Solving Temporal Logic Queries - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2002

On Solving Temporal Logic Queries

Résumé

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.
Fichier principal
Vignette du fichier
HS-amast2002.pdf (198.8 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01756107 , version 1 (31-03-2018)

Identifiants

Citer

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⟩
46 Consultations
65 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More