Abstract
In this paper, in discrete-event systems modeled by labeled finite-state automata (LFSAs), we show new thinking on the tools of detector and concurrent composition and derive two new algorithms for verifying strong periodic detectability (SPD) without any assumption that run in ; we also reconsider the tool of observer and derive a new algorithm for verifying strong periodic D-detectability (SPDD) without any assumption that runs in . These results strengthen the upper bound on verifying SPD and the upper bound on verifying SPDD for deadlock-free and divergence-free LFSAs in the literature. In our algorithms, the two assumptions are removed by verifying the negations of these properties.
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.
