• International Journal of Control, Automation, and Systems
• /
• 제1권4호
• /
• pp.431-443
• /
• 2003

This paper presents an efficient method to evaluate the performance of an extended stochastic Petri net by simple algebraic operations. The reachability graph is derived from an extended stochastic Petri net, and then converted to a timed stochastic state machine, using a semi-Markov process. The n-th moments of the performance index are derived by algebraic manipulations with each of the n-th moments of transition time and transition probability. For the derivation, three reduction rules are introduced on the transition trajectories in a well-formed regular expression. Efficient computation algorithms are provided to automate the suggested method. The presented method provides a proficient means to derive both the numerical and the symbolic solutions for the performance of an extended stochastic Petri net by simple algebraic manipulations.

• 전자공학회논문지C
• /
• 제34C권5호
• /
• pp.9-18
• /
• 1997

The petri net is a graphic model which is adaptable in modeling a complex concurrent parallel ssystem, and it is widely used in the fields of industrial enginering, computer science, electric engineeringand chemistry. Recently, the net is applied to the communication protocol, and extended to represent complex systems. There are several extended petri nets named as TPN (timed petri net), SPN (stochastic petri net), FPN(fuzzy petri net) and TFPN(timed fuzzy petri net). Accodingly, this SPN (stochastic petri net), FPN (fuzzy petri net) and TFPN(timed fuzzy petri net). Accodingly, this paper proposes an advanced communication protocol modeling method using the fuzzy value of the transition and firing delay time as the arguments of the function. The proposed method can produce clearer firing rules, and it is supposed to be used to design and analyse communication protocols in great effection.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1993년도 한국자동제어학술회의논문집(국내학술편); Seoul National University, Seoul; 20-22 Oct. 1993
• /
• pp.324-329
• /
• 1993

A reduction method of GSPN (generalized stochastic Petri net) is proposed. A GSPN is basically a SPN (stochastic Petri net) with transition a that are either timed or immediate. Then the proposed method is defined on the basis of the dynamic behavior and the structure of the net. The reduction preserves the properties such as liveness, boundedness, and allows easy analysis of the GSPN.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 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.

• 산업공학
• /
• 제17권spc호
• /
• pp.152-159
• /
• 2004

The Purpose of this paper is to propose performance evaluation schemes of flexible manufacturing cell using a generalized stochastic Petri net. In the competitive and global manufacturing environment, to evaluate the feasibility and manufacturability of a product in the product design stage is highly required. Through this process, all the possible problems which may occur in the manufacturing stage can be fixed in early stage. The scheme of generalized stochastic Petri net utilizing both immediate and exponential distributed transitions are applied to model a manufacturing cell with flexible machines, material handler, transporter and buffers. Performance analyses are performed based on behavioral, structural and quantitative properties. A flexible manufacturing cell is evaluated using a Petri net simulator.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회/대한산업공학회 2003년도 춘계공동학술대회
• /
• pp.821-826
• /
• 2003

The Purpose of this paper is to automate the representation of manufacturing line using Petri net model. In the manufacturing cell, the line can be represented using workflow which is composed of Bill of Material (BOM) and Bill of Processes (BOP). BOP shows the precedence of processes and the relationship between assembly and disassembly. As a modeling scheme, generalized stochastic Petri net is adopted. For a problem domain with flexible manufacturing cell, Petri net model is made and behavioral properties are analyzed.

• 한국정보통신학회논문지
• /
• 제19권12호
• /
• pp.2828-2835
• /
• 2015

본 논문에서는 다양한 다중화 모형과 논스톱 포워딩 기능이 네트워크 서비스의 가용도에 미치는 영향을 비교 분석한다. 다중화 모형 중 no redundancy, 2N redundancy, N-way redundancy, N-way active redundancy 모형에 대한 확률적 리워드 네트(Stochastic Reward Net, SRN) 모델을 설계하고, 각각의 모형에 대해 논스톱 포워딩 기능을 추가한 SRN 모델을 설계한다. 확률적 페트리 네트 패키지(Stochastic Petri Net Package, SPNP)를 활용하여 설계한 SRN 모델의 가용도를 구한다.

• 산업경영시스템학회지
• /
• 제28권3호
• /
• pp.36-41
• /
• 2005

페트리 네트(Petri Nets)는 이산 사건 시스템을 모델링할 수 있는 그래픽하고, 수학적인 도구이다. 본 연구는 유연제조 시스템을 확률적인 페트리 네트(Stochastic Petri Nets)중의 하나인 임베디드 마코프 체인(Embeded Markov Chain)에 도입하고, 임베디드 마코프 체인의 방법 중에 하나인 일반화된 확률적 페트리 네트(Generalized Stochastic Perti Nets)에 적용시켰다. 그리고 결과치의 정확성을 알아내기 위하여, 페트리 네트 시뮬레이션과 아레나를 사용하여 실행하였다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 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.

• Journal of Computing Science and Engineering
• /
• 제7권1호
• /
• pp.44-52
• /
• 2013

This paper addresses the problem of resource scheduling in a grid computing environment. One of the main goals of grid computing is to share system resources among geographically dispersed users, and schedule resource requests in an efficient manner. Grid computing resources are distributed, heterogeneous, dynamic, and autonomous, which makes resource scheduling a complex problem. This paper proposes a new approach to resource scheduling in grid computing environments, the hierarchical stochastic Petri net (HSPN). The HSPN optimizes grid resource sharing, by categorizing resource requests in three layers, where each layer has special functions for receiving subtasks from, and delivering data to, the layer above or below. We compare the HSPN performance with the Min-min and Max-min resource scheduling algorithms. Our results show that the HSPN performs better than Max-min, but slightly underperforms Min-min.