Abstract
This paper addresses the modular diagnosability verification of discrete event system (DES). We assume that the language generated by each automaton module can have deadlocks and that the common events among modules are observable. A new algorithm is developed based on the proposition of a necessary and sufficient condition for modular diagnosability, whose complexity is polynomial and is lower than that of other approaches in literature.
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.
