Study of the diagnosability of automated production systems based on functional graphs

Authors:
Abdoul K. A. Toguyéni;Etienne Craye;Larbi Sekhri
Affiliations:
Laboratoire d'Automatique, Génie Informatique et Signal (LAGIS), Ecole Centrale de Lille, Villeneuve d'Ascq Cedex, France;Laboratoire d'Automatique, Génie Informatique et Signal (LAGIS), Ecole Centrale de Lille, Villeneuve d'Ascq Cedex, France;Department of Computer Science, University of Oran, Oran, Algeria
Venue:
Mathematics and Computers in Simulation - Special issue: Computational engineering in systems applications (CESA 2003)
Year:
2006

Citing 10
Cited 0

An assumption-based TMS

Artificial Intelligence
Specification methodology: an integrated relational approach

Software—Practice & Experience
A theory of diagnosis from first principles

Artificial Intelligence
Diagnosing multiple faults

Artificial Intelligence
Characterizing diagnoses and systems

Artificial Intelligence
Building problem solvers

Building problem solvers
A logical notion of conditional independence: properties and applications

Artificial Intelligence - Special issue on relevance
Toward an implementation of recovery procedures for flexible manufacturing systems supervision

Computers in Industry
Model-based diagnosis using structured system descriptions

Journal of Artificial Intelligence Research
Model-based diagnosis using causal networks

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

Functional graphs are a convenient representation that we have introduced to model automated production systems. They are useful for the monitoring and the supervision of manufacturing processes or other industrial processes, such as chemical processes. An approach based on relational theory and graph theory is presented in this paper. This approach allows to characterize formally structural properties of a functional graph and to map it into a set of relations translating all the complete paths existing in the initial graph. Two kinds of functional graphs are analyzed and algorithms exploiting their structures are presented. We introduce the concept of diagnosability as a system property that reflects the possibility to observe the behavior of a system with respect to faults. The diagnosability is defined and analyzed by means of computable states and mathematical relations. Propositions explaining causality relations between functions of a functional graph are given.