Cooperative model generation for disabled people assistance
TELE-INFO'06 Proceedings of the 5th WSEAS international conference on Telecommunications and informatics
| Hi-index | 0.00 |
We propose an approach for solving some verification problems of time Petri nets using linear programming. The approach is based on the observation that for loop-closed time Petri nets, it is only necessary to investigate a finite prefix of an untimed run of the underlying Petri net. Using the technique we give solutions to the following problems: reachability, bounded delay timing analysis, and satisfication of linear duration properties. For all three problems we give algorithms that are decision procedures for loop-closed time Petri nets, and semi-decision procedures for general time Petri nets.