On the Hybrid Extension of CTL and CTL +
From MaRDI portal
Publication:3182944
DOI10.1007/978-3-642-03816-7_37zbMath1250.03029OpenAlexW2186597297MaRDI QIDQ3182944
Ahmet Kara, Volker Weber, Thomas Schwentick, Martin Lange
Publication date: 16 October 2009
Published in: Mathematical Foundations of Computer Science 2009 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-03816-7_37
Related Items (5)
On the Hybrid Extension of CTL and CTL + ⋮ Expressiveness and succinctness of a logic of robustness ⋮ On the expressive power of hybrid branching-time logics ⋮ Unnamed Item ⋮ Model checking for hybrid branching-time logics
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A hierarchy of temporal logics with past
- Elements of finite model theory.
- A purely model-theoretic proof of the exponential succinctness gap between CTL\(^{+}\) and CTL
- Domino-tiling games
- Specification in CTL + past for verification in CTL.
- Hybrid logics: characterization, interpolation and complexity
- On the Hybrid Extension of CTL and CTL +
- From Church and Prior to PSL
- Transitive closure logic, nested tree walking automata, and XPath
- Bounded-Variable Fragments of Hybrid Logics
- “Sometimes” and “not never” revisited
- Temporal Logics with Reference Pointers and Computation Tree Logics
- The computational complexity of hybrid temporal logics
- The succinctness of first-order logic on linear orders
This page was built for publication: On the Hybrid Extension of CTL and CTL +
