Similar Items: Quantified CTL: Expressiveness and Complexity
- Counting CTL
- Constraint Automata on Infinite Data Trees: From CTL(Z)/CTL*(Z) To Decision Procedures
- Model Checking CTL is Almost Always Inherently Sequential
- HyperLTL Satisfiability Is Highly Undecidable, HyperCTL$^*$ is Even Harder
- On the Expressiveness and Complexity of ATL
- The Complexity of Aggregates over Extractions by Regular Expressions