The tail-recursive fragment of timed recursive CTL

DOI10.1016/j.ic.2023.105084MaRDI QIDQ6077845

Florian Bruse, Martin Lange

Publication date: 27 September 2023

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
• Results on the propositional \(\mu\)-calculus
• 25 years of model checking. History, achievements, perspectives
• Using branching time temporal logic to synthesize synchronization skeletons
• A theory of timed automata
• Symbolic model checking for real-time systems
• Space-efficient fragments of higher-order fixpoint logic
• Is your model checker on time? On the complexity of model checking for timed modal logics
• Timed automata
• Specifying program properties using modal fixpoint logics: a survey of results
• Relationships between nondeterministic and deterministic tape complexities
• Temporal Logics in Computer Science
• Model-Checking Timed ATL for Durational Concurrent Game Structures
• Can message buffers be axiomatized in linear temporal logic?
• Timed Temporal Logics
• Timed ATL: Forget Memory, Just Count
• CONCUR 2004 - Concurrency Theory
• CONCUR 2004 - Concurrency Theory
• Formal Methods for the Design of Real-Time Systems

This page was built for publication: The tail-recursive fragment of timed recursive CTL