To be fair, use bundles

DOI10.1007/s10472-017-9546-xzbMath1420.03034OpenAlexW2606333453MaRDI QIDQ2408744

John C. McCabe-Dansted, M. A. Reynolds

Publication date: 13 October 2017

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10472-017-9546-x

zbMATH Keywords

fairnesstableaubundlesBCTLfull computation tree logic

Mathematics Subject Classification ID

Logic in computer science (03B70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Temporal logic (03B44)

Related Items (1)

Sublogics of a branching time logic of robustness

Cites Work

• Unnamed Item
• Unnamed Item
• A tableau-based decision procedure for CTL\(^*\)
• The temporal logic of branching time
• A clausal resolution method for branching-time logic \(\text{ECTL}^+\)
• Characterizing finite Kripke structures in propositional temporal logic
• Modalities for model checking: Branching time logic strikes back
• Decision procedures and expressiveness in the temporal logic of branching time
• A Rooted Tableau for BCTL*
• Labelled natural deduction for a bundled branching temporal logic
• A Tableau for Bundled CTL
• Reasoning with time and chance
• Deciding full branching time logic
• “Sometimes” and “not never” revisited
• The Complexity of Tree Automata and Logics of Programs
• A resolution calculus for the branching-time temporal logic CTL
• Tools and Algorithms for the Construction and Analysis of Systems
• A Decision Procedure for CTL* Based on Tableaux and Automata

This page was built for publication: To be fair, use bundles