2019/03/21 by Hao Lan, Yin Tong, Lan, Hao +5
Business, Management and Accounting · Computer Science · #Business Process Modeling and Analysis #FOS: Electrical engineering #Formal Methods in Verification #Petri Nets in System Modeling #Systems and Control (eess.SY) #electronic engineering #information engineering
paper · pdf · doi:10.48550/arxiv.1903.09298
openalex publication_date 2019/03/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Detectability describes the property of a system whose current and the subsequent states can be uniquely determined after a finite number of observations. In this paper, we developed a novel approach to verifying strong detectability and periodically strong detectability of bounded labeled Petri nets. Our approach is based on the analysis of the basis reachability graph of a special Petri net, called Verifier Net, that is built from the Petri net model of the given system. Without computing the whole reachability space and without enumerating all the markings, the proposed approaches are more efficient.