Browse > Article

A New Analytical Algorithm of Timed Net with Probabilities of Choices and Its Application  

Yim Jae-Geol (동국대학교 컴퓨터멀티미디어학과)
Joo Jae-Hun (동국대학교 전자상거래학과)
Publication Information
Journal of the Korean Operations Research and Management Science Society / v.30, no.4, 2005 , pp. 99-115 More about this Journal
Abstract
For an analysis of the performance 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 Probabilities of Choices'.
Keywords
System Analysis; Performance Analysis; Location Based Service; Minimum Cycle Time; Petri Net; Timed Net;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Murata, T., 'Petri nets: Properties, Analysis and Applications,' Proceedings of the IEEE, Vol.77. No.4(April 1989), pp.541-580
2 Hillion, Herve P., 'Timed Petri Nets and Application to Multi-Stage Production Systerns,' Lecture Notes in Computer Science, Vol.424 ; Advances in Petri Nets 1989, Berlin, Germany, Springer-Verlag(1990), pp. 281-305
3 Krishnamurthy, N., 'Using SMS to Deliver Location-based Services,' Proceedings of 2002 IEEE International Conference on Personal Wireless Communications (Proceedings of ICPWC'2002), Dec. 15-17,2002, pp.177-181
4 Reisig, W., Petri Nets, An Introduction, EATCS, Monographs on Theoretical Computer Science, W.Brauer, G. Rozenberg, A. Salomaa (Eds.), Springer Verlag, Berlin, 1985
5 Desel, J., Wolfgang Reisig, and Grzegorz Rozenberg (Eds.), Lectures on Concurrency and Petri Nets, Advances in Petri Nets, Lecture Notes in Computer Science, Vol. 3098, Springer-Verlag, 2004, ISBN : 3-540-22261- 8
6 Dasdan, A. and R.K. Gupta, 'Faster Maximum and Minimum Mean Cycle Algorithms for System Performance Analysis,' IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, Vol.17, No.10(1998), pp. 889-899   DOI   ScienceOn
7 Rodriguez-Beltran, J and A. Ramfrez-Trevino, 'Minimum Initial Marking in Timed Marked Graphs,' 2000 IEEE International Conference on Systems, Man, and Cybernetics, Vol. 4(Oct. 8-11, 2000), pp. 3004-3008
8 Peterson, J.L., Petri Net Theory and the Modeling of Systems, Prentice-Hall, N.J., 1981, ISBN : 0-13-661983-5
9 Nakamura, M. and M. Silva, 'Cycle Time Computation in Deterministically Timed Weighted Marked Graphs,' Proceedings. ETFA '99. 7th IEEE International Conierence on Emerging Technologies and Factory Automation 1999, Vol. 2(Oct. 18-21, 1999), pp.1037-1046