Faster simulation of Timed Petri Nets via distributed simulation

In an earlier work, we presented can approach towards the distributed simulation of Timed Petri Nets. This approach is based on some major changes to Chandy and Misra's null message based scheme. These changes were required because the well known. distributed simulation schemes for discrete event systems do not directly apply to Timed Petri Nets due to non-autonomous nature of place nodes in these systems. Moreover, our scheme incorporated several ideas to increase the degree of concurrency and to reduce the number of overhead messages in distributed simulation. In this paper, we provide several algorithmic details to implement the above approach. The specific model of Timed Petri Nets that we assume here was also presented by us in the same earlier work.