State Space Reduction for Automated Manufacturing Systems With Unreliable Resources Using Partial Order Technique

• Published in: 2024 10th International Conference on Control, Decision and Information Technologies (CoDIT) pp. 2170 - 2175
• Main Authors: Huang, Zexi, Chen, Lin, Liu, Gaiyun, Barkaoui, Kamel
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01-07-2024
• Subjects: automated manufacturing systems; Explosions; Faces; Information technology; Law; Manufacturing systems; partial order technique; Petri nets; Resource management; Reviews; System recovery; unreliable resources
• ISSN: 2576-3555
• DOI: 10.1109/CoDIT62066.2024.10708263

For automated manufacturing systems, the reachability graph analysis based on Petri nets faces with the state explosion challenge. This paper proposes an effective partial order technique for generalized system of simple sequential processes with unreliable resources by constructing improved weak-persistent graph. First, we review the partition technique of reachability graph which divides the marking type into legal and forbidden markings. Then, the definition of weak-persistent sets is introduced. Comparing with the original persistent set, the weak-persistent set achieves a better reduction in the state-space generation. However, it cannot be used directly in the system with unreliable resource due to uncontrollable transitions. Therefore, the concept of improved weak-persistent sets is proposed to reduce the reachability graph of generalized system of simple sequential processes with unreliable resources. Furthermore, it is showed that the improved weak-persistent graph can provide significant reduction compared with reachability graph while preserving all forbidden markings. Finally, the examples are given to demonstrate our method.