A Rooted Tableau for BCTL*

DOI10.1016/j.entcs.2011.10.012zbMath1347.03035OpenAlexW2026976889WikidataQ113318194 ScholiaQ113318194MaRDI QIDQ2825414

John C. McCabe-Dansted

Publication date: 7 October 2016

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2011.10.012

zbMATH Keywords

tableaufull computation tree logic\(\mathrm{BCTL}^*\)bundled

Mathematics Subject Classification ID

Logic in computer science (03B70) Mechanization of proofs and logical operations (03B35) Temporal logic (03B44)

Related Items (6)

A Tableau for Bundled Strategies ⋮ To be fair, use bundles ⋮ Expressiveness and succinctness of a logic of robustness ⋮ Sublogics of a branching time logic of robustness ⋮ Rewrite rules for \(\mathrm{CTL}^\ast\) ⋮ A Rooted Tableau for BCTL*

Cites Work

• Unnamed Item
• An axiomatization of full Computation Tree Logic
• A Rooted Tableau for BCTL*
• A Tableau for Bundled CTL
• Deciding full branching time logic
• A Decision Procedure for CTL* Based on Tableaux and Automata

This page was built for publication: A Rooted Tableau for BCTL*