Simulation Sequences for Discrete-Time Systems with Interactive Processes
Abstract
One problem encountered in the use of a digital computer for the purpose of simulation is the ordering of simultaneous events. This ordering is relative to the accuracy of the simulation if interaction between simultaneous events occurs. In this thesis the problem of constructing an ordering of behavior algorithms, called a simulation sequence, is discussed. This problem is modeled by directed graphs. An output dependency relation and an algorithm dependency relation are defined. The maximal connected subset partition of the algorithm relation graph is shown to partition the simulation sequence construction problem. An algorithm splitting technique and a selective search routine are presented These techniques are combined in a general method for constructing simulation sequences.
Document Details
- Document Type
- Technical Report
- Publication Date
- Mar 01, 1971
- Accession Number
- AD0732299
Entities
People
- Dieter J. H. Knollman
Organizations
- New York University