Temporal logic with recursion
From MaRDI portal
Publication:2051830
DOI10.1016/j.ic.2021.104804OpenAlexW3203357139MaRDI QIDQ2051830
Publication date: 25 November 2021
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2021.104804
Cites Work
- Propositional dynamic logic of nonregular programs
- Results on the propositional \(\mu\)-calculus
- 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
- Dynamic linear time temporal logic
- A logic for reasoning about time and reliability
- Modalities for model checking: Branching time logic strikes back
- Decision procedures and expressiveness in the temporal logic of branching time
- Propositional dynamic logic with recursive programs
- Recurring Dominoes: Making the Highly Undecidable Highly Understandable
- Temporal logic can be more expressive
- Linear Time Logics Around PSL: Complexity, Expressiveness, and a Little Bit of Succinctness
- Visibly pushdown languages
- Process algebra for synchronous communication
- “Sometimes” and “not never” revisited
- The complexity of propositional linear temporal logics
- Star-free regular sets of ω-sequences
- 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
- Testing and generating infinite sequences by a finite automaton
- Rudiments of \(\mu\)-calculus
- On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Temporal logic with recursion
