Hybrid and First-Order Complete Extensions of CaRet

DOI10.1007/978-3-642-22119-4_7zbMath1333.03005OpenAlexW2181440551MaRDI QIDQ3010360

Laura Bozzelli, Ruggero Lanotte

Publication date: 1 July 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22119-4_7

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Temporal logic (03B44)

Related Items (1)

Hybrid and First-Order Complete Extensions of CaRet

Cites Work

• Unnamed Item
• A hierarchy of temporal logics with past
• Alternating finite automata on \(\omega\)-words
• Model checking hybrid logics (with an application to semistructured data)
• Hybrid and First-Order Complete Extensions of CaRet
• Alternating Automata and a Temporal Fixpoint Calculus for Visibly Pushdown Languages
• Complexity and Succinctness Issues for Linear-Time Hybrid Logics
• Visibly pushdown languages
• Bounded-Variable Fragments of Hybrid Logics
• Adding Nesting Structure to Words
• First-Order and Temporal Logics for Nested Words
• CaRet With Forgettable Past
• Tools and Algorithms for the Construction and Analysis of Systems

This page was built for publication: Hybrid and First-Order Complete Extensions of CaRet