Time Petri nets state space reduction using dynamic programming
Louchka Popova-Zeugmann · 2006
Abstract. In this paper a parametric description for the state space of an arbitrary TPN is given. An enumerative procedure for reducing the state space is introduced. The reduction is defined as a truncated multistage decision problem and solved recursively. A reachability graph is defined in a discrete way by using the reachable integer-states of the TPN.