Discrete event simulation of stochastic and deterministic sequential machine models

Authors:
Melvin M. Cutler
Affiliations:
-
Venue:
WSC '80 Proceedings of the 12th conference on Winter simulation
Year:
1980

Citing 3
Cited 1

Theory of Modelling and Simulation

Theory of Modelling and Simulation
Ergodic machines--probabilistic and approximate homomorphic simplifications.

Ergodic machines--probabilistic and approximate homomorphic simplifications.
Analysis and simplifications of discrete event systems and jackson queueing networks

Analysis and simplifications of discrete event systems and jackson queueing networks

A Formal Framework for Stochastic Discrete Event System Specification Modeling and Simulation

Simulation

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents and proves the correctness of novel techniques for the mathematical verification of simulation models against sequential machine specifications. The main idea is to say that a discrete event simulation program simulates a given sequential machine specification if and only if there exists a certain type of mapping from it to the specification. It is first shown that discrete event specifications can be realized by using the traditional formalisms of discrete time systems. Then the two main facilitating results are given. A discrete event simulation of a discrete deterministic system is shown to be a formal object whose fidelity to the system can be proved. A discrete event simulation of a discrete stochastic system is shown to be a formal object whose statistical fidelity to the system can be proved.