On the expressive power of hybrid branching-time logics

DOI10.4230/LIPICS.TIME.2018.16MaRDI QIDQ5079784zbMATH OpenFDO

Authors Daniel Kernberger, Martin Lange

Publication date 28 May 2022

Full work available at URL https://doi.org/10.4230/LIPICS.TIME.2018.16

zbMATH Keywords

branching-time logicsexpressivenesshybrid logicsmu-calculus

Mathematics Subject Classification ID

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

Recommendations

• On the expressive power of hybrid branching-time logics
• Model checking for hybrid branching-time logics
• On the Hybrid Extension of CTL and CTL +
• Branching-time logics repeatedly referring to states
• The fully hybrid \(\mu\)-calculus

Cites work

• “Sometimes” and “not never” revisited
• An application of games to the completeness problem for formalized theories
• Decision procedures and expressiveness in the temporal logic of branching time
• scientific article; zbMATH DE number 1765663 (Why is no real title available?)
• scientific article; zbMATH DE number 803291 (Why is no real title available?)
• On the Hybrid Extension of CTL and CTL +
• Representation, reasoning, and relational structures: a hybrid logic manifesto
• Temporal logics in computer science. Finite-state systems
• The Complexity of Tree Automata and Logics of Programs
• The computational complexity of hybrid temporal logics
• The fully hybrid \(\mu\)-calculus
• Using branching time temporal logic to synthesize synchronization skeletons

Cited in

(5)

• On the expressive power of hybrid branching-time logics
• Model checking for hybrid branching-time logics
• On the Hybrid Extension of CTL and CTL +
• Complexity and Succinctness Issues for Linear-Time Hybrid Logics
• scientific article; zbMATH DE number 1512710 (Why is no real title available?)

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

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