A conservative parallel simulation algorithm for entity-oriented modeling

Conservative parallel simulation protocols are such that each logical process (LP) in the simulation execute events only when it is certain that there will not be any time-order causality violation. In these conservative protocols, time-bound information for an LP is computed from the other LPs. We propose a variant form of conservative parallel simulation protocol in which the time-bound for an LP is computed from the existing events in the system. In a conservative protocol such as the Chandy-Misra-Bryant (CMB) protocol, it can be difficult for LP/sub i/ to guarantee different time-bounds to its next LPs. The time-bounds to some LPs may be more restrictive than necessary. If the time-bounds are provided by the entities (events) going through the system (as in our proposed algorithm), an event E at LP/sub i/ can independently supply different time-bounds only to those LPs which may receive events generated by E. We describe the algorithm, outline a proof of its correctness and discuss its possible strengths and weaknesses.