In automated planning, there has been a recent interest in solving class of problems, where single solution applies for multiple, possibly infinitely many, instances. This necessitates generalized notion plans, such as plans with loops. However, the correctness is non-trivial to define, making it difficult provide clear specification what we should be looking for. an influential paper, Levesque...