Discrete-event simulation: Difference between revisions

Content deleted Content added
No edit summary
Tags: Visual edit Mobile edit Mobile web edit
OAbot (talk | contribs)
m Open access bot: doi added to citation with #oabot.
Line 6:
 
== Example ==
A common exercise in learning how to build discrete-event simulations is to model a [[Queueing theory|queue]], such as customers arriving at a bank to be served by a teller. In this example, the system entities are '''Customer-queue''' and '''Tellers'''. The system events are '''Customer-Arrival''' and '''Customer-Departure'''. (The event of '''Teller-Begins-Service''' can be part of the logic of the arrival and departure events.) The system states, which are changed by these events, are '''Number-of-Customers-in-the-Queue''' (an integer from 0 to n) and '''Teller-Status''' (busy or idle). The [[random variable]]s that need to be characterized to model this system [[stochastic]]ally are '''Customer-Interarrival-Time''' and '''Teller-Service-Time'''. An agent-based framework for performance modeling of an optimistic parallel discrete event simulator is another example for a discrete event simulation.<ref>{{cite journal |author1=Aditya Kurve |author2=Khashayar Kotobi |author3=George Kesidis |title=An agent-based framework for performance modeling of an optimistic parallel discrete event simulator | doi=10.1186/2194-3206-1-12 |volume=1 |journal=Complex Adaptive Systems Modeling |pages=12|year=2013 |doi-access=free }}</ref>
 
==Components==