Model checking timed recursive CTL
From MaRDI portal
Cites work
- A lattice-theoretical fixpoint theorem and its applications
- A theory of timed automata
- A type-based HFL model checking algorithm
- Alternation
- Can message buffers be axiomatized in linear temporal logic?
- CONCUR 2004 - Concurrency Theory
- CONCUR 2004 - Concurrency Theory
- scientific article; zbMATH DE number 48157 (Why is no real title available?)
- scientific article; zbMATH DE number 1304336 (Why is no real title available?)
- scientific article; zbMATH DE number 1059246 (Why is no real title available?)
- scientific article; zbMATH DE number 2087435 (Why is no real title available?)
- scientific article; zbMATH DE number 7455743 (Why is no real title available?)
- scientific article; zbMATH DE number 5585443 (Why is no real title available?)
- Model checking propositional dynamic logic with all extras
- Model-checking in dense real-time
- On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic
- Programming languages and their definition. Selected papers ed. by C. B. Jones
- Propositional dynamic logic of nonregular programs
- Results on the propositional \(\mu\)-calculus
- Rudiments of \(\mu\)-calculus
- Temporal Logic with Recursion.
- The Complexity of Model Checking Higher-Order Fixpoint Logic
- The Complexity of Tree Automata and Logics of Programs
- Timed temporal logics
- Using branching time temporal logic to synthesize synchronization skeletons
- “Sometimes” and “not never” revisited
This page was built for publication: Model checking timed recursive CTL
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6543268)
