Branching Time? Pruning Time!

DOI10.1007/978-3-642-31365-3_31zbMath1358.68193OpenAlexW146177403MaRDI QIDQ2908510

Markus Latte, Martin Lange

Publication date: 5 September 2012

Published in: Automated Reasoning (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.727.4272

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Borel determinacy
• Decision procedures and expressiveness in the temporal logic of branching time
• Temporal logic and state systems
• An axiomatization of PCTL*
• An axiomatization of full Computation Tree Logic
• A Tableau for Bundled CTL
• “Sometimes” and “not never” revisited
• The complexity of propositional linear temporal logics
• The Complexity of Tree Automata and Logics of Programs
• Propositional temporal logics: decidability and completeness
• A Decision Procedure for CTL* Based on Tableaux and Automata

This page was built for publication: Branching Time? Pruning Time!