A new analytic algorithm of Timed Net with Probabilities of Choices and its application

For an analysis of a computer system, the minimum cycle time method has been widely used. The minimum cycle time method is a mathematical technique with which we can find the minimum duration time needed to fire all the transitions at least once and coming back to the initial marking in a timed net. A timed net is a modified version of a Petri net where a transition is associated with a delay time. In the real world, an event is associated with a probability of occurrence. However, a timed net is not equipped with any facility of specifying probability of event occurrence. Therefore, the minimum cycle time method applied on a timed net can easily overlook probabilities of occurrences of events and yield a wrong result. We are proposing ‘Timed Net with Probabilities of Choices’ where a transition can be associated with both delay time and a probability of occurrence. We also introduce an algorithm for minimum cycle time analysis on a ‘Timed Net with Probabilities of Choices’. As an example of application, we are performing an analysis of the location based service system using ‘Timed Net with Probabilites of Choices’.