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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
