摘要
P-集合(packet set)是由内P-集合XF(internal packet set)与外P-集合XF(outer packet set)构成的集合对(XF,XF),利用P-集合得到P-推理(packet reasoning),P-推理是由内P-推理(internal packet reasoning)与外P-推理(outer packet reasoning)共同构成的.P-推理是一个动态推理,具有智能特征;把内P-推理应用于系统故障判断-恢复中,给出了内P-故障信息判定定理、最小粒度定理、粒度链定理、属性补充-信息删除定理、系统故障元判定定理,内P-推理信息辨识定理及推论,同时给出了系统故障内P-推理算法与它的N-S图,最后给出应用实例.
P-sets are set pair which are composed of internal P-set SFand outer P-set sF; or （SN, SF） are P-sets. P-reasoning is obtained by P-sets which is composed of internal P- reasoning and outer P-reasoning. P-reasoning is a dynamic reasoning, which has intelligent characteristic. Applied P-reasoning in system fault detection-recovery, this paper provided internal P-fault information detection theorem, minimum granulation degree theorem, gran- ulation degree chain theorem, attribute supplement-information delete theorem, system fault element decision theorem and internal P-reasoning information discover theorem and corollary, moreover provided system fault internal P-reasoning algorithm and its N-S diagram, finally provided an application example.
出处
《数学的实践与认识》
CSCD
北大核心
2013年第15期220-226,共7页
Mathematics in Practice and Theory
基金
河南高等学校青年骨干教师资助计划(2012GGJS-297)
驻马店市科技发展计划项目(11704)
关键词
内P-集合
内P-推理
内P-故障信息
算法
N-S图
internal P-set
internal P-reasoning
internal P-fault information
algorithm
N-Sdiagram
