Abstract

The PDEVS formalism is widely used for the description and analysis of discrete event systems. But PDEVS has some drawbacks in modeling Mealy behavior. A revised version (RPDEVS) has been invented to resolve them, but it has problems of its own, mainly because of its complicated simulator structure. The recently proposed NSA-DEVS scheme tries to unite the advantages of both formalisms by using infinitesimal time intervals.
To further substantiate this claim we describe an abstract simulator for NSA-DEVS, implement it in Matlab and simulate a simple queue-server system. This shows that NSA-DEVS combines the Mealy-like model description of RPDEVS with the simple simulator structure of PDEVS, making it a promising approach to implement an improved modeling and simulation system.