Abstract
Detectability describes the property of a system to uniquely determine, after a finite number of observations, the current and the subsequent states. In this paper, we extend detectability to C-detectability that only requires that a given set of crucial states can be distinguished from other states. We define four types of C-detectability in the framework of labeled Petri nets: strong C-detectability, weak C-detectability, periodically strong C-detectability, and periodically weak C-detectability. Moreover, we propose efficient approaches to verify such properties in the case of bounded labeled Petri net systems. The proposed approaches use the notion of basis marking and thus do not require an exhaustive enumeration of the reachability space.
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.
