Name
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. |
Year | Venue | Keywords |
|---|---|---|
2002 | AMAST | model checking,temporal logic |
Field | DocType | ISBN |
Uniqueness,Model checking,Computer science,Propositional calculus,Disjunctive normal form,Linear temporal logic,Theoretical computer science,Temporal logic,Time complexity,Kripke models | Conference | 3-540-44144-1 |
Citations | PageRank | References |
11 | 0.95 | 11 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Samuel Hornus | 1 | 166 | 12.52 |
| Ph. Schnoebelen | 2 | 11 | 0.95 |