Abstract
This paper addresses the enforcement of prognosability and $K$-step prognosability in discrete event systems modeled with unbounded Petri nets that may enter deadlocks. Given an unbounded labeled Petri net, a simplified basis coverability graph is established to encode deadlock information without enumerating all basis markings. The enforcement of prognosability and $K$-step prognosability is achieved via optimal sensor selection using a relabeling function that maximizes the achievable $K$. Considering the cost of relabeling sensors, the proposed relabeling function is optimal by solving an integer linear programming problem. Examples are presented to demonstrate the proposed method.
Funding Information
  • National Key Research and Development Program of China (2018YFB1700104)
  • Science Technology Development Fund, MSAR (0029/2023/RIA1)