Assistance for the design of a diagnosable component-based system

Diagnosability of component-based systems is a property that characterises the ability to diagnose fault events given a flow of observations. In this paper, we use model-based reasoning techniques and we propose a theoretical framework to analyse diagnosability in a decentralised way. We then introduce an algorithm that performs diagnosability analyses and provides useful information for the design of a diagnosable component-based system

Diagnosability Analysis of Distributed Discrete Event Systems

This paper addresses the diagnosability problem of distributed discrete event systems. Until now, the problem of diagnosability has always been solved by considering centralised approaches, monolithic systems. These approaches do not use the fact that real monitored systems are generally modelled in a distributed manner. In this paper, we propose a framework for the diagnosability analysis of such systems: we study the diagnosability of the system using the fact that it is based on a set of communicating components. In the case where the system is not diagnosable, we also want to provide more accurate information in order to better understand the causes

All from One, One for All, Failure Diagnosis of Discrete Event Systems using Representatives

Failure diagnosis in large and complex systems is a critical and challenging task. In the realm of model based diagnosis on discrete event systems, computing a failure diagnosis means computing the set of system behaviours that could explain observations. Depending on the diagnosed system, such behaviours can be numerous, so that a problem of representing them is induced. The paper discusses about this problem and presents a way of representing a diagnosis by the use of a partial order reduction technique

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 any sequence of observations. Generally, in the literature of dynamic event-driven systems, diagnosability analysis is perfo

Diagnostic décentralisé de systèmes à évènements discrets (application aux réseaux de télécommunications)

RENNES1-BU Sciences Philo (352382102) / SudocSudocFranceF

Efficient on-line failure identification for discrete-event systems

This chapter addresses the problem of diagnosing complex embedded discrete-event systems. Given a flow of observations from the system, the goal is to explain these observations by identifying possible failures. Approaches that efficiently compute the po

A formal framework for the decentralised diagnosis of large scale discrete event systems and its application to telecommunication networks

We address the problem of diagnosing large discrete event systems. Given a flow of observations from the system, the goal is to explain these observations on-line by identifying and localising possible failures and their consequences across the system. Model-based diagnosis approaches deal with this problem but, apart very recent proposals, either they require the computation of a global model of the system which is not possible with large discrete event systems, or they cannot perform on-line diagnosis. The contribution of this paper is the description and the implementation of a formal framework for the on-line decentralised diagnosis of such systems, framework which is based on the "divide and conquer" principle and does not require the global model computation. This paper finally describes the use of this framework in the monitoring of a real telecommunication network