On the expressive power of hybrid branching-time logics

DOI10.4230/LIPICS.TIME.2018.16zbMATH Open1487.68158MaRDI QIDQ5079784FDOQ5079784

Authors: Daniel Kernberger, Martin Lange 

Publication date: 28 May 2022

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

zbMATH Keywords

mu-calculusexpressivenessbranching-time logicshybrid logics

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (4)

• On the expressive power of hybrid branching-time logics
• Complexity and Succinctness Issues for Linear-Time Hybrid Logics
• On the Hybrid Extension of CTL and CTL +
• Title not available (Why is that?)

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)