On the distributivity of LTL specifications
Authors: 
Marko Samer, Helmut VeithAuthors Info & Claims
Marko Samer, Helmut VeithAuthors Info & ClaimsArticle No.: 20, Pages 1 - 26
Abstract
In this article, we investigate LTL specifications where γ[φ ∧ ψ] is equivalent to γ[φ] ∧ γ[ψ] independent of φ and ψ. Formulas γ with this property are called distributive queries because they naturally arise in Chan's seminal approach to temporal logic query solving [Chan 2000]. As recognizing distributive LTL queries is PSpace-complete, we consider distributive fragments of LTL defined by templates as in Buccafurri et al. [2001]. Our main result is a syntactic characterization of distributive LTL queries in terms of LTL templates: we construct a context-free template grammar LTLQx which guarantees that all specifications obtained from LTLQx are distributive, and all templates not obtained from LTLQx have simple nondistributive instantiations.
Supplementary Material
Online appendix to on the distributivity of LTL specifications on article 20.
- Download
- 219.96 KB
References
[1]
Bruns, G. and Godefroid, P. 2001. Temporal logic query checking. In Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science (LICS). IEEE Computer Society Press, Los Alamitos, CA, 409--417.
[2]
Buccafurri, F., Eiter, T., Gottlob, G., and Leone, N. 2001. On ACTL formulas having linear counterexamples. J. Comput. Syst. Sci. 62, 3, 463--515.
[3]
Chan, W. 2000. Temporal-logic queries. In Proceedings of the 12th International Conference on Computer Aided Verification (CAV). Lecture Notes in Computer Science, vol. 1855. Springer-Verlag, Berlin, Germany, 450--463.
[4]
Chechik, M. and Gurfinkel, A. 2003. TLQSolver: A temporal logic query checker. In Proceedings of the 15th International Conference on Computer Aided Verification (CAV). Lecture Notes in Computer Science, vol. 2725. Springer-Verlag, Berlin, Germany, 210--214.
[5]
Clarke, E. M., Grumberg, O., Jha, S., Lu, Y., and Veith, H. 2000. Counterexample-guided abstraction refinement. In Proceedings of the 12th International Conference on Computer Aided Verification (CAV). Lecture Notes in Computer Science, vol. 1855. Springer-Verlag, Berlin, Germany, 154--169. Extended version available as Clarke et al {2003}.
[6]
Clarke, E. M., Grumberg, O., Jha, S., Lu, Y., and Veith, H. 2003. Counterexample-guided abstraction refinement for symbolic model checking. J. ACM 50, 5, 752--794.
[7]
Clarke, E. M., Grumberg, O., and Long, D. E. 1994. Model checking and abstraction. ACM Trans. Program. Lang. Syst. 16, 5, 1512--1542.
[8]
Clarke, E. M., Talupur, M., and Veith, H. 2006. Environment abstraction for parameterized verification. In Proceedings of the 7th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI). Lecture Notes in Computer Science, vol. 3855. Springer-Verlag, Berlin, Germany, 126--141.
[9]
Clarke, E. M., Talupur, M., and Veith, H. 2008. Proving Ptolemy right: The environment abstraction framework for model checking concurrent systems. In Proceedings of the 14th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS). Lecture Notes in Computer Science, vol. 4963. Springer-Verlag, Berlin, Germany, 33--47.
[10]
Emerson, E. A. 1990. Temporal and modal logic. In Handbook of Theoretical Computer Science, J. van Leeuwen, Ed. Vol. B: Formal Methods and Semantics. Elsevier Science, Amsterdam, The Netherlands, Chapter 16, 995--1067.
[11]
Gurfinkel, A., Chechik, M., and Devereux, B. 2003. Temporal logic query checking: A tool for model exploration. IEEE Trans. Softw. Eng. 29, 10, 898--914.
[12]
Gurfinkel, A., Devereux, B., and Chechik, M. 2002. Model exploration with temporal logic query checking. In Proceedings of the 10th ACM Symposium on Foundations of Software Engineering (FSE). ACM Press, New York, NY, 139--148.
[13]
Hornus, S. and Schnoebelen, P. 2002. On solving temporal logic queries. In Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology (AMAST). Lecture Notes in Computer Science, vol. 2422. Springer-Verlag, Berlin, Germany, 163--177.
[14]
Maidl, M. 2000. The common fragment of CTL and LTL. In Proceedings of the 41st Annual Symposium on Foundations of Computer Science (FOCS). IEEE Computer Society Press, Los Alamitos, CA, 643--652.
[15]
Samer, M. 2004. Reasoning about specifications in model checking. Ph.D. dissertation. Vienna University of Technology, Vienna, Austria.
[16]
Samer, M. and Veith, H. 2003. Validity of CTL queries revisited. In Proceedings of the 12th Annual Conference of the European Association for Computer Science Logic (CSL). Lecture Notes in Computer Science, vol. 2803. Springer-Verlag, Berlin, Germany, 470--483.
[17]
Samer, M. and Veith, H. 2004a. Parameterized vacuity. In Proceedings of the 5th International Conference on Formal Methods in Computer-Aided Design (FMCAD). Lecture Notes in Computer Science, vol. 3312. Springer-Verlag, Berlin, Germany, 322--336.
[18]
Samer, M. and Veith, H. 2004b. A syntactic characterization of distributive LTL queries. In Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP). Lecture Notes in Computer Science, vol. 3142. Springer-Verlag, Berlin, Germany, 1099--1110.
[19]
Samer, M. and Veith, H. 2005. Deterministic CTL query solving. In Proceedings of the 12th International Symposium on Temporal Representation and Reasoning (TIME). IEEE Computer Society, Los Alamitos, CA, 156--165.
[20]
Samer, M. and Veith, H. 2007. On the notion of vacuous truth. In Proceedings of the 14th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR). Lecture Notes in Computer Science, vol. 4790. Springer-Verlag, Berlin, Germany, 2--14.
[21]
Sistla, A. P. and Clarke, E. M. 1985. The complexity of propositional linear temporal logics. J. ACM 32, 3, 733--749.
Index Terms
- On the distributivity of LTL specifications
Recommendations
Distributivity and associativity in effect algebras
We prove "large associativity" of the partial sum in effect algebras and present an overview of distributivity-like properties of partial operations and in effect algebras with respect to (possibly infinite) suprema and infima and vice versa ...
On the Deductive Strength of Various Distributivity Axioms for Boolean Algebras in Set Theory
AbstractIn this article, we shall show the generalized notions of distributivity of Boolean algebras have essential relations with several axioms and properties of set theory, say the Axiom of Choice, the Axiom of Dependence Choice, the Prime Ideal ...
Model Checking LTL Formulae in RAISE with FDR
IFM '09: Proceedings of the 7th International Conference on Integrated Formal MethodsThe Raise Specification Language (RSL) is a modeling language which supports various specification styles. To apply model checking to RSL concurrent descriptions, we translate RSL specifications into the input language CSPM of FDR. FDR is the model ...
Comments
Information & Contributors
Information
Published In
Copyright © 2010 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 18 May 2010
Accepted: 01 June 2009
Received: 01 September 2006
Published in TOCL Volume 11, Issue 3
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 218Total Downloads
- Downloads (Last 12 months)4
- Downloads (Last 6 weeks)1
Reflects downloads up to 16 Feb 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in