Abstract
Abstract This paper deals with the problem of copredictability verification of discrete event systems (DES) modeled by automata in less restrictive scenarios, i.e., avoiding the assumptions on language liveness and absence of cycles of states connected by unobservable events only. We present necessary and sufficient conditions for a regular language to be copredictable, and adapt previous results on diagnosability verification to develop two new strategies to verify copredictability: the first one is based on a diagnoser-like automaton, and the second one by using verifiers.
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.
