Consistency´s checking of chronicles´ set using Time Petri Nets

In DES, there are two basic approaches to diagnosis: the first approach is the diagnosers [1] and the second approach is the chronicle [2]. The first approach has limitations including the issue of combinatorial explosion. On the other side, it offers tools to study the diagnosability of the models constructed. The chronicles are easier to write but pose the problem of the guarantee of the completeness and especially the consistency of a given base. The objective of this work is to propose a method to verify the consistency of a set of chronicles from a rewritten form of T-Time Petri Nets (TPN).