Visibly linear temporal logic

DOI10.1007/978-3-319-08587-6_33zbMATH Open1423.68274OpenAlexW2278186161MaRDI QIDQ3192209FDOQ3192209

Authors: Laura Bozzelli, César Sánchez 

Publication date: 26 September 2014

Published in: Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-08587-6_33

Recommendations

• Visibly linear temporal logic
• Visibly linear dynamic logic
• Visibly linear dynamic logic
• On the expressive power of temporal logic
• Reasoning in a restricted temporal logic

Mathematics Subject Classification ID

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

Cited In (8)

• Visibly linear temporal logic
• Aperiodicity, Star-freeness, and First-order Logic Definability of Operator Precedence Languages
• Model-checking structured context-free languages
• Title not available (Why is that?)
• Visibly linear dynamic logic
• Visibly linear dynamic logic
• VLDL satisfiability and model checking via tree automata
• Parameterized linear temporal logics meet costs: still not costlier than LTL

This page was built for publication: Visibly linear temporal logic

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