Visibly linear temporal logic
From MaRDI portal
Publication:682377
DOI10.1007/S10817-017-9410-ZzbMATH Open1425.68182OpenAlexW2593997315MaRDI QIDQ682377FDOQ682377
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
Recommendations
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Temporal logic (03B44)
Cites Work
- Propositional dynamic logic of regular programs
- Visibly pushdown languages
- Temporal logic can be more expressive
- Title not available (Why is that?)
- Reasoning about infinite computations
- Alternating automata on infinite trees
- An automata-theoretic approach to branching-time model checking
- Alternating finite automata on \(\omega\)-words
- Infinite games on finitely coloured graphs with applications to automata on infinite trees
- Regular Linear Temporal Logic
- Weak alternating automata are not that weak
- Title not available (Why is that?)
- Title not available (Why is that?)
- Tools and Algorithms for the Construction and Analysis of Systems
- Foundations of Software Science and Computation Structures
- Alternation elimination for automata over nested words
- Temporal Logics for Concurrent Recursive Programs: Satisfiability and Model Checking
- First-Order and Temporal Logics for Nested Words
- Alternating Automata and a Temporal Fixpoint Calculus for Visibly Pushdown Languages
- Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization
- Visibly linear dynamic logic
- Adding Nesting Structure to Words
- Marrying Words and Trees
- Query Automata for Nested Words
- Dynamic linear time temporal logic
- Visibly rational expressions
- How to translate efficiently extensions of temporal logics into alternating automata
- Visibly rational expressions
- Regular linear temporal logic with past
- On regular temporal logics with past
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
Uses Software
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)
