Similar Items: Model Checking CTL is Almost Always Inherently Sequential
- Counting CTL
- Quantified CTL: Expressiveness and Complexity
- Constraint Automata on Infinite Data Trees: From CTL(Z)/CTL*(Z) To Decision Procedures
- HyperLTL Satisfiability Is Highly Undecidable, HyperCTL$^*$ is Even Harder
- Almost periodic functions, constructively
- Overlap Algebras as Almost Discrete Locales