Timed Petri nets are a special form of Petri n ets and are called E-nets, or evaluation nets. In contrast to conventional Petri nets, they take time-related aspects into account when switching transitions (transitions), thus enabling their use in simulation
. In the context of timed Petri nets, they are also referred to as higher-level nets. The examination of real systems has shown that original Petri nets can neither be used to represent the times for the processing of processes
nor can data-dependent decisions be made.These limitations, while abandoning mathematical treatability, are removed by the introduction of the so-calledevaluation
nets (E-nets), thus making it possible to model and simulate complex systems.An evaluation net model consists of two main parts
- the evaluation network itself, which describes the functional properties of the system to be modeled, and
- a descriptive part for the formal description of the procedural properties of transitions.
- the tokens, which represent the moving model objects with their specific properties (token attributes),
- the locations, in each of which at most one marker can be located.
- and the transitions, which represent the processes through which the tokens - the model objects - undergo changes in their properties and in relation to their directions in the network.
A location is used to localize markers and as a connecting element between transitions. A place can contain at most one mark; thus, evaluation networks are safe by definition. A place is always connected in "forward-direction" via a directed edge with that transition, to which this entry-place is.
A transition is described by:
- the corresponding graphic symbol to represent the logic of the marker transport when switching the transition
- a process part that describes the change of the marker attributes when switching the transition
- and a process time that describes the time required to execute the model activity.
A transition becomes active, if its type-specific as well as with the conflict transitions its procedural switching condition (decision rule) is fulfilled.
When this condition occurs, the process time assigned to the transition is determined and started. After the process time has elapsed, the transition switches. In this process, the tokens are moved from the pre-positions to the post-positions according to the switching rule of the respective transition type and the token attributes are changed according to the rules defined in the process part. In case of conflict transitions, the transport of the tokens is influenced in its direction according to the determination found by evaluating the decision rule.