Quantified computation tree logic

DOI10.1016/S0020-0190(01)00260-5zbMath1014.68095OpenAlexW2076879179MaRDI QIDQ1603537

R. Smith

Publication date: 14 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(01)00260-5

zbMATH Keywords

verificationmodel checkingcomputation tree logic

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Related Items (4)

\(\mathsf{QCTL}\) model-checking with \(\mathsf{QBF}\) solvers ⋮ The power of first-order quantification over states in branching and linear time temporal logics ⋮ Embedding finite automata within regular expressions ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Planning for temporally extended goals.
• Computer science today. Recent trends and developments
• Automatic verification of finite-state concurrent systems using temporal logic specifications
• Relational queries computable in polynomial time
• Augmenting branching temporal logics with existential quantification over atomic propositions
• Reachability logic: an efficient fragment of transitive closure logic

This page was built for publication: Quantified computation tree logic