Temporal logics with language parameters
From MaRDI portal
Publication:6186316
DOI10.1016/j.ic.2023.105087MaRDI QIDQ6186316
Markus Müller-Olm, Jens Oliver Gutsfeld, Christian Dielitz
Publication date: 2 February 2024
Published in: Information and Computation (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Branching-time logics with path relativisation
- Visibly linear temporal logic
- Results on the propositional \(\mu\)-calculus
- Propositional dynamic logic of regular programs
- Visibly linear dynamic logic
- Model checking LTL with regular valuations for pushdown systems
- Operator precedence temporal logic and model checking
- Temporal logics with language parameters
- Complexity results on branching-time pushdown model checking
- Visibly rational expressions
- Model checking propositional dynamic logic with all extras
- Propositional dynamic logic with recursive programs
- Temporal Logics in Computer Science
- Operator Precedence Languages: Their Automata-Theoretic and Logic Characterization
- Temporal logic can be more expressive
- Alternating Automata and a Temporal Fixpoint Calculus for Visibly Pushdown Languages
- First-Order and Temporal Logics for Nested Words
- Propositional dynamic logic of looping and converse is elementarily decidable
- The Complexity of Tree Automata and Logics of Programs
- Alternating automata: Unifying truth and validity checking for temporal logics
- Tools and Algorithms for the Construction and Analysis of Systems
- CONCUR 2004 - Concurrency Theory
- A fixpoint calculus for local and global program flows
- Deterministic context free languages
- On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic
