A “WAIT UNTIL” algorithm for general purpose simulation languages

ABSTRACT

Modern simulation languages such as SIMSCRIPT II and SIMULA 67 are very powerful general purpose languages which contain facilities to handle lists and to schedule events in simulated system time (imperative sequencing statements). These languages do not include some of the useful but more specialized features of previous languages (GPSS, CSL, SOL) especially interrogative sequencing statements such as “SEIZE (facility)” or “WAIT UNTIL (Boolean expression)”; however, the definition capability of the new languages is powerful enough to permit their extension to include the interrogative features. The addition of some features of GPSS to SIMULA 67 was presented at a previous SIMULATION CONFERENCE. The present paper extends that work by describing an efficient algorithm which adds the “WAIT UNTIL” procedure to SIMULA.

REFERENCES

• 1: Kiviat P.J., Villanueva R., Markowitz H.M., "The Simscript II programming language", Prentice Hall (1968).
• 2: Dahl O.J., Myhrang B., Nygaard K., "SIMULA 67 common base language", Publication S22, Norwegian Computing Centre, Forskningsveien 1B, Oslo 3 Norway.
• 3: Dahl O.J., "Discrete event simulation languages" pp. 349-395 in "Programming Languages", F. Genuys (Editor), Academic Press, London (1968).
• 4: Jean G. Vaucher, Simulation data structures using SIMULA 67, Proceedings of the 5th conference on Winter simulation, p.255-260, December 08-10, 1971, New York, NY [doi>10.1145/800294.811447]

INDEX TERMS

Primary Classification:
  I. Computing Methodologies
  I.6 SIMULATION AND MODELING
      I.6.2 Simulation Languages

Additional Classification:
  F. Theory of Computation
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
      F.2.2 Nonnumerical Algorithms and Problems
          Subjects: Sequencing and scheduling

  I. Computing Methodologies
  I.6 SIMULATION AND MODELING
      I.6.2 Simulation Languages

          Nouns: SIMULA

General Terms:
Algorithms, Languages, Theory