Perturbation tracking

The complexity of tracking perturbations in discrete event dynamic systems (DEDS) depends on the systems´ perturbation propagation mechanism and on the length of the event trace. Existing perturbation propagation algorithms assume that all unperturbed event times are observed and that all perturbed times are required. This paper concerns a complementary approach, termed perturbation tracking (PT), that accurately tracks perturbations in systems for which only a subset of event times are known. The authors apply PT to a class of partially-observed, timed Petri nets and show that for accurate tracking it is necessary and sufficient to know the token holding times between observations. The authors conclude with an example, motivated by a practical software monitoring problem, that illustrates how this information can be derived from structural and event trace analysis. Not surprisingly, the perturbation propagation rules of the authors´ PT algorithm are closely related to the existing algorithms when all event timings are observed