• 제목/요약/키워드: Petri-nets

검색결과 219건 처리시간 0.038초

페트리네트의 계층화를 통한 시퀀스제어계의 설계(I) - SFC에 근거한 페트리네트의 분할 (Design for Sequential Control System Using Petri Nets with Hierarchical Expression(I) - Division of Petri Nets Based on SFC)

  • 정석권;양주호
    • 한국해양공학회지
    • /
    • 제13권3B호
    • /
    • pp.106-115
    • /
    • 1999
  • Modeling a discrete event system such as a sequential control system is difficult compared with a continuous system. Petri nets have been introduced as an analyzing and design tool for the discrete systems. One of the problems in its applications is that the model can not be analyzed easily in the case of large scale or complicated systems because of increase of the number of components of the system. To overcome this problem, some methods for dividing or reducing Petri nets have been suggested. In this paper, an approach for a hierarchical expression of Petri nets based on Sequential Function Chart(SFC) is proposed. A measuring tank system will be described as a typical kind of discrete systems. The system is modeled by sub Petri nets based on SFC in order to analyze and visualize efficiently about the dynamic behaviors of the system. Some numerical simulations using state equations are performed to prove the validity of the proposed method.

  • PDF

A Subclass of Petri Net with Reachability Equivalent to State Equation Satisfiability: Live Single Branch Petri Net

  • Gao, Qian;Cho, Young Im
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • 제13권3호
    • /
    • pp.200-207
    • /
    • 2013
  • Petri Nets are a system description and analysis tool. Reachability is one of the most basic properties in Petri Net research. In a sense, reachability research is the foundation study for other dynamic properties of Petri Nets through which many problems involving Petri Nets can be described. Nowadays, there are two mature analysis methods-the matrix equation and the reachability tree. However, both methods are localized, i.e., it is difficult to find a general algorithm that can determine reachability for an arbitrary Petri Net, especially an unbounded Petri Net. This paper proposes and proves three propositions in order to present a subclass of a Petri Net, the live single-branch Petri Net, whose reachability is equivalent to the satisfiability of the state equation.

Stochastic Petri Nets Reward Model을 이용한 통신 프로토콜의 성능평가 (Performance evaluation of telecommunication protocols using stochastic petri nets reward model)

  • 로철우;장직현
    • 전자공학회논문지A
    • /
    • 제32A권4호
    • /
    • pp.1-14
    • /
    • 1995
  • A new stochastic Petri nets model, called Stochastic Petri Nets Reward Model(SPNRM) is used for modeling and evaluating the performance of telecommunication protocols. We have developed a SPNRM of the TDX-10 Internal protocol, which has a packet data exchange facility between DCEs, Especially a timer and retransmission handling model is presented for error control of the data transmission phase. The stochastic Petri nets package(SPNP), a software package for SPNRM used in this paper, has been used to generate numerical results by analytical-numerical method rather than simulation. From the steady state solution of the net, it is possible to calculate automatically the performance measure of the protocol medeled with both end-to-end and link-by-link method, which are the mean response times and the throughputs.

  • PDF

Petri Nets 기반의 아코디언 연주 묘사와 분석에 관한 연구 (A study on Accordion Music Description and Analysis Based on Petri Nets)

  • 임재영;이종근
    • 한국멀티미디어학회논문지
    • /
    • 제13권10호
    • /
    • pp.1557-1564
    • /
    • 2010
  • 본 연구에서는 아코디언의 연주 과정을 도형화하고 분석하여 연주법에 대한 운용 체계를 패트리 넷으로 제안한다. 특히 아코디언 연주의 객체들을 플레이스와 트랜지션으로 분리하여 연주법을 도식화함으로서 연주 교육을 자동화 할 수 있는 기틀을 제시한다. 여기에서는 아코디언 연주 과정의 가시화와 운지법의 병세화로 순환 멈춤을 없게 하여 유연한 연주를 하는데 그 목적이 있다. 본 논문은 여러 약기들의 연주에도 패트리 넷으로 모델링하여 연주 과정을 이해함으로서 효율적이며 창의적으로 활용할 수 있는 충분한 효과가 있다. 본 연구에서는 패트리 넷을 이용한 아코디언 연주 모텔을 처음으로 제안하여 실제적인 연주 사례를 들어 그 효율성을 검증한다.

확장된 페트리네트를 이용한 차량형 군사로봇의 운용자 성능 및 통신장애 영향분석 (Analysis of the Human Performance and Communication Effects on the Operator Tasks of Military Robot Vehicles by Using Extended Petri Nets)

  • 최상영;양지현
    • 한국CDE학회논문집
    • /
    • 제22권2호
    • /
    • pp.162-171
    • /
    • 2017
  • Unmanned military vehicles (UMVs) are most commonly characterized as dealing with dull, dirty, and dangerous tasks with automation. Although most of the UMVs are designed to a high degree of autonomy, the human operator will still intervene in the robot's operation, and teleoperate them to achieve his or her mission. Thus, operator capacity, together with robot autonomy and user interface, is one of the most important design factors in the research and development of the UMVs. Further, communication may affect the operator task performance. In this paper, we analyze the operator performance and the communication effects on the operator performance by using the extended Petri nets, called OTSim nets. The OTSim nets was designed by the authors, being extended using pure Petri nets.

스토케스틱 페트리 네트를 이용한 교통 흐름 분석 (Analysis of the traffic flow using stochastic Petri 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.

  • PDF

추이적 행렬을 이용한 패트리 넷 모델의 분석방법에 대한 연구 (A study on the analysis method of Petri Net Models Using the Transitive Matrix)

  • 송유진;이종근
    • 한국시뮬레이션학회논문지
    • /
    • 제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.

  • PDF

확률 페트리 네트를 이용한 객체지향 기반의 표면 실장기 시뮬레이터 개발 (Development of Simulator based on Object-Oriented Programming for Chip Mounter Using Stochastic Petri Nets)

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

  • PDF

페트리네트를 이용한 유연생산시스템 설계에 관한 연구 (A Study on the Design of Flexible Manufacturing Systems by using Petri Nets)

  • Kim, G.B.;Lee, K.I.
    • 한국정밀공학회지
    • /
    • 제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.

  • PDF

Analysis of Petri net models using Transitive Matrix

  • Song, Yu-Jin;Lee, Jong-kun
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 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.

  • PDF