Abstract
In this paper we provide an approach to on-line diagnosis of discrete event systems based on labeled Petri nets. The proposed procedure is based on our previous results on unlabeled Petri nets and allows us to also consider events that are undistinguishable, namely events that produce an output signal that is observable, but that is common to other events. Our approach is based on the notion of basis markings and j-vectors and it is shown that, in the case of bounded Petri nets, the most burdensome part of the procedure may be moved off-line, computing a particular graph that we call Basis Reachability Graph.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.