• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1997년도 한국자동제어학술회의논문집; 한국전력공사 서울연수원; 17-18 Oct. 1997
• /
• pp.1504-1507
• /
• 1997

In this paper, we investigate a traffic flow modeled by stochastic Petri nets. The model consists of two parts : the traffic flow model and signal controller model. These models are used for analyzing the flow of the traffic intersection. The results of the evaluation are derived from a Petri Net-based simulation package, Greatspn. Through simulation we compare the performances of the pretimed signal controller with those of the trafic-adaptive signal controller.

• 한국콘텐츠학회:학술대회논문집
• /
• 한국콘텐츠학회 2009년도 춘계 종합학술대회 논문집
• /
• pp.699-705
• /
• 2009

This paper reviews methods used to perform reliability and availability analysis of the network system composed by nodes and links. The combination of nodes and links forms virtual connections (VC). The failure of several VCs cause failure of whole network system. Petri Net models are used to analyze the reliability and availability. Stochastic reward nets (SRN) is an extension of stochastic Petri nets provides modelling facilities for network system analysis.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1993년도 한국자동제어학술회의논문집(국내학술편); Seoul National University, Seoul; 20-22 Oct. 1993
• /
• 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.

• 전자공학회논문지B
• /
• 제30B권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.

• 한국시뮬레이션학회논문지
• /
• 제10권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
• /
• 제18권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년도 제15차 학술회의논문집
• /
• 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.

• 한국정밀공학회지
• /
• 제12권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.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 ITC-CSCC -2
• /
• 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
• /
• 제4권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.