Decentralized Diagnosis for Nonfailures of Discrete Event Systems Using Inference-Based Ambiguity Management

S. Takai, R. Kumar
{"title":"Decentralized Diagnosis for Nonfailures of Discrete Event Systems Using Inference-Based Ambiguity Management","authors":"S. Takai, R. Kumar","doi":"10.1109/WODES.2006.1678437","DOIUrl":null,"url":null,"abstract":"The task of decentralized decision-making involves interaction of a set of local decision-makers, each of which operates under limited sensing capabilities and is thus subjected to ambiguity during the process of decision-making. In a prior work (Kumar and Takai, 2005) we made an observation that such ambiguities are of differing gradations and presented a framework for inferencing over various local control decisions of varying ambiguity levels to arrive at a global control decision. A similar inferencing-based framework for the management of ambiguities in the decentralized diagnosis of failures was reported in Kumar and Takai (2006). The present paper extends this to the decentralized diagnosis of nonfailures which requires that any ambiguity about the non-occurrence of a failure be resolved within a uniformly bounded delay. As shown in this paper, the decentralized diagnosability for failures does not imply that for nonfailures, and vice-versa. So a different formulation is needed. In order to characterize the class of systems for which the ambiguity about the non-occurrence of a failure can be resolved within a uniformly bounded delay, we introduce the notion of n-inference diagnosability for nonfailures (also called n-inference NF-diagnosability), where the index n represents the maximum ambiguity level of any winning local decision. We present an algorithm for the verification of n-inference NF-diagnosability, and also establish various properties of it","PeriodicalId":285315,"journal":{"name":"2006 8th International Workshop on Discrete Event Systems","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 8th International Workshop on Discrete Event Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WODES.2006.1678437","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

The task of decentralized decision-making involves interaction of a set of local decision-makers, each of which operates under limited sensing capabilities and is thus subjected to ambiguity during the process of decision-making. In a prior work (Kumar and Takai, 2005) we made an observation that such ambiguities are of differing gradations and presented a framework for inferencing over various local control decisions of varying ambiguity levels to arrive at a global control decision. A similar inferencing-based framework for the management of ambiguities in the decentralized diagnosis of failures was reported in Kumar and Takai (2006). The present paper extends this to the decentralized diagnosis of nonfailures which requires that any ambiguity about the non-occurrence of a failure be resolved within a uniformly bounded delay. As shown in this paper, the decentralized diagnosability for failures does not imply that for nonfailures, and vice-versa. So a different formulation is needed. In order to characterize the class of systems for which the ambiguity about the non-occurrence of a failure can be resolved within a uniformly bounded delay, we introduce the notion of n-inference diagnosability for nonfailures (also called n-inference NF-diagnosability), where the index n represents the maximum ambiguity level of any winning local decision. We present an algorithm for the verification of n-inference NF-diagnosability, and also establish various properties of it
基于推理模糊管理的离散事件系统非故障分散诊断
分散决策的任务涉及一组地方决策者之间的相互作用,每一个决策者都在有限的感知能力下运作,因此在决策过程中会产生歧义。在之前的工作(Kumar和Takai, 2005)中,我们观察到这种模糊性具有不同的等级,并提出了一个框架,用于推断不同模糊性水平的各种局部控制决策,以达到全局控制决策。Kumar和Takai(2006)报告了一个类似的基于推理的框架,用于管理分散故障诊断中的模糊性。本文将此推广到非故障的分散诊断,该诊断要求在一致有界延迟内解决关于不发生故障的任何模糊性。如本文所示,故障的分散可诊断性并不意味着非故障的可诊断性,反之亦然。所以需要一个不同的公式。为了描述不发生故障的模糊性可以在一致有界延迟内解决的系统类别,我们引入了非故障的n-推理可诊断性(也称为n-推理nf -可诊断性)的概念,其中指标n表示任何获胜的局部决策的最大模糊程度。提出了一种验证n推理nf可诊断性的算法,并建立了n推理nf可诊断性的各种性质
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信