Similar Items: Constraint Automata on Infinite Data Trees: From CTL(Z)/CTL*(Z) To Decision Procedures
- Counting CTL
- Quantified CTL: Expressiveness and Complexity
- Model Checking CTL is Almost Always Inherently Sequential
- HyperLTL Satisfiability Is Highly Undecidable, HyperCTL$^*$ is Even Harder
- Visualising CTL Witnesses and Counterexamples -- Extended Version
- Visibly Tree Automata with Memory and Constraints