Paper Info
Title
Incremental Abstraction for Diagnosability Verification of Modular Systems
Abstract
In a diagnosability verifier with polynomial complexity, a non-diagnosable system generates uncertain loops. Such forbidden loops are in this paper transformed to forbidden states by simple detector automata. The forbidden state problem is trivially transformed to a nonblocking problem by considering all states except the forbidden ones as marked states. This transformation is combined with one of the most efficient abstractions for modular systems called conflict equivalence, where nonblocking properties are preserved. In the resulting abstraction, local events are hidden and more local events are achieved when subsystems are synchronized. This incremental abstraction is applied to a scalable production system, including parallel lines where buffers and machines in each line include some typical failures and feedback flows. For this modular system, the proposed diagnosability algorithm shows great results, where diagnosability of systems including millions of states is analyzed in less than a second.
Year
DOI
Venue
2019
10.1109/ETFA.2019.8869382
2019 24th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA)
Keywords
Field
DocType
Modular systems,diagnosability,verification,abstraction,nonblocking
Synchronization,Abstraction,Automaton,Theoretical computer science,Real-time computing,Parallel,Equivalence (measure theory),Engineering,Modular design,Control system,Scalability
Conference
ISSN
ISBN
Citations 
1946-0740
978-1-7281-0304-4
0
PageRank 
References 
Authors
0.34
14
2
Name
Order
Citations
PageRank
Mona Noori Hosseini1284.85
Bengt Lennartson2934118.87