Adding an ending-to-starting edge to exactly simulate instantaneous transitions
Demonstrate that introducing an additional transition (edge) from the ending location to the starting location in each action automaton enables exact simulation of the intended instantaneous end-to-start scheduling step, and prove that the modified network of timed automata preserves the temporal-planning semantics under the paper’s mutex and invariant conditions.
References
Furthermore, we conjecture that another edge, like _a.ie but transitioning from the ending state to the starting state, would allow the automaton to exactly simulate this transition.
— Formally Verified Certification of Unsolvability of Temporal Planning Problems
(2510.10189 - Wang et al., 11 Oct 2025) in Future Work