pub const MAX_CTL_STATES: usize = 256;Expand description
Computation-Tree Logic (CTL) — BRANCHING-time temporal logic over a transition
system, distinct from the LINEAR-time temporal_ltl. Transitions are
(state →next→ state') edges (predicate == next); a state satisfies a
proposition when (state, holds, prop) is present. Bounded, zero-heap.
Max states explored by the bounded zero-heap CTL reachability.