Implementing the product automation formalism

  • Authors:
  • Frederick J. Portier

  • Affiliations:
  • Department of Mathematics, The University of North Carolina at Greensboro, Greensboro, NC

  • Venue:
  • WSC '87 Proceedings of the 19th conference on Winter simulation
  • Year:
  • 1987

Quantified Score

Hi-index 0.00

Visualization

Abstract

A formalism for discrete simulation is a set of conventions for the construction of discrete simulation models. In this paper we define the product automaton formalism. The formalism is defined as a mathematical object and is independent of any programming language. Implementing the formalism in a specific programming language entails associating the various components of the formalism with language constructs. We show how the formalism can be implemented in any procedural language. Furthermore, the implementation closely parallels the formalism in both structure and function. As an example, we present an implemenation in Modula-2. A novel feature of Modula-2 is used in this recursive implementation. The paper concludes with a brief discussion of a tool being developed that will provide support for modelling using this formalism.