• 제목/요약/키워드: Timed Petri Nets

검색결과 39건 처리시간 0.029초

시간 사양 페트리 네트를 이용한 공장자동화 시스템의 스케쥴링 (Scheduling of Factory Automation Systems Using Timed Petri Nets)

  • 전명근
    • 대한전기학회논문지
    • /
    • 제39권9호
    • /
    • pp.1006-1016
    • /
    • 1990
  • A scheduler for a class of Factory Automation (FA) systems is suggested. The technique of Timed Petri Nets is used to model FA systems and, a new concept called Unit Timed Petri Nets is proposed to schedule the system. The scheduler consists of two parts, scheduling rules and input jobs. Since flexibility should be an indispensable ingredient of the scheduler for FA systems, the method using Timed Petri Nets is adopted to represent scheduling rules in a simple and systematic manner and the scheduler is implemented with the PROLOG language. The proposed scheduler is applied to the realistic problem of flow shop.

Petri Nets를 사용한 유연생산체제(FMS)에서의 의사결정지원체계(DSS)설계 (Modelling the Decision Support System in Flexible Manufacturing Systems Using Petri Nets)

  • 김진규
    • 품질경영학회지
    • /
    • 제18권2호
    • /
    • pp.54-68
    • /
    • 1990
  • Contingency response in a FMS system requires that the system be able to identify and evaluate a number of alternatives. This paper is outlined that DSS completes with a problem processor in corporating Timed Petri Nets model, and a data base system. DSS enables the FMS user to get the maximum benefit from a FMS. The structure of this DSS parallels the organizational activities involved in running the FMS. In designing a shop floor controller for FMS, interactions between the different real time, discrete event functions must be established. The specification of the machine tool and material handling system functions working as a concurrent and cooperative system is given in terms of Timed Petri Nets. In addition, the basic concepts and uses of Petri Nets are surveyed. The system to be studied is first modelled by a Timed Petri Nets and then procedure for evaluating the FMS system performance are presented. Numerical examples are studied to illustrate a session of the FMS used-DSS interaction.

  • PDF

시간 페트리네트를 DEVS 형식론으로 변환하는 알고리즘 (Algorithm for Transformation of Timed Petri Nets to DEVS Formalism)

  • 김영찬;김탁곤
    • 한국시뮬레이션학회논문지
    • /
    • 제11권2호
    • /
    • pp.77-88
    • /
    • 2002
  • Petri nets is a widely used formalism for specification and analysis of concurrent systems which is a subclass of discrete event systems. The DEVS (Discrete Event System Specification) formalism provides a general framework for specification of discrete event systems in a hierarchical, modular form. Often, modeling a discrete event system may employ both Petri Nets and DEVS formalism. In such a case low-level operational logics are modeled by Petri Nets and high-level managements by the DEVS formalism. Analysis of the system requires simulation of the overall system. This paper presents an algorithm for transformation of Petri Nets to DEVS formalism. The transformation enables modelers to simulate an overall system, which consists of DEVS models and Petri Nets models, in a unified DEVS simulation environment such as DEVSim++. An example for such transformation will be given.

  • 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

확장된 Timed Petri Net을 이용한 통신 프로토콜의 성능분석 알고리즘 (An Improved Algorithm for Performance Evaluation of Communication Protocol Using Extended Timed Petri Nets)

  • 이철희;이상호;김홍식
    • 한국통신학회논문지
    • /
    • 제14권3호
    • /
    • pp.197-206
    • /
    • 1989
  • 본 논문에서는 통신 프로토콜의 성능 분석을 위한 개선된 알고리즘을 제안한다. 이는 분산 시스템의 성능을 모델링하고 평가하는데 성공적으로 사용되어져 온 시간을 포함하는 확장된 Timed Petri Net 모델을 분석하는 알고리즘이다. 제안된 알고리즘은 일반적인 Timed Petir Net가 free-chioce 그리고 safe net 이라는 모델링의 제약을 완화하여, 제한적인 병행처리의 모델링을 허용한다. 그리고 Timed Reachability 그래프의 상태공간을 감소시키기 위해, 최다 수행규칙고 동시점화 트랜지션 집합을 이용한다. 알고리즘의 유용성 및 효율성을 보이기 위하여 Timed Reachability 그래프의 구성과 분석과정을 제시하고, 통신 프로토콜에 적용시켰다.

  • PDF

