scientific article; zbMATH DE number 2084388

MaRDI QIDQ4475142zbMATH OpenFDO

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Decidability of theories and sets of sentences (03B25) Temporal logic (03B44) Logic in computer science (03B70)

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)

• QBF Encoding of Temporal Properties and QBF-Based Verification
• Pure Logic with Branched Quantifiers
• Decision procedures and expressiveness in the temporal logic of branching time
• scientific article; zbMATH DE number 1512710 (Why is no real title available?)
• Reasoning about Quality and Fuzziness of Strategic Behaviors
• Simple interpretations among complicated theories
• scientific article; zbMATH DE number 4006233 (Why is no real title available?)
• On Non-local Propositional and Weak Monodic Quantified CTL*
• An epistemic predicate \(\mathrm{CTL}^{*}\) for finite control \(\pi\)-processes
• Good-for-Game QPTL: An Alternating Hodges Semantics
• Completeness of a branching-time logic with possible choices
• \(\mathsf{QCTL}\) model-checking with \(\mathsf{QBF}\) solvers
• \(R\)-generability, and definability in branching time logics
• Parity Automata for Quantitative Linear Time Logics
• Augmenting ATL with strategy contexts
• On the Notion of Vacuous Truth
• Definability and decidability of binary predicates for time granularity
• On the expressivity and complexity of quantitative branching-time temporal logics
• The decision problem for branching time logic
• Characterizing finite Kripke structures in propositional temporal logic
• Deciding full branching time logic
• Expressiveness and succinctness of a logic of robustness
• Quantifying Bounds in Strategy Logic
• scientific article; zbMATH DE number 7577569 (Why is no real title available?)

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)