Visibly linear temporal logic
From MaRDI portal
Publication:682377
DOI10.1007/s10817-017-9410-zzbMath1425.68182OpenAlexW2593997315MaRDI QIDQ682377
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
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Temporal logic (03B44)
Related Items (5)
A Branching Time Variant of CaRet ⋮ Interval Temporal Logic for Visibly Pushdown Systems ⋮ Model Checking Temporal Properties of Recursive Probabilistic Programs ⋮ Temporal logics with language parameters ⋮ Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Alternating finite automata on \(\omega\)-words
- On regular temporal logics with past
- Alternating automata on infinite trees
- Propositional dynamic logic of regular programs
- Infinite games on finitely coloured graphs with applications to automata on infinite trees
- Dynamic linear time temporal logic
- Reasoning about infinite computations
- Visibly rational expressions
- How to Translate Efficiently Extensions of Temporal Logics into Alternating Automata
- Visibly Rational Expressions
- Alternation Elimination for Automata over Nested Words
- Temporal Logics for Concurrent Recursive Programs: Satisfiability and Model Checking
- Query Automata for Nested Words
- Temporal logic can be more expressive
- Marrying Words and Trees
- Regular Linear Temporal Logic
- Alternating Automata and a Temporal Fixpoint Calculus for Visibly Pushdown Languages
- Weak alternating automata are not that weak
- Visibly pushdown languages
- Adding Nesting Structure to Words
- First-Order and Temporal Logics for Nested Words
- Regular Linear Temporal Logic with Past
- Visibly Linear Dynamic Logic
- Tools and Algorithms for the Construction and Analysis of Systems
- An automata-theoretic approach to branching-time model checking
- Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization
- Foundations of Software Science and Computation Structures
This page was built for publication: Visibly linear temporal logic
