• IE interfaces
• /
• v.17 no.2
• /
• pp.200-207
• /
• 2004

Because the designed workflow may contain potential errors which may result in deadlocks, livelocks and so on, it is important to analyze the correctness of a workflow definition before it is put into the run time environment. Proposed in this paper is a transformation procedure of an UML activity diagram into a Petri net for the analysis of a workflow. By combining the strengths of easy-to-use functionality of an activity diagram and the analysis power of a Petri net, workflow analysts in the enterprise can model and analyze various kinds of workflow definition more easily and accurately.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.2
• /
• pp.584-589
• /
• 2010

In this paper we suggest multimedia synchronization model that is based on the Petri-net and services desirable quality of service requirement. Proposed model applies variable buffer which can be allowed, and then it presents high quality of service and real time characteristics. In this paper we expend Petri-net and propose new multimedia synchronization specification model in PBMSM and apply two analysis method of Petri-net to prove our model suggested. We compared with other models and showed high QoS.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.30 no.4
• /
• pp.99-115
• /
• 2005

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'.

• Journal of Korea Multimedia Society
• /
• v.9 no.11
• /
• pp.1503-1514
• /
• 2006

Today, consumers can access Internet from everywhere, therefore most commercial and other organizations provide their services on the Web. As the result, countless Web service systems are already on the Internet and more systems are under construction. Therefore, many researches of verifying that the system to be constructed will not have any deadlock and will run successfully without any problem at the early stage of design have been performed. Several Petri net based verification methods have also been published. However, they have focused on building Petri net models of Web service systems and none of them introduces efficient analysis methods. As 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, the minimum cycle time method has been widely used in computer system analysis. A timed net is a modified version of a Petri net where a transition is associated with a delay time. A delay time used in a timed net is a constant even though the duration time associated with an event in the real world is a stochastic number in general. Therefore, this paper proposes 'Mixedly Distributed Stochastic Timed Net' where a transition can be associated with a stochastic number and introduce a minimum cycle time analysis method for 'Mixedly Distributed Stochastic Timed Net'. We also introduce a method of analysing a Web service system's response time with the minimum cycle time analysis method for 'Mixedly Distributed Stochastic Timed Net.'.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.3
• /
• pp.543-563
• /
• 1996

In this paper, we propose a Timed Fuzzy Petri Net(TFPN) model as a new model of real-time fuzzy control. The TFPN model, which is useful for fuzzy inference and fuzzy control is an integrated model of Timed PetriNet and Fuzzy Petri Net. Additionally, a Timed Fuzzy Control Language is defined as a textual specification model of fuzzy control rues, and proposed a TFPN modeling method. The TFPN model is a Petri Net formalism of fuzzy control systems. Execution rule is consisted of marking(i.e,fuzzyfication) and firing(i.e,inference and defuzzyfication) procedures. A simple case work by using TFPN model shows us computing time of inference and defuzzyfication is low and uncertainty and visibility of fuzzy control rule are modeled effectively.

• Proceedings of the KIEE Conference
• /
• 2001.07d
• /
• pp.2045-2047
• /
• 2001

In this paper, we proposed the representation method of specification and the control rules fork FMS by TPL. To increase productivity and resource utilization, it is desirable to have more active jobs in the system, but the more active jobs there are, the more easily deadlock occur. Therefore, it is very important that the real-time deadlock control to disable deadlock. In this paper, we performed the system modeling by the CROPN(Colored Resource -Oriented Petri Net) and the necessary -sufficient condition check to disable deadlock. We proposed the supervisory control system that can be the real-time monitoring for deadlock free through a necessary-sufficient condition by CROPN modelling, and designed the logic controller of the extended process using TPL.

• Proceedings of the KIEE Conference
• /
• 1999.07c
• /
• pp.1136-1138
• /
• 1999

This paper describes a new method of the modeling of protection system and fault diagnosis in power systems using Petri nets. The Petri net models of protection system are compose of the operating process of protective devices and the fault diagnosis process. Fault diagnosis model which makes use of the nature of Petri net is developed to overcome the drawbacks of methods that depend on operator knowledge. The proposed method can reduce processing time and increase accuracy when compared with the traditional methods. And also this method covers online processing of real-time data from SCADA.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.5
• /
• pp.695-707
• /
• 1993

Marked Petri Net(MPN) is used to analyze communication complexity with respect to the maximum number of concurrently active rendezvous. But, because it cannot represent timed & probability characteristics explicitly, it is not used to analyze the new execution time of complexity with respect to the communication. Thus to effectively analyze that execution time complexity, we propose Ada Tasking Structure Nets (ATSN) introduced restrictive conditions : net reduction rules, execution time, and probability. Finally, we show the powers of analyze of communication complexity with ATSN.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.14 no.3
• /
• pp.197-206
• /
• 1989

In this paper, we represent an improved algorithm of performance evaluation for communication protocol. It is an algorithm that analyzes Extended Timed Perti Net models including time which have been successfully used to model and evaluate the performance of distributed system. While Timed Petri Nets generally limted to free-choice and safe nets, our algorithm permits the construnction of elegant models of restricted concurrent processing. Furthermore, to reduce the state space size of Timed Reachability Graph, we improve the algorithm by using Maximum Firing Rule and sets of simultaneously firing transitions. Procedures for constructing of Timed Reachability Graphs and analyzing are presented, and we demonstrate the usefulness of this algorithm by applying it to the analysis of the communication protocol.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.205-205
• /
• 2000

In this paper, we are proposed an analysis method of the operation schedule in FMS using Time Petri Nets(TPN) unfolding. TPN's unfolding is one of the analysis methods after changed non-cyclic net from the concurrent net without to expand the state explosion. We are illustrated this proposed to analyze a schedule problem in Ratio-driven FMS modeling.