Year-end Sale % OFF 
Abstract
Deciding how to prevent discrete event systems (DESs) from reaching forbidden states is an important problem in the field of DES supervisory control. For DESs with uncontrollable events, linear constraint transformation becomes a popular technique for solving the forbidden state problem when Petri nets are used as a modeling tool and control specifications are given in the form of linear constraints. This paper proposes a novel linear constraint transformation approach that is applicable to PT-ordinary Petri nets with uncontrollable subnets being forward-concurrent-free. For such nets, a linear constraint can be transformed into an optimal transformed one (i.e., a linear constraint that exactly characterizes the admissible marking set) by using the proposed approach, which is computationally shown to be of polynomial complexity with respect to the net size. An example is presented to illustrate the developed technique.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
