An algorithm for computing the diagnoses with minimal cardinality in a distributed system
2008 (English)In: Engineering applications of artificial intelligence, ISSN 0952-1976, Vol. 21, no 2, 269-276 p.Article in journal (Refereed) Published
In fault diagnosis, the set of minimal diagnoses is commonly calculated. However, due to for example limited computation resources, the search for the set of minimal diagnoses is in some applications focused on to the smaller set of diagnoses with minimal cardinality. The key contribution in this paper is an algorithm that calculates the diagnoses with minimal cardinality in a distributed system. The algorithm is constructed such that the computationally intensive tasks are distributed to the different units in the distributed system, and thereby reduces the need for a powerful central diagnostic unit. © 2007 Elsevier Ltd. All rights reserved.
Place, publisher, year, edition, pages
2008. Vol. 21, no 2, 269-276 p.
Engineering and Technology
IdentifiersURN: urn:nbn:se:liu:diva-39487DOI: 10.1016/j.engappai.2007.03.006Local ID: 49026OAI: oai:DiVA.org:liu-39487DiVA: diva2:260336