It appears you don't have support to open PDFs in this web browser. To view this file, Open with your PDF reader
Abstract
The time-line in Discrete Event Simulation (DES) is a sequence of events defined in a numerable subset of R+. When it comes from an experimental measurement, the timing of these events has a limited precision. This precision is usually well-known and documented for each instruments and procedures used for collecting experimental datas. Therefore, these instruments and procedures produce measurement results expressed using values each associated with an uncertainty quantification, given by uncertainty intervals. Tools have been developed in Continuous Systems modeling for deriving the uncertainty intervals of the final results corresponding to the propagation of the uncertainty intervals being evaluated. These tools cannot be used in DES as they are defined, and no alternative tools that would apply to DES have been developed yet. In this paper, we propose simulation algorithms, based on the Discrete Event System Specification (DEVS) formalism, that can be used to simulate and obtain every possible output and state trajectories of simulations that receive input values with uncertainty quantification. Then, we present a subclass of DEVS models, called Finite Forkable DEVS (FF-DEVS), that can be simulated by the proposed algorithms. This subclass ensures that the simulation is forking only a finite number of processes for each simulation step. Finally, we discuss the simulation of a traffic light model and show the trajectories obtained when it is subject to input uncertainty.
You have requested "on-the-fly" machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Show full disclaimer
Neither ProQuest nor its licensors make any representations or warranties with respect to the translations. The translations are automatically generated "AS IS" and "AS AVAILABLE" and are not retained in our systems. PROQUEST AND ITS LICENSORS SPECIFICALLY DISCLAIM ANY AND ALL EXPRESS OR IMPLIED WARRANTIES, INCLUDING WITHOUT LIMITATION, ANY WARRANTIES FOR AVAILABILITY, ACCURACY, TIMELINESS, COMPLETENESS, NON-INFRINGMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Your use of the translations is subject to all use restrictions contained in your Electronic Products License Agreement and by using the translation functionality you agree to forgo any and all claims against ProQuest or its licensors for your use of the translation functionality and any output derived there from. Hide full disclaimer