• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1994.10a
• /
• pp.653-657
• /
• 1994

A symbolic performance analysis approach for flexible for manufactring systems (FMS) can be formulated based on the integration of Petri Nets (PN) and moment generating function (MGF) concept. In this method, generalized stochastic Petri Nets are used to define performance models for FMS, then MGF nased approach for evaluating stochastic PN is used to derive performance parameters of PN, and finally system performance is calculated. A GSPN model of machine cell is shown to illustrate the proposed method for evaluating such performance indices as production rate, utilization, work-in-process and lead time. The major advantage of this method over existing performance evaluation of FMS is the ability to compute symbolic solutions for performance. Finally future research toward automating performance measure for GSPN models of FMS is discussed.

• Journal of Mechanical Science and Technology
• /
• v.19 no.5
• /
• pp.1123-1130
• /
• 2005

In view of the lack of efficient coordination of interdependent task in the collaborative design system, the mechanisms for temporal and resource coordination problems are established based on Petri Nets, respectively. Both of the mechanisms are encapsulated and implemented in the coordination component so as to increase the flexibility and acceptability of the system. We model the CSCW system based on Petri Nets for simulation, analysis and optimization. A case study on the overhead traveling crane is given to demonstrate and validate our theory.

• Proceedings of the KIEE Conference
• /
• 1987.11a
• /
• pp.439-443
• /
• 1987

This paper presents a method for constructing model of manufacturing processes for simulation and design of the discrete control logic. The models represent the discrete vent evolution of the system as well as features of the underlying continues processes, for applications such as discrete parts manufacture and assembly, the process is decomposed into operations and for each operation the required resources and associated discrete resource slates are Identified. The structure of the discrete-level control is modeled by modified Perti nets which are synthesized from single resource activity cycles. Construction of nets provides discrete control logic with guaranteed properties based on extended Petri nets theory, for illustration, the proposed method is applied to the high-level discrete control of a two-robotic assembly cell.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.22 no.51
• /
• pp.231-240
• /
• 1999

A major concern in Concurrent Engineering is the control and management of workload in a period of process. As a general rule, leveling the peak of workload in certain period is difficult because concurrent processing is comprised of various processes, including overlapping, paralleling looping and so on. Therefore, the workload management with resource constraints is so beneficial that effective methods to analyze design process are momentous. This study presents the Timed Petri Nets approach of precedence logic networks, and provides an alternative for users to analyze constraint processes to resolve conflicts of resources. Another approach to Continuous Time Markov Chain using Stochastic Petri Nets is also proposed. These approaches are expected to facilitate resolving resource constrained scheduling problems more systematically in Concurrent Engineering environment.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.21 no.47
• /
• pp.193-209
• /
• 1998

The objective of this paper is to present a methodology for design of the FMS by using a new modeling tool which is called SE&TPN(Safe Extended & Timed Petri Net). A FMS, which consists of various machine groups, may produce machine parts in different physical dimensions and lot size. The approach involves the SE&TPN modeling by Petri-nets. The proposed algorithm can handle determining of firing count vector by incidence matrix and adjustment of conflict using the marking of SE&TPN. The SE&TPN is defined as nets that can have at most one token in one place and can have elements such as permissive arcs and inhibitor arcs in addition to elements. The SE&TPN with permissive arcs and inhibitor arcs are intuitively direct approach to increase the modeling power of the SE&TPN. Finally, this paper is to develop a modulation to optimize the system problems of FMS using SE&TPN which describes exactly features of Petri Nets.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 1997.10a
• /
• pp.134-141
• /
• 1997

A geometrically non-linear finite element formulation of spatial cable networks is presented using three cable elements. Firstly, derivation procedures of tangent stiffness and mass matrices for the space truss element and the elastic catenary cable element, and the isoparametric cable element are summarized. The load incremental method based on Newton-Raphson iteration method and the dynamic relaxation method are presented in order to determine the initial static state of cable nets subjected to self-weights and support motions. Furthermore, static non-linear analysis of cable structures under additional live loads are performed based on the initial configuration. Challenging example problems are presented and discussed in order to demonstrate the feasibility of the present finite element method and investigate static non-linear behaviors of cable nets.

• Journal of Institute of Control, Robotics and Systems
• /
• v.14 no.3
• /
• pp.213-220
• /
• 2008

The object of this paper is to propose a method to deal with the problem of modeling user specifications in approaches based on supervisory control and Petri nets. However, most of Petri Net approaches are based on forbidden states specifications, and these specifications are suitable the use of tool such as the reachability graph. But these methods were not able to show the user specification easily and these formalisms are generally limited by the combinatorial explosion that occurs when attempting to model complex systems. Herein, we propose a new efficient method using FSSTP (Forbidden Sequences of State-Transitions Problem) and theory of region. Also, to detect and avoid the deadlock problem in control process, we use DAPN method (Deadlock Avoidance Petri nets) for solving this problem in control model.

• International Journal of CAD/CAM
• /
• v.8 no.1
• /
• pp.55-62
• /
• 2009

Scene Transition Nets(STN) is a very useful modeling method for discrete-continuous hybrid systems. However, it is difficult to write STN in standard object-oriented programming languages because STN programming requires much skill of object-oriented programming and high knowledge of STN of designers. To overcome this problem, the authors have developed a useful GUI simulator software for modeling and simulations of STN. The experimental results of a transport system including an AGV showed the availability of our software.

• Proceedings of the Korea Committee for Ocean Resources and Engineering Conference
• /
• 2001.05a
• /
• pp.26-31
• /
• 2001

Petri nets(PN) have been introduced as a poweful analyzing and design tool for the discrete systems such as sequential control systems. However, one of the important problems in its applications is that the model can not be analyzed easily when we deal with large scale systems because of increase of the number of components of the systems. To overcome this problem, some methods for dividing or reducing of PN have been suggested. In this paper, an approach for hierarchical expression of PN based on Sequential Function Chart(SFC) and Bottom Up oriented Mehodology(BUM) is proposed. Especially, some definition and rules are defined in order to divide and compose sub PN. A measuring tank system will be described as a typical kind of discrete systems and modeled by some sub PN based on the SFC and BUM by the proposed method in this paper.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.3
• /
• pp.335-342
• /
• 1995

In this pater, we present a syntactic software complexity measure based on program control structure using Petri Nets. Since control structure in program may be segregated by three structures such as sequence, condition and iteration structures, we are proposed a structured complexity measure based on program control structure after represented by Petri Nets. Finally, we compare our result with other measures of program complexity.