Article,
Analysis of discrete event systems by simulation of timed Petri net models
Mathematics and Computers in Simulation, 61 (1): 53--59 (Nov 1, 2002)
DOI: 10.1016/s0378-4754(02)00137-4
Abstract
In the design and analysis of discrete event dynamic systems, the validation of their models is often addressed via simulation; this allows to analyse both the transient and the steady state behaviour of the modelled system. This article deals with simulation of timed Petri net (TPN)-based models; we present efficient algorithms for the execution of TPNs; the deterministic case is addressed for both place and transition TPNs. The proposed algorithms cope with bounded generalised TPN allowing re-entrant firing of transitions.
