Possibilistic timed safe Petri nets

The first goal of this work is to extend a model of timed safe Petri nets to allow the treatment of preference between transitions. In the proposed possibilistic timed safe Petri net, we attach a duration to each transition, which can be precise, imprecise, or fuzzy, accounting for the maximal amount of time in which that transition can be completed once fired, and we attach a possibility degree to each arc between a place and a transition, to account for the preference of this transition in relation to the other transitions going out of that place. The second goal of this work is to address the problem of the management of incomplete information in the proposed model, what makes it possible to order the most plausible marking at a given moment of time