1/39
Vocabulary practice flashcards covering fundamental concepts in computer simulation and modeling, including discrete-event architectures, random number generation techniques, queueing system metrics, and model verification/validation methodologies.
System Detailing (Specification)
The formal identification and mutual agreement of system factors, states, and parameters based on the study's research goals, established between the system manager and the model project authors.
Simulation Model Classification Dimensions
The three primary classification aspects of simulation models: static versus dynamic, deterministic versus stochastic, and continuous versus discrete.
Synchronization Routine (Clock Routine)
A simulation subprogram that searches the event list for the next scheduled event and advances the simulation clock to the occurrence time of that event.
Event Handler Routine
A simulation subprogram responsible for updating the state variables of the system and modifying system and statistical counters when a specific event occurs.
Initialization Routine
A simulation subprogram that resets and prepares the simulation model by placing state variables and clocks into their initial, zero baseline state at time zero.
Library Routine
A collection of utility subprograms used to generate pseudo-random numbers and random variates from specific probability distributions for use in the simulation model.
Report Generator
A subprogram that computes estimates of performance measures from statistical counters and formats the final output summary report upon model termination.
Statistical Counters
Simulation variables designated to collect, accumulate, and store numerical data regarding performance characteristics throughout the execution of a model run.
Event List
A scheduled data structure that maintains the impending event notices, specifically recording the future execution time for each scheduled type of event.
Simulation Clock (MDS)
A system variable tracking current model time that advances instantaneously from the current moment to the execution epoch of the next imminent event.
Next-Event Time Progression
A time advancement approach in simulation where the clock jumps directly from one event time to the next nearest event time, bypassing inactive periods.
Fixed-Increment Time Progression
A simulation timing approach where the model time advances in uniform, discrete time intervals of constant duration Δt.
Linear Congruential Generator (LCG)
A pseudo-random number generator defined by the recurrence zi=(a⋅zi−1+c)(modm), subject to parameter constraints m>0, 0≤a<m, 0≤c<m, and seed 0≤z0<m.
Multiplicative Congruential Generator
A special class of linear congruential generator in which the additive constant c=0, restricting the maximum possible period to at most m−1.
Mixed (Shifted) Congruential Generator
A linear congruential generator where the additive constant c=0, enabling the generation of a full sequence period equal to the modulus m.
Full Period in an LCG
The condition achieved when a linear congruential generator cycles through all m possible states before repeating any value.
Tausworthe Generator
A linear feedback shift-register random bit generator defined by the recurrence bi=(bi−r+bi−q)(mod2), frequently utilized in cryptographic applications.
L'Ecuyer Combined Generator
A random number generation algorithm that combines independent congruential generators to achieve vastly increased period length, formulated as zi=(z1,i+z2,i)(modm).
Marsa and Roberts Multiplicative Generator
A multiplicative generator utilizing a modulus of the form m=2b−q (such as m=231−1 with multiplier a=16807), enabling fast division via bit shifts.
Blum-Blum-Shub Generator
A cryptographically secure pseudorandom bit generator widely deployed in cryptographic security protocols.
Inverse Transform Method
An algorithm that converts a standard uniform variate g∼U(0,1) into a variate of an arbitrary continuous distribution using the inverse cumulative distribution function, such as X=−λ1ln(1−g) for exponential distributions.
Convolution Method
A variate generation technique where a target random variable is generated by taking the sum of m independent random variables: X=Y1+Y2+⋯+Ym.
Composition Method
A random variate generation algorithm applied when a target cumulative distribution function is represented as a weighted convex combination of sub-distributions: F(x)=∑j=1Npj⋅Fj(x).
Box-Muller Polar Method
An exact algorithm for producing two independent standard normal random variates via X1=h1Y and X2=h2Y, where Y=s−2ln(s), s=h12+h22, and hi=2gi−1.
Central Limit Theorem Normal Approximation
An approximate method for generating standard normal random variables using the summation of 12 uniform variates: x=∑i=112gi−6, where gi∼U(0,1).
Poisson Variate Generation Formula
The algorithm for generating a discrete Poisson random variate with parameter λ: X=min{i:∏j=1igj<e−λ}, where gj∼U(0,1).
Poisson Process Interarrival Time Formula
The recursive expression generating event arrival times in a stationary Poisson process: ti=ti−1−λ1ln(1−g), leveraging exponentially distributed interarrival gaps.
Serial Test for Uniformity
A statistical test verifying the multidimensional uniformity of generated random sequences by computing χ2(d)=nkd∑j1=1k⋯∑jd=1kfj1…jd2−n.
Runs Up Test
A statistical test for independence of pseudorandom numbers based on the frequency of increasing sequences, evaluated via the statistic R=n1∑i=16∑j=16aij(ri−n⋅bi)(rj−n⋅bj).
Discrete-Event Simulation (DES)
A simulation modeling paradigm where the system state changes instantaneously at separated, discrete points in time upon the occurrence of individual events.
Single-Server Queueing System (M/M/1)
A standard discrete-event queueing model consisting of one service node where both customer interarrival intervals and service durations follow exponential distributions.
Queue Waiting Time Dependence
The property that sequential customer queue delays (D1,D2,…,Dn) in an M/M/1 system constitute dependent, autocorrelated random variables rather than independent observations.
Expected Average Delay in Queue (d^(n))
An M/M/1 queue performance measure estimating average waiting time before service: d^(n)=n1∑i=1nDi.
Time-Average Number in Queue (q^(n))
An M/M/1 system metric tracking the time-integrated queue length, estimated as q^(n)=T(n)1∫0T(n)Q(t)dt or discretely as q^(n)=T(n)1∑i=0∞i⋅Ti(n).
Server Utilization Factor (u^(n))
The estimated proportion of total simulation time that a server remains occupied, given by u^(n)=T(n)1∫0T(n)B(t)dt, where B(t)∈{0,1}.
Model Verification
The rigorous process of determining whether the conceptual simulation model has been correctly and accurately transformed into an executable computer program.
Model Validation
The evaluative process of establishing whether the simulation model represents an adequately accurate depiction of the actual real-world system under study.
Model Credibility
The formal trust and acceptance of model accuracy and correctness by system managers and decision-makers, leading to the actual practical utilization of the model's outputs.
VV&A (Verification, Validation, and Accreditation)
A formal three-tier assurance standard, adopted by institutions such as the U.S. Department of Defense, used to certify simulation models for mission-critical operations.
Universal vs. Domain-Oriented Simulation Packages
The two primary classifications of simulation software packages: general-purpose languages/libraries suitable across disciplines versus application-specific environments tailored to particular domains.