QLTL model-checking
From MaRDI portal
Cites work
- \(\mathsf{QCTL}\) model-checking with \(\mathsf{QBF}\) solvers
- Alternation
- Complete Proof System for QPTL
- Decidability of quantifed propositional branching time logics
- Deciding full branching time logic
- scientific article; zbMATH DE number 7577569 (Why is no real title available?)
- scientific article; zbMATH DE number 2196589 (Why is no real title available?)
- Mu-calculus path checking
- Quantified CTL: expressiveness and complexity
- Stutter-invariant languages, -automata, and temporal logic
- Taming past LTL and flat counter systems
- Temporal logic can be more expressive
- The complementation problem for Büchi automata with applications to temporal logic
- Weak Kripke structures and LTL
This page was built for publication: QLTL model-checking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6856017)