scientific article; zbMATH DE number 2084388
From MaRDI portal
Publication:4475142
Recommendations
- scientific article; zbMATH DE number 1512710
- On the expressivity and complexity of quantitative branching-time temporal logics
- scientific article; zbMATH DE number 2080198
- Branching-time logic with quantification over branches: The point of view of modal logic
- On the Complexity of Branching-Time Logics
- On quantified propositional logics and the exponential time hierarchy
- The decision problem for branching time logic
- Decision procedures and expressiveness in the temporal logic of branching time
- Propositional temporal logics: decidability and completeness
- Branching-Time Temporal Logics with Minimal Model Quantifiers
Cited in
(24)- \(\mathsf{QCTL}\) model-checking with \(\mathsf{QBF}\) solvers
- Augmenting ATL with strategy contexts
- scientific article; zbMATH DE number 7577569 (Why is no real title available?)
- Characterizing finite Kripke structures in propositional temporal logic
- Quantifying Bounds in Strategy Logic
- The decision problem for branching time logic
- Expressiveness and succinctness of a logic of robustness
- Good-for-Game QPTL: An Alternating Hodges Semantics
- Pure Logic with Branched Quantifiers
- Deciding full branching time logic
- On the Notion of Vacuous Truth
- scientific article; zbMATH DE number 4006233 (Why is no real title available?)
- Completeness of a branching-time logic with possible choices
- Definability and decidability of binary predicates for time granularity
- An epistemic predicate \(\mathrm{CTL}^{*}\) for finite control \(\pi\)-processes
- scientific article; zbMATH DE number 1512710 (Why is no real title available?)
- Reasoning about Quality and Fuzziness of Strategic Behaviors
- Decision procedures and expressiveness in the temporal logic of branching time
- On Non-local Propositional and Weak Monodic Quantified CTL*
- Simple interpretations among complicated theories
- R-generability, and definability in branching time logics
- Parity Automata for Quantitative Linear Time Logics
- On the expressivity and complexity of quantitative branching-time temporal logics
- QBF Encoding of Temporal Properties and QBF-Based Verification
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4475142)