On Solving Temporal Logic Queries

Abstract

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.

Efficient Compliance Checking Using BPMN-Q and Temporal Logic

“…We used Past linear time temporal logic PLTL [17,29] as it has introduced the counterpart temporal quantifiers (always in past, once in the past, previous sate, since) to allow expressing formulae about the past states of a system. Although these quantifier did not increase the expressiveness of LTL, it made expressing formulae about the past exponentially succinct than in pure-future LTL [16]. Since the representation of these temporal quantifiers is not standardized, we mention the notation we use throughout this paper.…”

On the distributivity of LTL specifications

“…[Gurfinkel et al 2002Chechik and Gurfinkel 2003], on the other hand, investigated CTL query solving using multivalued model checking. Hornus and Schnoebelen [2002] studied the complexity of query solving for fragments of CTL * . Note that, in general, temporal logic queries may have multiple incomparable solutions; algorithms for computing multiple solutions as well as extensions to multiple placeholders have been the subject of Bruns and Godefroid [2001], Hornus and Schnoebelen [2002], Gurfinkel et al [2002Gurfinkel et al [ , 2003, and Chechik and Gurfinkel [2003].…”

Good Friends are Hard to Find!

“…Still, the problems they consider are quite different from ours, and we see no direct relationship between them (even in the light of [8]). Our optimal coalition problem is in some sense related to the temporal logic query problem introduced in [3] and further studied in [10]. Our algorithm could be used to solve ATL queries of the form ?…”