12 citations · 23 across the 4 of their papers we have counts for
1 paper · 2 filters
Martin Lück
The satisfiability problem of the branching time logic CTL is studied in terms of computational complexity. Tight upper and lower bounds are provided for each temporal operator fra…