Scalable diagnosability checking of event-driven systems

摘要: Diagnosability of systems is an essential property that determines how accurate any diagnostic reasoning can be on a system given sequence observations. Generally, in the literature dynamic event-driven systems, diagnosability analysis performed by algorithms consider as whole and their response either positive answer or counter example. In this paper, we present original framework for checking. The problem solved distributed way order to take into account nature realistic problems. As opposed all other approaches, our algorithm also provides exhaustive synthetic view reasons why not diagnosable. Finally, presented scalable practice: it approximate useful solution if computational resources are sufficient.