On Necessity-Valued Petri Nets

  • Sandri, S.A.;Cardoso, J.
    • 한국지능시스템학회:학술대회논문집
    • /
    • 한국퍼지및지능시스템학회 1993년도 Fifth International Fuzzy Systems Association World Congress 93
    • /
    • pp.1338-1341
    • /
    • 1993
  • We present here two Petri nets formalisms that can deal with uncertainty by the use of necessity-valued logic. The first and basic model, called necessity-valued Petri nets (NPN), can at the same time deal with uncertainty on markings are on transitions. The second model, called necessity-valued Petri nets (TNPN), is an extension of both NPN and timed Petri nets.

  • PDF

동적 시간 페트리네트 (Dynamic Timed Petri Nets)

  • 김영찬;김탁곤
    • 한국컴퓨터산업학회논문지
    • /
    • 제3권7호
    • /
    • pp.891-900
    • /
    • 2002
  • 시간 페트리네트는 동시발생적인(concurrent) 시스템을 명세하기 위해 폭 넓게 사용되는 형식론 중의 하나이다. 하지만 시간 페트리네트는 그 형식론 내에서 명확하게 시스템의 역학(dynamics)을 표현하지 못하는 단점을 가지고 있다. 이와 같은 불완전한 형식론은 설계자로 하여금 형식론 자체뿐만 아니라 특정 문제에 의존적인 시뮬레이션 알고리즘까지 고려하게 함으로서 모델링을 매우 어렵게 한다. 이 논문에서는 시스템의 역학을 표현할 수 있는 동적 시간 페트리네트 형식론과 추상적인 시뮬레이터를 제안한다.

  • PDF

Synchronic time ratio를 이용 시간 페트리 네트로 모델링된 시스템의 최적 성능에 필요한 초기 조건 결정 (Initial requirements to the optimal performance of systems modeled by timed place Petri nets using the synchronic time ratio)

  • 고인선;최정환
    • 제어로봇시스템학회논문지
    • /
    • 제3권1호
    • /
    • pp.101-108
    • /
    • 1997
  • The initial token value required to the optimal performance of discrete event systems can be decided by Sum of Delay Time and Synchronic Time ratio, which are new synchronic variables in Timed Place Petri Nets. For the system consisting of two Live-and-Bounded circuits(LB-circuits) fused in common Transition-Transition-Path or common Place-Place-Path, we prove that the Synchronic Time Ratio is the initial token ratio between two LB-circuits to optimally perform system functions. These results are generalized and formulated as a theorem. The initial tokens of a specific place can imply shared resources. Using the theorem, we can decide the minimum number of the shared resources to obtain the optimal performance, and minimize the idling time of resources. As an example, an automated assembly system is modeled by Timed Place Petri Net, and the initial tokens to achieve the optimal system performance are identified. All the values are verified by simulation.

  • PDF

퍼지 제어를 위한 시간형 퍼지 페트리넷 모델 (Timed fuzzy petri net model for fuzzy control model)

  • 윤정모
    • 전자공학회논문지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.

  • PDF

페트리 네트를 이용한 이산 사건 시스템의 성능 분석 (Performance evaluations of discrete event system using Petri Nets)

  • 최정환;고인선
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1996년도 한국자동제어학술회의논문집(국내학술편); 포항공과대학교, 포항; 24-26 Oct. 1996
    • /
    • 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.

  • PDF