Augmenting branching temporal logics with existential quantification over atomic propositions

DOI10.1093/LOGCOM/9.2.135MaRDI QIDQ4242583zbMATH OpenOpenAlexFDO

Authors Orna Kupferman

Publication date 20 June 1999

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/logcom/9.2.135

zbMATH Keywords

branching temporal logicscomplexitymodel checkingprogram complexity

Mathematics Subject Classification ID

Temporal logic (03B44) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 2196601
• scientific article; zbMATH DE number 1705163
• Branching-time temporal logic and tree automata
• scientific article; zbMATH DE number 1512710

Cited in

(9)

• Characterizing finite Kripke structures in propositional temporal logic
• Quantified computation tree logic
• Sublogics of a branching time logic of robustness
• The power of first-order quantification over states in branching and linear time temporal logics
• Branching-Time Temporal Logics with Minimal Model Quantifiers
• Quantifying Bounds in Strategy Logic
• scientific article; zbMATH DE number 7577569 (Why is no real title available?)
• Reasoning about Quality and Fuzziness of Strategic Behaviors
• \(\mathsf{QCTL}\) model-checking with \(\mathsf{QBF}\) solvers

This page was built for publication: Augmenting branching temporal logics with existential quantification over atomic propositions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4242583)