Abstract | ||
---|---|---|
This paper deals with the problem of enforcing modular diagnosability for discrete-event systems that don't satisfy this property by their natural modularity. We introduce an approach to achieve this property combining existing modules into new virtual modules. An underlining mathematical problem is to find a partition of a set, such that the partition satisfies the required property. The time complexity of such problem is very high. To overcome it, the paper introduces a structural analysis of the system's modules. In the analysis we focus on the case when the modules participate in diagnosis with their observations, rather then the case when indistinguishable observations are blocked due to concurrency. |
Year | Venue | Field |
---|---|---|
2013 | CoRR | Concurrency,Required property,Partition of a set,Modular design,Time complexity,Partition (number theory),Modularity,Mathematics,Distributed computing,Mathematical problem |
DocType | Volume | Citations |
Journal | abs/1311.2850 | 0 |
PageRank | References | Authors |
0.34 | 8 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Dmitry Myadzelets | 1 | 0 | 0.34 |
Andrea Paoli | 2 | 212 | 16.73 |