Quantified CTL: expressiveness and model checking (extended abstract)

DOI10.1007/978-3-642-32940-1_14MaRDI QIDQ2914370zbMATH OpenOpenAlexFDO

Authors Arnaud Da Costa, François Laroussinie, Nicolas Markey

Publication date 25 September 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-32940-1_14

Mathematics Subject Classification ID

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

Recommendations

• Quantified CTL: expressiveness and complexity
• \(\mathsf{QCTL}\) model-checking with \(\mathsf{QBF}\) solvers
• From quantified CTL to QBF
• On the expressiveness of QCTL
• Quantified computation tree logic

Cited in

(17)

• Quantified computation tree logic
• IPL: an integration property language for multi-model cyber-physical systems
• A logic with revocable and refinable strategies
• Quantitative \(\mu\)-calculus and CTL defined over constraint semirings
• Quantified CTL: expressiveness and complexity
• Reasoning about strategies: on the model-checking problem
• Game Quantification on Automatic Structures and Hierarchical Model Checking Games
• On the expressiveness of QCTL
• scientific article; zbMATH DE number 7438567 (Why is no real title available?)
• From quantified CTL to QBF
• Formula-dependent equivalence for compositional CTL model checking
• Finitely defined preference and preference indiscernibility in ATL with strategy contexts
• Arbitrary-arity tree automata for QCTL
• \(\mathsf{QCTL}\) model-checking with \(\mathsf{QBF}\) solvers
• On the semantics of strategy logic
• Augmenting ATL with strategy contexts
• CSL model checking algorithms for QBDs

This page was built for publication: Quantified CTL: expressiveness and model checking (extended abstract)

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