On the expressive power of hybrid branching-time logics

DOI10.1016/j.tcs.2020.01.014zbMath1433.03051OpenAlexW3002559822MaRDI QIDQ1989342

Daniel Kernberger, Martin Lange

Publication date: 21 April 2020

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

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2018/9781/

zbMATH Keywords

expressive powerbranching-time logicshybrid logics

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Using branching time temporal logic to synthesize synchronization skeletons
• CTL\(^*\) and ECTL\(^*\) as fragments of the modal \(\mu\)-calculus
• An until hierarchy and other applications of an Ehrenfeucht-Fraïssé game for temporal logic
• Decision procedures and expressiveness in the temporal logic of branching time
• Hybrid logics: characterization, interpolation and complexity
• Temporal Logics in Computer Science
• On the Hybrid Extension of CTL and CTL +
• An application of games to the completeness problem for formalized theories
• “Sometimes” and “not never” revisited
• The Complexity of Tree Automata and Logics of Programs
• Representation, reasoning, and relational structures: a hybrid logic manifesto
• The computational complexity of hybrid temporal logics

This page was built for publication: On the expressive power of hybrid branching-time logics