A priority queue plays an important role in stochastic discrete event simulations for as much as 40% of a simulation execution time is consumed by the pending event set management. This article describes a new form of tree-based priority queues which employs the demarcation procedure to systematically split a single tree-based priority queue into many smaller trees, each divided by a logical ti...

In discrete event simulation, very often the future event set is represented by a priority queue. The data structure used to implement the queue and the way operations are performed on it are often crucial to the execution time of a simulation. In this paper a new priority queue implementation strategy, the Lazy Queue, is presented. It is tailored to handle operations on the pending event set e...

The Kalman Filter (KF) is used to optimally estimate system states from the sequential noisy measurements of the outputs. On the other hand, real-time systems are often modeled with uncertainties and time-delays. Developing KF algorithms for such systems is an important problem to obtain optimal state estimates by utilizing the information on uncertainties and time-delays. First, designing of K...