Diagnosability under Weak Fairness

Vasileios Germanos (1) , Stefan Haar (2, 3) , Victor Khomenko (1) , Stefan Schwoon (3, 2)

1 Newcastle University [Newcastle]
2 MEXICO - Modeling and Exploitation of Interaction and Concurrency
3 LSV - Laboratoire Spécification et Vérification [Cachan]

In partially observed Petri nets, diagnosis is the task of detecting whether the given sequence of observed labels indicates that some unobservable fault has occurred. Diagnosability is an associated property of the Petri net, stating that in any possible execution, an occurrence of a fault can eventually be diagnosed. In this article, we consider diagnosability under the weak fairness (WF) assumption, which intuitively states that no transition from a given set can stay enabled forever it must eventually either fire or be disabled. We show that a previous approach to WF-diagnosability in the literature has a major flaw and present a corrected notion. Moreover, we present an efficient method for verifying WF-diagnosability based on a reduction to LTL-X model checking. An important advantage of this method is that the LTL-X formula is fixed-in particular, the WF assumption does not have to be expressed as a part of it (which would make the formula length proportional to the size of the specification), but rather the ability of existing model checkers to handle weak fairness directly is exploited.

Domaines: Théorie et langage formel [cs.FL]

Vasileios Germanos, Stefan Haar, Victor Khomenko, Stefan Schwoon. Diagnosability under Weak Fairness. ACM Transactions on Embedded Computing Systems (TECS), 2015, 14 (4), ⟨10.1145/2832910⟩. ⟨hal-01242989⟩