A programming theory for discrete simulation
Robert E. Haymond · NCSU Libraries Repository (North Carolina State University Libraries) · 1978
Discrete systems are abstracted as Cartesian products of automata operating on a data structure. These abstract systems are then modeled as intuitive automata with natural (internal) updates and unnatural (external) updates. Formal programs which perform these functions as well as necessary information flow between subsystems are presented. A collection of examples illustrate the theory.