Quantified computation tree logic
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3888913 (Why is no real title available?)
- scientific article; zbMATH DE number 3870578 (Why is no real title available?)
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- Augmenting branching temporal logics with existential quantification over atomic propositions
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- Computer science today. Recent trends and developments
- Planning for temporally extended goals.
- Reachability logic: an efficient fragment of transitive closure logic
- Relational queries computable in polynomial time
Cited in
(33)- Computation tree logic with deadlock detection
- Action and State Based Computation Tree Measurement Language and Algorithms
- Quantified CTL: expressiveness and complexity
- Axiomatizing the Monodic Fragment of
- scientific article; zbMATH DE number 1705170 (Why is no real title available?)
- Embedding finite automata within regular expressions
- A branching time temporal framework for quantitative reasoning
- \(\mathsf{QCTL}\) model-checking with \(\mathsf{QBF}\) solvers
- From quantified CTL to QBF
- On the expressiveness of QCTL
- Axiomatising extended computation tree logic
- Learning to verify branching time properties
- On the expressivity and complexity of quantitative branching-time temporal logics
- Computable semantics for \(\text{CTL}^*\) on discrete-time and continuous-space dynamic systems
- Graded Computation Tree Logic with Binary Coding
- Quirky quantifiers: optimal models and complexity of computation tree logic
- Some properties of computation tree logic under possibility measures
- Model Checking Quantified Computation Tree Logic
- Counting CTL
- Computation tree measurement language (CTML)
- Checking extended CTL properties using guarded quotient structures
- Extended computation tree logic
- Computation tree logic model checking based on possibility measures
- Local distributed model checking of RegCTL
- Cycle detection in computation tree logic
- Computable CTL * for Discrete-Time and Continuous-Space Dynamic Systems
- The power of first-order quantification over states in branching and linear time temporal logics
- Quantified CTL: expressiveness and model checking (extended abstract)
- Computation tree logic for synchronization properties
- On the Expressive Power of QLTL
- Reachability logic: an efficient fragment of transitive closure logic
- Model checking QCTL plus on quantum Markov chains
- scientific article; zbMATH DE number 7577569 (Why is no real title available?)
This page was built for publication: Quantified computation tree logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1603537)
