Temporal Logic with Recursion.
From MaRDI portal
Publication:6060093
DOI10.4230/LIPICS.TIME.2020.6zbMath1530.03069OpenAlexW3088706144MaRDI QIDQ6060093
Publication date: 2 November 2023
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2020/12974/pdf/LIPIcs-TIME-2020-6.pdf/
Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)
Cites Work
- Unnamed Item
- Unnamed Item
- Propositional dynamic logic of nonregular programs
- Programming languages and their definition. Selected papers ed. by C. B. Jones
- Results on the propositional \(\mu\)-calculus
- Propositional dynamic logic of context-free programs and fixpoint logic with chop
- Using branching time temporal logic to synthesize synchronization skeletons
- Uniform inevitability is tree automaton ineffable
- A finite model theorem for the propositional \(\mu\)-calculus
- Propositional dynamic logic of regular programs
- A logic for reasoning about time and reliability
- Decision procedures and expressiveness in the temporal logic of branching time
- Propositional dynamic logic with recursive programs
- A lattice-theoretical fixpoint theorem and its applications
- Recurring Dominoes: Making the Highly Undecidable Highly Understandable
- Visibly pushdown languages
- Process algebra for synchronous communication
- “Sometimes” and “not never” revisited
- The complexity of propositional linear temporal logics
- The Complexity of Tree Automata and Logics of Programs
- A really temporal logic
- The Complexity of Model Checking Higher-Order Fixpoint Logic
- CONCUR 2004 - Concurrency Theory
- Three notes on the complexity of model checking fixpoint logic with chop
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Rudiments of \(\mu\)-calculus
- On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic
This page was built for publication: Temporal Logic with Recursion.