Supervision Patterns in Discrete Event Systems Diagnosis

Jéron, Thierry; Marchand, Hervé; Pinchinat, Sophie; Cordier, Marie-Odile

doi:10.1109/wodes.2006.1678440

Cited by 79 publications

(92 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Sticking to so-called centralized diagnosis problems, that is diagnosis problems with a single system and a single diagnoser, particular attention has been paid to the diagnosability property, as a cornerstone to establish the completeness of the diagnoser. Deciding the diagnosability of finite-state systems is easy, with polynomial time solutions [9,10,13]; notice that moreover, the bounded-latency property is an immediate corollary of diagnosability. On the other hand, to our knowledge, the diagnosability and the bounded-latency problems for infinite-state discrete-event systems were unexplored so far.…”

Section: Resultsmentioning

confidence: 99%

“…For finite-state systems, the theory is well understood and a number of effective solutions have been developed [13,10,9]. For infinite-state systems, however, we are not aware of any result.…”

Section: Pi N˚1904mentioning

confidence: 99%

“…Effective solutions in partial observation settings crucially relies on the closure under projection property of languages. Additionally, diagnosability is dually equivalent to the existence of an infinite path in an infinite-state model obtained as a product of structures [9]. Monadic second-order logic can be used to express this property, and its model-checking is decidable [12,6].…”

Section: Pi N˚1904mentioning

confidence: 99%

“…Bounded-latency systems are diagnosable, but the converse does not hold in general, unless the systems are finite-state [9]. …”

Section: Bounded Latencymentioning

confidence: 99%

See 3 more Smart Citations

Diagnosability of Pushdown Systems

Morvan

Pinchinat

2011

Hardware and Software: Verification and Testing

View full text Add to dashboard Cite

Diagnosis problems of discrete-event systems consist in detecting unobservable defects during system execution. For finite-state systems, the theory is well understood and a number of effective solutions have been developed. For infinite-state systems, however, there are only few results, mostly identifying classes where the problem is undecidable.We consider higher-order pushdown systems and investigate two basic variants of diagnosis problems: the diagnosability, which consists in deciding whether defects can be detected within a finite delay, and the bounded-latency problem, which consists in determining a bound for the delay of detecting defects.We establish that the diagnosability problem is decidable for arbitrary sub-classes of higher-order visibly pushdown systems provided unobservable events leave the stacks unchanged. For this case, we present an effective algorithm. Otherwise, we show that diagnosability becomes undecidable already for first-order visibly pushdown automata. Furthermore, we establish that the bounded-latency problem for higher-order pushdown systems is as hard as deciding finiteness of a higher-order pushdown language. This is in contrast with the case of finite-state systems where the problem reduces to diagnosability.Key-words: Pushdown systems, Visibly pushdown systems, Partial observation, Diagnosis. Diagnostic des Systèmesà PilesRésumé : Les problèmes de diagnostic des systèmesàévénements discrets examinent la détection de défauts inobservables au cours de l'exécution du système. Pour les systèmesà nombre d'états fini, la théorie est déjà bien maîtrisée, et de nombreuses solutions effectives ontété développées. En revanche, le cas des systèmesà nombre d'états infini n'a fait l'objet que de peu d'études, exhibant le plus souvent des problèmes indécidables. Nous considérons les systèmesà piles d'ordre supérieur etétudions deux problèmeś elémentaires de diagnostic : la diagnosticabilité, problème pour lequel il s'agit de décider si les défauts seront détectés en un temps fini, et le problème de la latence bornée, pour lequel on souhaite déterminer si le décalage temporel entre l'occurrence d'un défaut et sa détection est borné.Nousétablissons que la diagnosticabilité est décidable pour toute sous-classe de systèmes a piles d'ordre supérieur dès lors que que toutévénement inobservable ne modifie l'état des piles. Dans ce cas, nous présentons des algorithmes. Autrement, nous montrons que la diagnosticabilité est indécidable pour la sous-classe des systèmes dits "visibly pushdown", un classique de la littérature. En outre, nousétablissons que le problème de la latence bornée pour les systèmesà piles d'ordre supérieur est au moins aussi difficile que celui de décider la finitude des langagesà piles d'ordre supérieur. Ce dernier résultat est en opposition avec le cas des systèmesà nombre d'états fini pour lesquels le problème de la latence bornée se réduità celui de diagnosticabilité.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Pi N˚1904mentioning

confidence: 99%

Section: Pi N˚1904mentioning

confidence: 99%

“…Bounded-latency systems are diagnosable, but the converse does not hold in general, unless the systems are finite-state [9]. …”

Section: Bounded Latencymentioning

confidence: 99%

See 2 more Smart Citations

Diagnosability of Pushdown Systems

Morvan

Pinchinat

2011

Hardware and Software: Verification and Testing

View full text Add to dashboard Cite

show abstract

“…A system, described as a FSM, is diagnosable if for a given sequence of observable transitions, one cannot find two compatible runs of the system such that one that leads to a safe state, and the other to a faulty state. Jeron et al [10] describe a similar approach with enhanced fault models. Benveniste et al [2] propose Petri Nets based diagnosis techniques.…”

Section: Introductionmentioning

confidence: 99%

Event Correlation with Boxed Pomsets

Gazagnaire

Hélouët

2007

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. This paper proposes a diagnosis framework for distributed systems based on pomset languages. Diagnosis is performed by projecting these models on a collection of observable labels and then synchronization with an observation. This paper first proposes a new model called boxed pomset languages, which extends classical pomset-based languages as so called High-level Message Sequence Charts. It can describe infinite scenarios, and has good properties with respect to projections. We then give a solution for the event correlation problem (knowing whether two observed alarms are causally related) for pomset languages.

show abstract

Twin‐engined diagnosis of discrete‐event systems

Bertoglio

Lamperti

Zanella

et al. 2019

Engineering Reports

View full text Add to dashboard Cite

Diagnosis of discrete‐event systems (DESs) is computationally complex. This is why a variety of knowledge compilation techniques have been proposed, the most notable of them rely on a diagnoser. However, the construction of a diagnoser requires the generation of the whole system space, thereby making the approach impractical even for DESs of moderate size. To avoid total knowledge compilation while preserving efficiency, a twin‐engined diagnosis technique is proposed in this paper, which is inspired by the two operational modes of the human mind. If the symptom of the DES is part of the knowledge or experience of the diagnosis engine, then Engine 1 allows for efficient diagnosis. If, instead, the symptom is unknown, then Engine 2 comes into play, which is far less efficient than Engine 1. Still, the experience acquired by Engine 2 is then integrated into the symptom dictionary of the DES. This way, if the same diagnosis problem arises anew, then it will be solved by Engine 1 in linear time. The symptom dictionary can also be extended by specialized knowledge coming from scenarios, which are the most critical/probable behavioral patterns of the DES, which need to be diagnosed quickly.

show abstract

Supervision Patterns in Discrete Event Systems Diagnosis

Cited by 79 publications

References 16 publications

Diagnosability of Pushdown Systems

Diagnosability of Pushdown Systems

Event Correlation with Boxed Pomsets

Twin‐engined diagnosis of discrete‐event systems

Contact Info

Product

Resources

About