| Article ID: | iaor20083364 |
| Country: | Poland |
| Volume: | 35 |
| Issue: | 3 |
| Start Page Number: | 721 |
| End Page Number: | 748 |
| Publication Date: | Jan 2006 |
| Journal: | Control and Cybernetics |
| Authors: | Popova-Zeugmann Louchka |
| Keywords: | programming: dynamic |
In this paper a parametric description for the state space of an arbitrary Timed Petri Net (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.