Visibly linear temporal logic

DOI10.1007/S10817-017-9410-ZMaRDI QIDQ682377zbMATH OpenOpenAlexFDO

Authors Laura Bozzelli, César Sánchez

Publication date 2 February 2018

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

Full work available at URL https://doi.org/10.1007/s10817-017-9410-z

zbMATH Keywords

automata theorytemporal logicvisibly pushdown languagesautomata-based decision procedures

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Temporal logic (03B44)

Recommendations

• Visibly linear temporal logic
• Visibly linear dynamic logic
• Visibly linear dynamic logic
• Alternating Automata and a Temporal Fixpoint Calculus for Visibly Pushdown Languages
• Regular Linear Temporal Logic

Cites work

• scientific article; zbMATH DE number 1670555 (Why is no real title available?)
• scientific article; zbMATH DE number 3560737 (Why is no real title available?)
• scientific article; zbMATH DE number 2080056 (Why is no real title available?)
• Adding Nesting Structure to Words
• Alternating Automata and a Temporal Fixpoint Calculus for Visibly Pushdown Languages
• Alternating automata on infinite trees
• Alternating finite automata on -words
• Alternation elimination for automata over nested words
• An automata-theoretic approach to branching-time model checking
• Dynamic linear time temporal logic
• First-Order and Temporal Logics for Nested Words
• Foundations of Software Science and Computation Structures
• How to translate efficiently extensions of temporal logics into alternating automata
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• Marrying Words and Trees
• On regular temporal logics with past
• Propositional dynamic logic of regular programs
• Query Automata for Nested Words
• Reasoning about infinite computations
• Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization
• Regular Linear Temporal Logic
• Regular linear temporal logic with past
• Temporal Logics for Concurrent Recursive Programs: Satisfiability and Model Checking
• Temporal logic can be more expressive
• Tools and Algorithms for the Construction and Analysis of Systems
• Visibly linear dynamic logic
• Visibly pushdown languages
• Visibly rational expressions
• Visibly rational expressions
• Weak alternating automata are not that weak

Cited in

(9)

• Visibly linear temporal logic
• Visibly linear dynamic logic
• Visibly linear dynamic logic
• Alternating Automata and a Temporal Fixpoint Calculus for Visibly Pushdown Languages
• A Branching Time Variant of CaRet
• VLDL satisfiability and model checking via tree automata
• Temporal logics with language parameters
• Interval Temporal Logic for Visibly Pushdown Systems
• A fragment of linear temporal logic for universal very weak automata

Describes a project that uses

Uses Software

• Bebop
• SPIN

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 Q682377)