Abstract
This paper studies observability in discrete event systems (DES), and introduces and analyzes the property of K-detectability. In particular, a given DES is strongly K-detectable if eventually (after a finite number of observations) all corresponding sets of possible states (current state estimates following any given sequence of observations) are guaranteed to have cardinality less than or equal to K, where K is a positive integer. Note that for K = 1, strong K-detectability reduces to the standard notion of strong detectability. The paper briefly discusses ways to verify K-detectability using the standard observer construction (with exponential complexity) and also proposes a new construction (called the K-detector) that can be used to verify K-detectability with polynomial complexity.
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.
