Constraint propagation algorithms for temporal reasoning: a revised report
Readings in qualitative reasoning about physical systems
Proceedings of the first international conference on Principles of knowledge representation and reasoning
Exact and approximate reasoning about qualitative temporal relations
Exact and approximate reasoning about qualitative temporal relations
Journal of the ACM (JACM)
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Modeling and simulating breakdown situations in telecommunication networks
IEA/AIE '99 Proceedings of the 12th international conference on Industrial and engineering applications of artificial intelligence and expert systems: multiple approaches to intelligent systems
ICATPN '97 Proceedings of the 18th International Conference on Application and Theory of Petri Nets
Improving the accuracy of diagnostics provided by fault dictionaries
VTS '96 Proceedings of the 14th IEEE VLSI Test Symposium
High speed and robust event correlation
IEEE Communications Magazine
| Hi-index | 0.00 |
To study the consequences of fault situations in telecommunication management networks (TMN), we have proposed a model-based diagnosis approach based on the CSP paradigm. First the TMN is modeled, then a set of breakdown situations is simulated in order to build a fault-training base. Finally, a rule-based system is generated and used to detect faults in the real system. In this work, we are interested in the simulation process. The fault simulation comes down to the propagation in the network, of the information emitted by the breakdown components. To take into account the inaccuracies of the transmissions in the network and the times of events processing, we represent temporal knowledge by time intervals. The components are modeled by extended transducers. Consequently, the behavior of the components is sensitive to the order of happened events that have occurred. To reason about these behaviors, a CSP formalism is studied. The main aim is not to compute a possible behavior of a component but to compute all the behaviors making it possible to build a faults-training database. Some polynomial algorithms are proposed to computes solutions and to update temporal constraints.