Temporal logic with recursion

DOI10.1016/J.IC.2021.104804MaRDI QIDQ2051830zbMATH OpenOpenAlexFDO

Authors Florian Bruse, Martin Lange

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

zbMATH Keywords

fixpoint theoryrecursiontemporal logic

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Temporal Logic with Recursion.
• scientific article; zbMATH DE number 4182845
• scientific article; zbMATH DE number 1749195
• Temporal Logics
• scientific article; zbMATH DE number 3985193
• Timed temporal logics
• Temporal and dynamic logic
• scientific article; zbMATH DE number 947806
• scientific article; zbMATH DE number 4082943
• Temporal logic programming

Cites work

• A finite model theorem for the propositional \(\mu\)-calculus
• A logic for reasoning about time and reliability
• A really temporal logic
• A type-directed negation elimination
• CONCUR 2004 - Concurrency Theory
• Decision procedures and expressiveness in the temporal logic of branching time
• Dynamic linear time temporal logic
• First-order definable languages
• scientific article; zbMATH DE number 1705164 (Why is no real title available?)
• scientific article; zbMATH DE number 4027441 (Why is no real title available?)
• scientific article; zbMATH DE number 1304336 (Why is no real title available?)
• scientific article; zbMATH DE number 1927566 (Why is no real title available?)
• scientific article; zbMATH DE number 3237829 (Why is no real title available?)
• Linear Time Logics Around PSL: Complexity, Expressiveness, and a Little Bit of Succinctness
• Modalities for model checking: Branching time logic strikes back
• On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic
• Process algebra for synchronous communication
• Propositional dynamic logic of nonregular programs
• Propositional dynamic logic of regular programs
• Propositional dynamic logic with recursive programs
• Recurring Dominoes: Making the Highly Undecidable Highly Understandable
• Results on the propositional \(\mu\)-calculus
• Rudiments of \(\mu\)-calculus
• Star-free regular sets of ω-sequences
• Temporal logic can be more expressive
• Testing and generating infinite sequences by a finite automaton
• The Complexity of Model Checking Higher-Order Fixpoint Logic
• The complexity of propositional linear temporal logics
• The Complexity of Tree Automata and Logics of Programs
• Three notes on the complexity of model checking fixpoint logic with chop
• Uniform inevitability is tree automaton ineffable
• Using branching time temporal logic to synthesize synchronization skeletons
• Visibly pushdown languages
• “Sometimes” and “not never” revisited

Cited in

(5)

• scientific article; zbMATH DE number 1302029 (Why is no real title available?)
• On recursive operations over logic LTS
• scientific article; zbMATH DE number 4182845 (Why is no real title available?)
• Temporal Logic with Recursion.
• Trace-based deductive verification

This page was built for publication: Temporal logic with recursion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2051830)