scientific article; zbMATH DE number 2084388
From MaRDI portal
Publication:4475142
zbMATH Open1052.03007MaRDI QIDQ4475142FDOQ4475142
Authors: Tim French 
Publication date: 9 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2256/22560165.htm
Title of this publication is not available (Why is that?)
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
Formal languages and automata (68Q45) Decidability of theories and sets of sentences (03B25) Temporal logic (03B44) Logic in computer science (03B70)
Cited In (24)
- \(\mathsf{QCTL}\) model-checking with \(\mathsf{QBF}\) solvers
- Augmenting ATL with strategy contexts
- Title not available (Why is that?)
- Quantifying Bounds in Strategy Logic
- The decision problem for branching time logic
- Characterizing finite Kripke structures in propositional temporal 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
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- 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)
