A novel siphon-based divide-and-conquer(SbDaC)policy is presented in this paper for the synthesis of Petri net(PN)based liveness-enforcing supervisors(LES)for flexible manufacturing systems(FMS)prone to deadlocks or l...A novel siphon-based divide-and-conquer(SbDaC)policy is presented in this paper for the synthesis of Petri net(PN)based liveness-enforcing supervisors(LES)for flexible manufacturing systems(FMS)prone to deadlocks or livelocks.The proposed method takes an uncontrolled and bounded PN model(UPNM)of the FMS.Firstly,the reduced PNM(RPNM)is obtained from the UPNM by using PN reduction rules to reduce the computation burden.Then,the set of strict minimal siphons(SMSs)of the RPNM is computed.Next,the complementary set of SMSs is computed from the set of SMSs.By the union of these two sets,the superset of SMSs is computed.Finally,the set of subnets of the RPNM is obtained by applying the PN reduction rules to the superset of SMSs.All these subnets suffer from deadlocks.These subnets are then ordered from the smallest one to the largest one based on a criterion.To enforce liveness on these subnets,a set of control places(CPs)is computed starting from the smallest subnet to the largest one.Once all subnets are live,this process provides the LES,consisting of a set of CPs to be used for the UPNM.The live controlled PN model(CPNM)is constructed by merging the LES with the UPNM.The SbDaC policy is applicable to all classes of PNs related to FMS prone to deadlocks or livelocks.Several FMS examples are considered from the literature to highlight the applicability of the SbDaC policy.In particular,three examples are utilized to emphasize the importance,applicability and effectiveness of the SbDaC policy to realistic FMS with very large state spaces.展开更多
This paper addresses the verification of strong currentstate opacity with respect to real-time observations generated from a discrete-event system that is modeled with time labeled Petri nets. The standard current-sta...This paper addresses the verification of strong currentstate opacity with respect to real-time observations generated from a discrete-event system that is modeled with time labeled Petri nets. The standard current-state opacity cannot completely characterize higher-level security. To ensure the higher-level security requirements of a time-dependent system, we propose a strong version of opacity known as strong current-state opacity. For any path(state-event sequence with time information)π derived from a real-time observation that ends at a secret state, the strong current-state opacity of the real-time observation signifies that there is a non-secret path with the same real-time observation as π. We propose general and non-secret state class graphs, which characterize the general and non-secret states of time-dependent systems, respectively. To capture the observable behavior of non-secret states, a non-secret observer is proposed.Finally, we develop a structure called a real-time concurrent verifier to verify the strong current-state opacity of time labeled Petri nets. This approach is efficient since the real-time concurrent verifier can be constructed by solving a certain number of linear programming problems.展开更多
基金The authors extend their appreciation to King Saud University,Saudi Arabia for funding this work through the Ongoing Research Funding Program(ORF-2025-704),King Saud University,Riyadh,Saudi Arabia.
文摘A novel siphon-based divide-and-conquer(SbDaC)policy is presented in this paper for the synthesis of Petri net(PN)based liveness-enforcing supervisors(LES)for flexible manufacturing systems(FMS)prone to deadlocks or livelocks.The proposed method takes an uncontrolled and bounded PN model(UPNM)of the FMS.Firstly,the reduced PNM(RPNM)is obtained from the UPNM by using PN reduction rules to reduce the computation burden.Then,the set of strict minimal siphons(SMSs)of the RPNM is computed.Next,the complementary set of SMSs is computed from the set of SMSs.By the union of these two sets,the superset of SMSs is computed.Finally,the set of subnets of the RPNM is obtained by applying the PN reduction rules to the superset of SMSs.All these subnets suffer from deadlocks.These subnets are then ordered from the smallest one to the largest one based on a criterion.To enforce liveness on these subnets,a set of control places(CPs)is computed starting from the smallest subnet to the largest one.Once all subnets are live,this process provides the LES,consisting of a set of CPs to be used for the UPNM.The live controlled PN model(CPNM)is constructed by merging the LES with the UPNM.The SbDaC policy is applicable to all classes of PNs related to FMS prone to deadlocks or livelocks.Several FMS examples are considered from the literature to highlight the applicability of the SbDaC policy.In particular,three examples are utilized to emphasize the importance,applicability and effectiveness of the SbDaC policy to realistic FMS with very large state spaces.
基金supported by the Special Fund for Scientific and Technological Innovation Strategy of Guangdong Province(2022A0505030025)the Science and Technology Fund,FDCT,Macao SAR(0064/2021/A2)
文摘This paper addresses the verification of strong currentstate opacity with respect to real-time observations generated from a discrete-event system that is modeled with time labeled Petri nets. The standard current-state opacity cannot completely characterize higher-level security. To ensure the higher-level security requirements of a time-dependent system, we propose a strong version of opacity known as strong current-state opacity. For any path(state-event sequence with time information)π derived from a real-time observation that ends at a secret state, the strong current-state opacity of the real-time observation signifies that there is a non-secret path with the same real-time observation as π. We propose general and non-secret state class graphs, which characterize the general and non-secret states of time-dependent systems, respectively. To capture the observable behavior of non-secret states, a non-secret observer is proposed.Finally, we develop a structure called a real-time concurrent verifier to verify the strong current-state opacity of time labeled Petri nets. This approach is efficient since the real-time concurrent verifier can be constructed by solving a certain number of linear programming problems.
