A theory for discrete simulations: an application to major railway systems.
A theory for discrete simulations: an application to major railway systems.
A comparison of programming theories and languages for discrete simulation.
A comparison of programming theories and languages for discrete simulation.
Implementing the product automation formalism
WSC '87 Proceedings of the 19th conference on Winter simulation
Computer Science And Graduate Education In Applied Mathematics
ACM '78 Proceedings of the 1978 annual conference
| Hi-index | 0.00 |
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.