Abstract
The paper addresses the problem of the on-line identification of Petri nets (PNs) modeling discrete event systems (DESs) that exhibit unobservable events. The identifier monitors the DES events and the corresponding available place markings. Assuming that the observable transition set, the place set and the corresponding PN structure are known, at each event occurrence an identification algorithm defines and solves some integer linear programming problems. We prove that the complete PN system describing both the observable and unobservable DES behavior is recursively identified. An example shows an application of the proposed technique.
Sign-in/Register to access full text options 
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.
