Model checking timed recursive CTL

DOI10.1016/j.ic.2024.105168MaRDI QIDQ6543268

Florian Bruse, Martin Lange

Publication date: 24 May 2024

Published in: Information and Computation (Search for Journal in Brave)

zbMATH Keywords

timed automatamodel checking

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Model-checking in dense real-time
• Propositional dynamic logic of nonregular programs
• Programming languages and their definition. Selected papers ed. by C. B. Jones
• Results on the propositional \(\mu\)-calculus
• Using branching time temporal logic to synthesize synchronization skeletons
• A theory of timed automata
• Model checking propositional dynamic logic with all extras
• A lattice-theoretical fixpoint theorem and its applications
• Can message buffers be axiomatized in linear temporal logic?
• “Sometimes” and “not never” revisited
• Alternation
• The Complexity of Tree Automata and Logics of Programs
• Timed Temporal Logics
• The Complexity of Model Checking Higher-Order Fixpoint Logic
• CONCUR 2004 - Concurrency Theory
• CONCUR 2004 - Concurrency Theory
• Rudiments of \(\mu\)-calculus
• Temporal Logic with Recursion.
• On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic
• A type-based HFL model checking algorithm

This page was built for publication: Model checking timed recursive CTL