Variants of LTL query checking

Hana Chockler; Arie Gurfinkel; Ofer Strichman

doi:10.1007/978-3-642-19583-9_11

Variants of LTL query checking

Hana Chockler, Arie Gurfinkel, Ofer Strichman

Data and Decision Sciences

Technion - Israel Institute of Technology

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

Given a model M and a temporal logic formula Φ[?], where ? is a placeholder, the query checking problem, as defined for the case of CTL by Chan in 2000, is to find the strongest propositional formula f such that M = Φ[? ←f]. The motivation for solving this problem is, among other things, to get insight on the model. We consider various objectives to the LTL query-checking problem, and study the question of whether there is a better solution than simply enumerating all possible formulas (modulo logical equivalence). It turns out that in most cases the answer is no, but there is one particular objective for which the answer - in practice - is definitely yes. The solution is based on a reduction to a Pseudo-Boolean Solving problem.

Original language	English
Title of host publication	Hardware and Software
Subtitle of host publication	Verification and Testing - 6th International Haifa Verification Conference, HVC 2010, Revised Selected Papers
Pages	76-92
Number of pages	17
DOIs	https://doi.org/10.1007/978-3-642-19583-9_11
State	Published - 2011
Event	6th International Haifa Verification Conference on Hardware and Software: Verification and Testing, HVC 2010 - Haifa, Israel Duration: 4 Oct 2010 → 7 Oct 2010

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	6504 LNCS

Conference

Conference	6th International Haifa Verification Conference on Hardware and Software: Verification and Testing, HVC 2010
Country/Territory	Israel
City	Haifa
Period	4/10/10 → 7/10/10

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-642-19583-9_11

Cite this

Chockler, H., Gurfinkel, A., & Strichman, O. (2011). Variants of LTL query checking. In Hardware and Software: Verification and Testing - 6th International Haifa Verification Conference, HVC 2010, Revised Selected Papers (pp. 76-92). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6504 LNCS). https://doi.org/10.1007/978-3-642-19583-9_11

Chockler, Hana ; Gurfinkel, Arie ; Strichman, Ofer. / Variants of LTL query checking. Hardware and Software: Verification and Testing - 6th International Haifa Verification Conference, HVC 2010, Revised Selected Papers. 2011. pp. 76-92 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{e9abf488860b4829b7932c7a314cc24f,

title = "Variants of LTL query checking",

abstract = "Given a model M and a temporal logic formula Φ[?], where ? is a placeholder, the query checking problem, as defined for the case of CTL by Chan in 2000, is to find the strongest propositional formula f such that M = Φ[? ←f]. The motivation for solving this problem is, among other things, to get insight on the model. We consider various objectives to the LTL query-checking problem, and study the question of whether there is a better solution than simply enumerating all possible formulas (modulo logical equivalence). It turns out that in most cases the answer is no, but there is one particular objective for which the answer - in practice - is definitely yes. The solution is based on a reduction to a Pseudo-Boolean Solving problem.",

author = "Hana Chockler and Arie Gurfinkel and Ofer Strichman",

year = "2011",

doi = "10.1007/978-3-642-19583-9_11",

language = "الإنجليزيّة",

isbn = "9783642195822",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "76--92",

booktitle = "Hardware and Software",

note = "6th International Haifa Verification Conference on Hardware and Software: Verification and Testing, HVC 2010 ; Conference date: 04-10-2010 Through 07-10-2010",

}

Chockler, H, Gurfinkel, A & Strichman, O 2011, Variants of LTL query checking. in Hardware and Software: Verification and Testing - 6th International Haifa Verification Conference, HVC 2010, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6504 LNCS, pp. 76-92, 6th International Haifa Verification Conference on Hardware and Software: Verification and Testing, HVC 2010, Haifa, Israel, 4/10/10. https://doi.org/10.1007/978-3-642-19583-9_11

Variants of LTL query checking. / Chockler, Hana; Gurfinkel, Arie; Strichman, Ofer.
Hardware and Software: Verification and Testing - 6th International Haifa Verification Conference, HVC 2010, Revised Selected Papers. 2011. p. 76-92 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6504 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Variants of LTL query checking

AU - Chockler, Hana

AU - Gurfinkel, Arie

AU - Strichman, Ofer

PY - 2011

Y1 - 2011

N2 - Given a model M and a temporal logic formula Φ[?], where ? is a placeholder, the query checking problem, as defined for the case of CTL by Chan in 2000, is to find the strongest propositional formula f such that M = Φ[? ←f]. The motivation for solving this problem is, among other things, to get insight on the model. We consider various objectives to the LTL query-checking problem, and study the question of whether there is a better solution than simply enumerating all possible formulas (modulo logical equivalence). It turns out that in most cases the answer is no, but there is one particular objective for which the answer - in practice - is definitely yes. The solution is based on a reduction to a Pseudo-Boolean Solving problem.

AB - Given a model M and a temporal logic formula Φ[?], where ? is a placeholder, the query checking problem, as defined for the case of CTL by Chan in 2000, is to find the strongest propositional formula f such that M = Φ[? ←f]. The motivation for solving this problem is, among other things, to get insight on the model. We consider various objectives to the LTL query-checking problem, and study the question of whether there is a better solution than simply enumerating all possible formulas (modulo logical equivalence). It turns out that in most cases the answer is no, but there is one particular objective for which the answer - in practice - is definitely yes. The solution is based on a reduction to a Pseudo-Boolean Solving problem.

UR - http://www.scopus.com/inward/record.url?scp=79953035134&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-19583-9_11

DO - 10.1007/978-3-642-19583-9_11

M3 - منشور من مؤتمر

SN - 9783642195822

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 76

EP - 92

BT - Hardware and Software

T2 - 6th International Haifa Verification Conference on Hardware and Software: Verification and Testing, HVC 2010

Y2 - 4 October 2010 through 7 October 2010

ER -

Chockler H, Gurfinkel A, Strichman O. Variants of LTL query checking. In Hardware and Software: Verification and Testing - 6th International Haifa Verification Conference, HVC 2010, Revised Selected Papers. 2011. p. 76-92. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-19583-9_11

Variants of LTL query checking

Abstract

Publication series

Conference

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Cite this