The complexity of propositional linear temporal logics
Journal of the ACM (JACM)
Handbook of theoretical computer science (vol. B)
Model checking and abstraction
ACM Transactions on Programming Languages and Systems (TOPLAS)
On ACTL formulas having linear counterexamples
Journal of Computer and System Sciences
Model exploration with temporal logic query checking
Proceedings of the 10th ACM SIGSOFT symposium on Foundations of software engineering
On Solving Temporal Logic Queries
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Counterexample-Guided Abstraction Refinement
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
The common fragment of CTL and LTL
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Counterexample-guided abstraction refinement for symbolic model checking
Journal of the ACM (JACM)
Deterministic CTL Query Solving
TIME '05 Proceedings of the 12th International Symposium on Temporal Representation and Reasoning
Temporal Logic Query Checking: A Tool for Model Exploration
IEEE Transactions on Software Engineering
On the notion of vacuous truth
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Proving ptolemy right: the environment abstraction framework for model checking concurrent systems
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Environment abstraction for parameterized verification
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
| Hi-index | 0.00 |
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.