• 대한산업공학회지
• /
• 제36권3호
• /
• pp.176-185
• /
• 2010

As long as the information systems are spread out, various efforts are being attempted to get the effective results by the system. As a result, a new management strategy has been appeared, referred to as "collaboration", and it is necessary to use a right methodology for modeling collaborative processes accordingly. Even though many modeling methodologies such as IDEF3, Petri-Nets, UML, and ARIS have been widely used for modeling processes, they are inadequate for clearly representing collaborative processes. Some researchers, therefore, have suggested new modeling methodologies for describing collaborative processes including CPM (collaborative process modeling). In this paper, we introduce an extended version of CPM method (i.e., exCPM) as a tool for modeling collaborative works after analyzing advantages and disadvantages of aforementioned methodologies. One of distinct characteristics of exCPM is that model verification is possible by transforming the exCPM models into Petri-Nets models. We also demonstrate transformation of an exCPM model in this paper with case studies for model verification.

• 제어로봇시스템학회논문지
• /
• 제5권6호
• /
• pp.724-733
• /
• 1999

An effective method of system modeling and dynamic scheduling for the back-end line of semiconductor manufacturing is proposed. The virtual factory, describing semiconductor manufacturing line, is designed in detail, and then a Petri net model simulator is developed for operation and control of the modular cells of the virtual factory. The petri net model is a colored timed Petri nets (CTPNs). The simulator will be utilized to analyze and evaluate various dynamic status and operatons of manufacturing environments. The dynamic schedulaer has a hierarchical structure with the higher for planning level and the lower for dynamic scheduling level. The genetic algorithm is applied to extract optimal conditions of the scheduling algorithm. The proposed dynamic scheduling is able to realize the semiconductor manufacturing environments for the diversity of products, the variety of orders by many customers, the flexibility of order change by changing market conditions, the complexity of manufacturing processes, and the uncertainty of manufacturing resources. The proposed method of dynamic scheduling is more effective and useful in dealing with such recent pressing requirements including on-time delivery, quick response, and flexibility.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1991년도 한국자동제어학술회의논문집(국제학술편); KOEX, Seoul; 22-24 Oct. 1991
• /
• pp.1811-1816
• /
• 1991

In this paper we present how the deviation bound, which is a synchronic variable, can be used for checking liveness in Petri nets. Also, the deviation bound will be applied to detect or avoid deadlock situations and to characterize concurrency against sequential behaviors in automated manufacturing systems. In the current stage, we restrict the applicable domain of these methods to the Petri net structure that can be synthesized by combining common transitions or common places or common paths of Live-and-Bounded circuits.

• 품질경영학회지
• /
• 제31권3호
• /
• pp.114-125
• /
• 2003

In this paper, we deal with the problem of modeling of agent-based robot manufacturing cell. Its role is becoming increasingly important in automated manufacturing systems. For Object Oriented & Queueing Petri Nets (OO&QPNs), an extended formalism for the combined quantitative and qualitative analysis of different systems is used for structure and performance analysis of mobile robotic cell. In the case study, the OO&QPN model of a mobile robotic cell is represented and analyzed, considering multi-class parts, non-preemptive priority and alternative routing. Finally, the comparison of performance values between Shortest Process Time (SPT) rule and First Come First Serve (FCFS) rule is suggested. In general, SPT rule is most suitable for parts that have shorter processing time than others.

• 한국멀티미디어학회논문지
• /
• 제17권11호
• /
• pp.1296-1306
• /
• 2014

Recently there are many attempts that IT convergence has been studied together with very different sector like art and music. If it is possible to make a formal model with combination of engineering with strong creative sector like music, there will be some advantages to analyze its contents easily. In this study, the model has been provided to utilize music analysis and compose algorithm through the formal model research of Sonata. To this end, this study has been provided a formal model of Sonata with the Petri net model being widely used and verify the effectiveness of the proposed model on the case of Piano Sonata K. 332.

• 한국정보처리학회논문지
• /
• 제7권5호
• /
• pp.1426-1433
• /
• 2000

As distributed computing systems become popular, many modeling techniques and methods have been developed in specify the specification formally and verify the distributed/concurrent sytems. In spite of importance of communication in distributed object-oriented systems, specifying of communication method generally has not been emphasized in the design phase. One reason is due to the system designer misunderstanding, that is, a specification needs to be independent on the implementation. However, since defining communication pattern indistributed object-oriented systems is more serious than the required message passing method in the design phase. specifying the communication pattern is necessary instead of postponing until the implementation. In this paper, two formal specification techniques, temporal logic method and Petri nets method, for the communication in distributed systems are discussed. One is based on the temporal logic, which specifies the different patterns of primitive predicates. This method enable to define the underlying mechanism which can be interpreted as constraints. The Petri net method helps to specify the dynamic behavior of communicational patterns using the properties of Petri nets.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2000년도 제15차 학술회의논문집
• /
• pp.66-66
• /
• 2000

In this parer, we introduce an algorithm to control flows of the traffic in multi-intersections. It is pointed out that the main problem in traffic control is how to resolve the congested situations for the particular time-durations and directions. The heavy load to a certain direction usually leads the intersection to congested situations, and the adjacent intersections are affected. We control and analyze the traffic flow of multi-intersections consisting of five intersections, in which four intersections are linked to the four directions of the central one. The entrance of vehicles of each direction is described using the concept of probability. We compare the performance of the pretimed signal controls to the traffic adaptive signal controller using a Petri Net simulation tool, Exspect.

• 제어로봇시스템학회논문지
• /
• 제7권6호
• /
• pp.540-549
• /
• 2001

An implementation method for chip-mounter simulator is proposed to improve the productivity and utility of electronic assembly lines. The simulator emulates the assembly sequence graphically to verify the chip mounter program in offline. It also presents functions of time estimation and productivity analysis considering the error probability. To increase the flexibility of simulator, stochastic petri nets are applied to modeling of the assembly sequence. The sequence model is then implemented as extendable classes by an object oriented language. The simulator is applied to a commercial chip mounter to verify the usefulness of the method proposed.

• International Journal of Contents
• /
• 제6권3호
• /
• pp.19-24
• /
• 2010

Task scheduling is an integrated component of computing with the emergence of grid computing. In this paper, we address two different task scheduling models, which are static Round-Robin (RR) and dynamic Fastest Site First (FSF) task scheduling method, using extended timed marked graphs, which is a special case of Stochastic Petri Nets (SPN). Stochastic reward nets (SRN) is an extension of SPN and provides compact modeling facilities for system analysis. We build hierarchical SRN models to compare two task scheduling methods. The upper level model simulates task scheduling and the lower level model implements task serving process for different sites with multiple servers. We compare these two models and analyze their performances by giving reward measures in SRN.

• International Journal of Contents
• /
• 제5권4호
• /
• pp.88-93
• /
• 2009

It is important for communication networks to possess the capability to overcome failures and provide survivable services. We address modeling and analysis of performability affected by both performance and availability of system components for a token ring network under failure and repair conditions. Stochastic reward nets (SRN) is an extension of stochastic Petri nets and provides compact modeling facilities for system analysis. In this paper, hierarchical SRN modeling techniques are used to overcome state largeness problem. The upper level model is used to compute availability and the lower level model captures the performance. And Normalized Throughput Loss (NTL) is obtained for the composite ring network for each node failures occurrence as a performability measure. One of the key contributions of this paper constitutes the Petri nets modeling techniques instead of complicate numerical analysis of Markov chains and easy way of performability analysis for a token ring network under SRN reward concepts.