Optimal Sensor Selection for $K$-Step Prognosability Verification and Enforcement of Unbounded Petri Nets
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.
Fields of Study & Subjects
Petri Nets in System Modeling
Fault Detection and Control Systems
Distributed Sensor Networks and Detection Algorithms
Publication details
- Journal / source
- IEEE Transactions on Automatic Control
- Publisher
- Institute of Electrical and Electronics Engineers (IEEE)
- Volume
- 71
- Issue
- 9
- Pages
- 6275–6282
- Publication date
- 13 April 2026