archive-org.com » ORG » C » CPNTOOLS.ORG

Total: 415

Choose link from "Titles, links and description words view":

Or switch to "Titles and links view".
  • Queue system queue delay << CPN Tools Homepage
    function This observation function invoked every time the above predicate function returns true i e it will be invoked every time the Start transition occurs fun obs bindelem let fun obsBindElem Server Start 1 jobs job proctime intTime AT job obsBindElem 1 in obsBindElem bindelem end Each time the Start transition occurs the observation function will return the amount of time that the job at the head of the queue spent in the queue The expression intTime AT job calculates the queue delay for the job that is bound to the variable job when the Start transition occurs The function intTime is described above The operator is a operator for record color sets and it is used here to access the value of the AT field for the record that is bound to the variable job The observation function returns integer values Initialization and stop functions This monitor does not need to collect data either before a simulation starts or when simulation stop criteria are fulfilled Therefore both the initialization and stop functions return the value NONE fun init NONE fun stop NONE Queue delay real This monitor is very similar to the Queue Delay monitor The only difference is that the observation function returns real values rather than integer values fun obs bindelem let fun obsBindElem Server Start 1 jobs job proctime Real fromInt intTime AT job obsBindElem 1 0 in obsBindElem bindelem end Queue delay IntInf This monitor is also very similar to the Queue Delay monitor The only difference is that the observation function returns infinite integer IntInf int values rather than integer values Long delay times This generic data collector monitor is used to calculate the proportion of jobs that have to wait in the queue for a long time The reference variable longdelaytime is used

    Original URL path: http://cpntools.org/documentation/examples/queue_system_queue_delay (2016-04-26)
    Open archived version from archive


  • Queue system queue length << CPN Tools Homepage
    a function for multi sets and it converts a multi set with one element to the single element in the multi set In this observation function evaluating the expression ms to col Server Queue 1 mark will always return a single value of type Jobs i e a single value that is a list of values of type Job The length function is then used to return the length of this list as an integer The observation function can examine the transitions that surround the place Queue but it ignores this information Initialization and stop functions The initialization and stop functions are similar to the observation function however they return integer option values The initialization function will be invoked once before a simulation starts and it will return the value SOME x where x is the length of the queue of jobs The stop function will return similar values when it is invoked when simulation stop criteria are fulfilled fun init Server Queue 1 mark Jobs ms SOME length ms to col Server Queue 1 mark fun stop Server Queue 1 mark Jobs ms SOME length ms to col Server Queue 1 mark Queue length advanced This monitor is similar to the Queue Length monitor The statistics that are calculated for this monitor will be the same as those for the Queue Length monitor The difference between the two monitors is that fewer data values are collected for this monitor The monitor is associated with two places and two transitions It is associated with the nodes that are associated with the Queue Length monitor as well as the place Idle on page Server When a job is added to the empty queue and the server is idle the job will be immediately removed from the queue This means that the length of the queue will change from 0 to 1 to 0 at the same model time In other words in these situations the length of the queue will be 1 for 0 units of time This monitor avoids measuring the length of the queue when a job is added to the empty queue and the server is idle The figure below shows the differences in the data values that are collected by this monitor and the Queue Length monitor Predicate function The predicate function for this monitor is the only monitoring function that is different from the monitoring functions for the Queue Length monitor Lines 6 7 below ensure that data will not be collected when the Arrive transition occurs and the length of the list on the place Queue is equal to 1 and the size of the marking of place Idle is 1 i e the server is idle In other words it ensures that data will not be collected when the length of the queue of jobs is equal to 1 for 0 units of time fun pred bindelem Server Idle 1 mark Server tms Server Queue 1 mark Jobs ms let fun predBindElem Server Start

    Original URL path: http://cpntools.org/documentation/examples/queue_system_queue_length (2016-04-26)
    Open archived version from archive

  • Queue system server utilization << CPN Tools Homepage
    functions The time of the last update for the Server Utilization monitor will often be less than the time of the last update for the two other monitors because the stop function for that monitor returns the value NONE whereas the stop function for the two others returns values of the form SOME x At the end of a simulation the average for each of the three of these monitors will be equal to the server utilization during the simulation Total processing time This generic data collector monitor is used to estimate the amount of time that the server is busy processing jobs during a simulation The monitor is associated with the Start transition on the page Server The monitor calculates untimed statistics The initialization and stop functions both return the value NONE The predicate function returns true each time the Start transition occurs The observation function examines the binding of the variables when the Start transition occurs The variable proctime is bound to an integer value and it represents the amount of time that the server will spend processing the job that is bound to the variable job Each time the Start transition occurs the observation function will return the processing time as a real fun obs bindelem let fun obsBindElem Server Start 1 jobs job proctime Real fromInt proctime obsBindElem 1 0 in obsBindElem bindelem end When a simulation stops the sum for this data collector will be an estimate of the amount of time the server was busy If the simulation stops when the server is busy and the Stop transition is not enabled then the sum for this monitor will be greater than the actual amount of time that the server was busy during the simulation This is due to the fact that the server has not yet completed processing a job i e there is some processing time remaining for the job however the total processing time for the job would be included in the sum for this monitor In the example below the simulation stopped at time 272 The time stamp for the token on the place Busy is 409 This means that the remaining processing time for the job being processed is 409 272 137 For this simulation these 137 time units are included in the sum for this monitor thus making the sum an inaccurate estimate of the actual amount of time the server was busy processing jobs during the simulation If the simulation stops when either the server is idle or the Stop transition is enabled then the sum for this monitor will be the exact amount of time that the server was busy during a simulation Server utilization estimate by ProcTime This generic data collector monitor is used to estimate the server utilization and it uses the sum calculated by the Total Processing Time monitor The monitor is associated with a single transition The monitor will not collect any data before or during a simulation Only the stop function will

    Original URL path: http://cpntools.org/documentation/examples/queue_system_server_utili (2016-04-26)
    Open archived version from archive

  • Resource allocation example << CPN Tools Homepage
    introduction to CP nets The CPN model is described in great detail explaining the basic concepts of CP nets Hence it can be read by people with no little Petri net background The CPN model describes how two different kinds of processes are sharing three different kinds of resources It is simple to understand and easy to simulate modify The example is taken from Sect 1 2 of K Jensen

    Original URL path: http://cpntools.org/documentation/examples/resource_allocation (2016-04-26)
    Open archived version from archive

  • Resource allocation example << CPN Tools Homepage
    the basic concepts of occurrence graphs Hence it can be read by people with no prior knowledge of occurrence graphs The CPN model describes how two different kinds of processes are sharing three different kinds of resources The model is identical to the Resource allocation example system presented in Introductory Examples which we recommend to study before this example The example is taken from Sect 1 1 of Vol 2

    Original URL path: http://cpntools.org/documentation/examples/resource_allocation_sp (2016-04-26)
    Open archived version from archive

  • Ring protocol example << CPN Tools Homepage
    suited as a first introduction to hierarchical CP nets The use of substitution transitions and fusion sets are described in great detail but do note that fusion places are not supported in CPN Tools at this time The CPN model describes how a number of different sites communicate via a ring network The example is taken from Sect 3 1 of Vol 1 of K Jensen Coloured Petri Nets Basic

    Original URL path: http://cpntools.org/documentation/examples/ring_protocol (2016-04-26)
    Open archived version from archive

  • Simple protocol example << CPN Tools Homepage
    number of packets to a receiver The communication medium may loose packets and packets may overtake each other Hence it may be necessary to retransmit packets and to ignore doublets and packets that are out of order The example is a modified version of a timed CP net presented in Sect 5 5 of K Jensen Coloured Petri Nets Basic Concepts Analysis Methods and Practical Use Monographs on Theoretical Computer

    Original URL path: http://cpntools.org/documentation/examples/simple_protocol (2016-04-26)
    Open archived version from archive

  • Simple protocol example << CPN Tools Homepage
    example This is a small toy example which is well suited as an introduction to occurrence graphs The analysis of the occurrence graph is described in great detail The CPN model describes a simple protocol by which a sender can transfer a number of packets to a receiver The model is identical to the Simple protocol example presented in Introductory Examples which we recommend to study before this example Documentation

    Original URL path: http://cpntools.org/documentation/examples/simple_protocol_sp (2016-04-26)
    Open archived version from archive