Complexity and succinctness issues for linear-time hybrid logics
From MaRDI portal
Publication:1044839
DOI10.1016/j.tcs.2009.08.009zbMath1187.68292MaRDI QIDQ1044839
Laura Bozzelli, Ruggero Lanotte
Publication date: 15 December 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.08.009
hybrid logics; alternating automata; complexity and succinctness issues; linear temporal logics \(+\) past
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Alternating finite automata on \(\omega\)-words
- Succinct representation of regular languages by Boolean automata
- Reasoning about infinite computations
- The complexity of propositional linear temporal logics in simple cases
- Hierarchies of modal and temporal logics with reference pointers
- Model checking hybrid logics (with an application to semistructured data)
- Hybrid logics: characterization, interpolation and complexity
- Bounded-Variable Fragments of Hybrid Logics
- The complexity of propositional linear temporal logics
- Computer Science Logic