J. N. Buxton and J. G. Laski, "Control and simulation language," Comput. J., vol. 5, no. 3, pp. 194--199, Oct. 1962.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... follows: P(defn; DEFNS 0 ) def = P(DEFNS) P(DEFNS 0 ) P(NEWP (P ) acts; Time) def = fsTime; fTime j hold(time) 2 actsg So the translation of a Demos program into SCCS is as follows: SIMSCCS (DEFNS) def = A[ DEFNS] dP(DEFNS) 6 Waits until The early British activity based languages [6, 7, 9, 13, 19] were wait until based. Waits until are handy for describing complicated conditions, but are hard to implement efficiently and even harder to reason about. 6.1 Translating wait until into CCS A simple example of the representation of a wait until instruction was presented in [1] Here we take ....

J. N. Buxton and J. G. Laski. Control and Simulation Language. Computer Journal, 5(3), 1962.

....domain Concurrency Workbench 1 (henceforth the CWB [13, 30] Since M and M are structurally the same, once M has been corrected, it is straightforward to rectify the actual model M. The most popular styles of programming simulation models have been the activity based approach of (E)CSL [9, 14, 15, 32, 41], the event based approach of GASP and early Simscript [34, 17] and the process based approach of GPSS, Simscript II.5 and Simula [35, 10, 2] However it is quite straightforward to translate between these styles [3, 25] Hence, without loss of generality, we concentrate upon the process based ....

J. N. Buxton and J. G. Laski. Control and Simulation Language. Computer Journal, 5(3), 1962. 18

....and process oriented implementation of the same model will produce exactly the same results. 4 The activity scanning conceptual framework. Another organizing principle for DES, which is naturally supportive of the fixed time TFM, is the activity scanning conceptual framework (CF) suggested by [5]. Most widely used within the United Kingdom, an activity scanning based simulation model is organized around conditions and actions (attribute value changes) that should be taken when the associated condition is satisfied. Together, a condition and its associated actions form an event which is ....

Buxton, J.N. and Laski, J.G. (1962). "Control and Simulation Language," The Computer Journal, 5, pp. 194-199.

....assigned. An escorting tug is needed for exiting the berth after unloading. Escort and unloading time distributions are specified as are the transit times for the tug to reach a ship. Estimations of tugboat utilization and ship in harbor time are the study objectives. The harbor model appears in [4, 29]. 3.2.4 MVS Computing System A model presented in [2] of a multiple virtual storage (MVS) computing system utilizing two central processing units (CPUs) is the largest and most complex of the examples. Users submit batch programs to the MVS by using the submit command on an interactive virtual ....

Buxton, J.N. and J.G. Laski (1963). "Control and Simulation Language," Computer Journal 5, pp. 194-199.

....An escorting tug is also needed for exiting the berth after unloading. Escort and unloading time distributions are specified as are the transit times for the tug to reach a ship. Estimations of tugboat utilization and ship in harbor time are the study objectives. The harbor model appears in [4, 32]. 10 3.2.4 MVS Computing System A model presented in [2] of a multiple virtual storage (MVS) computing system utilizing two central processing units (CPUs) is the largest and most complex of the examples. Users submit batch programs to the MVS by using the submit command in an interactive ....

Buxton, J. N. and J. G. Laski (1963). "Control and Simulation Language," Computer Journal 5, pp. 194-199.

....constructs was Monte Carlo simulations. Montecode [13] is an interpreted language for writing Monte Carlo simulations. Its constructs include random sampling from distributions, management of queues, building histograms and event to event scanning. CSL (Control and Simulation Language) [5] was designed for use in the field of complex logical problems. It uses set operations and specialised constructs, including iteration over the elements of a set and finding an element in a set which meets various criteria. CSL is compiled into FORTRAN, with a ratio of CSL to FORTRAN statements ....

....iteration over the elements of a set and finding an element in a set which meets various criteria. CSL is compiled into FORTRAN, with a ratio of CSL to FORTRAN statements of the order of 1 to 5. The ratio of time spent in writing similar programs in CSL and FORTRAN was also of the order 1 to 5 [5]. The users also reported that several problems which had not previously been tackled due to difficulty in formulation have now been formulated with little trouble. 2.5.2 The QED Word Processor QED is a powerful mouse based word processor which is implemented using the specially designed q ....

J. N. Buxton & J. G. Laski, "Control and Simulation Language," Comput. J. 5 (1962), 194--199.

....using Demos [BT93a] a simplified version of Demos [Bir79] with synchronisations restricted to resources and buffers. A formal treatment of full Demos is covered in a companion paper [TB95] The most popular styles of programming simulation models are the activity based approach of CSL [Bux62] and ECSL [Cle85] the event based approach of GASP [PK69] and Simscript [KVM68] and the process based approach of GPSS [Sch74] and Simula [BDMN79] It is quite straightforward to translate from the process based style to the activity and to the event based styles [Bir85,Mat74] Hence, without ....

....e.g. putR( space , 1) the call on putR not only increments the resource pool, but also unblocks any waiting entities whose request can be granted. Each unblocked entity leaves the resource queue and enters the event list behind its unblocker and at the same clock time. The activity diagram (see [Bir79,Bux62,Cle85,Pool91]) for this simple model is given in figure 3. Time is taken to flow downwards, tasks are depicted by rectangular boxes, resources by circles. The additional resource requirements for each task are represented by arrows leading into task boxes; arrows leading out of task boxes represent resources ....

J. N. Buxton and J. G. Laski, Control and Simulation Language, The Computer Journal, 5, 1962.

No context found.

J. N. Buxton and J. G. Laski, "Control and simulation language," Comput. J., vol. 5, no. 3, pp. 194--199, Oct. 1962.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC