Multiple enabledness of transitions in Petri nets with time

This paper discusses and formalises the benefits of using multiple enabled transitions for extensions of Petri nets having quantitative notions of time. It also points out that what could be thought as a straightforward extension actually implies some subtle underlying semantic choices. As an example, a complete semantics for Merlin's (1974) time Petri nets is defined, based on the threshold notion.