We consider here the time Workflow nets [11], [17] with an arbitrary large number, denoted ? of tokens in their source places and investigate the verification of their soundness. We first revisit the notion of (strong) soundness in the context of permanent and concurrent evolutions of process instances. Then, we show how to verify (strong) ?-soundness of time workflow nets, using a forward reachability analysis.
['Hanifa Boucheneb', 'Kamel Barkaoui']
Strongly Generalized Soundness of Time Workflow Nets