Model Checking Quantified Computation Tree Logic

DOI10.1007/11817949_8MaRDI QIDQ5756604zbMATH OpenOpenAlexFDO

Authors Arend Rensink

Publication date 4 September 2007

Published in CONCUR 2006 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11817949_8

Mathematics Subject Classification ID

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

Recommendations

• Model checking computation tree logic over finite lattices
• Quantified computation tree logic
• Computation tree logic model checking based on possibility measures
• Computation tree logic and NuSMV model checker
• scientific article; zbMATH DE number 2042616
• Model Checking Quantitative Linear Time Logic
• scientific article; zbMATH DE number 177249
• scientific article; zbMATH DE number 177502
• Model-checking graded computation-tree logic with finite path semantics
• QUANTUM COMPUTATION TREE LOGIC — MODEL CHECKING AND COMPLETE CALCULUS

Cited in

(8)

• Quantified computation tree logic
• Computation tree measurement language (CTML)
• A logical approach to data-aware automated sequence generation
• Explicit State Model Checking for Graph Grammars
• Theory and Applications of Satisfiability Testing
• Model checking quantitative hyperproperties
• A presheaf semantics for quantified temporal logics
• CSL model checking algorithms for QBDs

Describes a project that uses

Uses Software

• Bandera
• GROOVE
• SPIN

This page was built for publication: Model Checking Quantified Computation Tree Logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756604)