An Efficient Petri Net Dynamics-Based Controllability of FMS Models

The novel algorithm presented highly efficient Petri Nets (PNs) dynamics-based controllability flexible manufacturing systems (FMSs) that use PNs with optimal control transitions (CTs). The effectiveness of the CT detection process guarantees that dead markings satisfy implicit resource requirements, prompting CT to reconfigure the FMS. The PN is an appropriate model that benefits the approach from the specification, verification, and implementation in FMS. Deadlock detection and analysis often use the most effective Reachability Graph (RG). For this reason, this paper proposes a novel recovery policy based on CT to recover all of the system's states. Making systems as maximally permissive as possible is extremely difficult, even if their policies can fix the deadlock problem in FMSs. The proposed technology is demonstrated with examples, particularly for classical S3PR Petri nets. Experimental data confirm that the algorithm established with PNs, particularly as specified by CTs, can provide optimal solutions for the dynamic model of various types of FMS.