1 citations · 1 across the 1 of their papers we have counts for
1 paper
Volker Weber
We classify the complexity of the satisfiability problem for extensions of CTL and UB. The extensions we consider are Boolean combinations of path formulas, fairness properties, pa…