• 제어로봇시스템학회:학술대회논문집
• /
• 1993.10a
• /
• pp.336-341
• /
• 1993

Automatic Assembly Systems(AAS) are a class of systems exhibiting concurrency, asynchronicity and distributedness, and can be modeled by Petri Nets. In this paper, we design two types of configuration of part-assembly system in the car manufacturing line, as an example of AAS. And, we make a modeling the system by utilizing Extended Petri Nets, simulation as varying machine parameters, and analysis of operation status. These enable to present the information of optimal status and various problems occurring in the system for achieving high production rate.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.2
• /
• pp.1-7
• /
• 1993

In this paper, we show that Petri nets can be applied to design and reliability analysis of concurrent, parallel and embedded mode system such as a lift system that is familiar to our daily life. Modeling the behavioral characteristics of the lift system we extend the standard Petri nets by nadditionally constant timed transition, fault transition, stochastic imed ttransition and conditional transition concepts. Likewise, we present esults of rdesign and analysis of the system. This method can be applied to esign and danalysis of any other concurrent systems.

• Journal of the Korea Society for Simulation
• /
• v.10 no.1
• /
• pp.13-24
• /
• 2001

We propose a divide-conquer method of Petri nets under the condition of one-boundedness for all the Petri nets. We introduce the P-invariant transitive matrix of Petri nets and relationship between them. The feature of the P-invariant transitive matrix is that each element stands for the transitive relationship between input place and output place through the firing of the enable transition.

• Journal of applied mathematics & informatics
• /
• v.18 no.1_2
• /
• pp.329-337
• /
• 2005

This paper is to establish a functional equation satisfied by the generating function for counting rooted cubic c-nets and then to determine the parametric expressions of the equation directly. Meanwhile, the explicit formulae for counting rooted cubic c-nets are derived immediately by employing Lagrangian inversion with one or two parameters. Both of them are summation-free and in which one is just an answer to the open problem (8.6.5) in [1].

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

The purpose of this paper is show that an chip mounter can be modeled by stochastic petri nets, and that the simulator to verify a fitness of the program to assemble. The chip mounter can be constructed by using the petri net class (CPetriNet) based on the object-oriented programming. By using this simulator, we can get the information about the description of motion of the chip mounter, and moreover, we can evaluate the productivity.

• Journal of the Korean Society for Precision Engineering
• /
• v.12 no.10
• /
• pp.166-174
• /
• 1995

Flelxible Manufacturing Systems(FMS), which consist of various machine groups, can produce machine parts in different physical dimensions and lot sizes. In this paper, a novel method which utilizes Colored and Timed Petri Net is proposed to model a FMS. Each machine group of FMS is modulized and modeled using expanded Petri Nets. Colored and Timed Petri Nets are defined, and the flexible manufacturing systems's design algorithm based on this definition is developed and verified in a real FMS plant by computer simulations.

• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.665-668
• /
• 2000

In this paper, we are focused on the analysis of Petri nets model using the subnet. Specially, we are proposes a divide-conquer method of Petri nets under the condition of one-boundedness for all the Petri nets. The usefulness of the approach is shown by applying the proposed techniques to a illustration model.

• International Journal of Contents
• /
• v.4 no.3
• /
• pp.20-28
• /
• 2008

To obtain realistic performance measures for wireless networks, one should consider changes in performance due to failure related behavior. In performability analysis, simultaneous consideration is given to both pure performance and performance with failure measures. SRN is an extension of stochastic Petri nets and provides compact modeling facilities for system analysis. In this paper, a new methodology to model and analyze performability based on stochastic reward nets (SRN) is presented. Composite performance and availability SRN models for wireless handoff schemes are developed and then these models are decomposed hierarchically. The SRN models can yield measures of interest such as blocking and dropping probabilities. These measures are expressed in terms of the expected values of reward rate functions for SRNs. Numerical results show the accuracy of the hierarchical model. The key contribution of this paper constitutes the Petri nets modeling techniques instead of complicate numerical analysis of Markov chains and easy way of performance analysis for channel allocation under SRN reward concepts.

• Journal of Institute of Control, Robotics and Systems
• /
• v.8 no.4
• /
• pp.292-298
• /
• 2002

We focus on the slicing off some sub-nets using the transitive matrix. Control flows in the Petri nets is done based on the token flows. One control f]ow explains the independent tokens status and if the token-in divides into several tokens after firing a transition then the control flow divides to several flows, as well. Accordingly, we define that the basic unit of concur-rency (short BUC) is a set of the executed control flows based on the behavioral properties in the net. The BUC is S-invariant which has one control flow. We show the usefulness of transitive matrix to slice off some subnets from the original net based on BUC-through on an example.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.1241-1244
• /
• 1996

This paper present a performance evaluation method for Timed Place Petri Nets modeled by Live-and-Bounded Circuits (LB-circuits) through a bottom-up approach. The method can handle the case for the nets having common resources(CR). The target system is divided into the sub-systems by disconnecting the common Transition-Transition-Path(TTP) or Place-Place-Path (PPP) between sub-systems. The common PPP pattern is classified into Parallel Common Resource (PCR) and Sequential Common Resource (SCR) in detail for handling common resources. We evaluate the performance of each divided sub-system, and calculate the sub-systems affect on the performance of the whole system. The facts are generalized as a theorem. The developed theorem are applied into the performance evaluation of an automated assembly system shown in an example. All the results are verified by simulation.