A strategy for Estimation in Timed Petri nets
Résumé
The aim of the paper is the estimation of sequences in Timed Petri nets. We propose a general strategy composed of two phases: The first phase considers the logical aspect only and suggests candidate count vectors where the second one checks the existence of a relevant time sequence for a Timed Petri net and generate a subspace of time sequences for a given candidate vector.