• Title/Summary/Keyword: time Petri nets

Search Result 65, Processing Time 0.026 seconds

Parallel Simulation of Bounded Petri Nets using Data Packing Scheme (데이터 중첩을 통한 페트리네트의 병렬 시뮬레이션)

  • 김영찬;김탁곤
    • Journal of the Korea Society for Simulation
    • /
    • v.11 no.2
    • /
    • pp.67-75
    • /
    • 2002
  • This paper proposes a parallel simulation algorithm for bounded Petri nets in a single processor, which exploits the SIMD(Single Instruction Multiple Data)-type parallelism. The proposed algorithm is based on a data packing scheme which packs multiple bytes data in a single register, thereby being manipulated simultaneously. The parallelism can reduce simulation time of bounded Petri nets in a single processor environment. The effectiveness of the algorithm is demonstrated by presenting speed-up of simulation time for two bounded Petri nets.

  • PDF

On Necessity-Valued Petri Nets

  • Sandri, S.A.;Cardoso, J.
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1993.06a
    • /
    • 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

Slices Analysis Method of Petri nets in FMS Using the Transitive Matrix

  • Kim, Jung-Won;Lee, Jong-Kun;Song, Yu-Jin;Kim, Jong-Wook
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2001.10a
    • /
    • pp.132.3-132
    • /
    • 2001
  • In this paper, we focus on the analysis of the scheduling problem in FMS after slicing off some sub-nets using the transitive matrix. This class of Time Petri nets is obtained by merging subnets based on the machine's operations. We can divide original system into some subnets based on machine's operations using Time Petri nets slice and analyze the feasibility time in each schedules. In this paper, we show the usefulness of transitive matrix to slice off some subnets from the original net, and explain on an example.

  • PDF

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

  • Kim, Jin-Gyu
    • Journal of Korean Society for Quality Management
    • /
    • v.18 no.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

Synchronic relations with a time constraint

  • Koh, Inseon
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1994.10a
    • /
    • pp.676-680
    • /
    • 1994
  • Three synchronic variables (Deviation Time, Fairness Time, Synchronic Time) are defined for Timed Place Petri Nets (TPPN). These parameters show the dependency between the firing of transition subsets in the time domain by different values. The approaches in this paper can be used to find synchronic relations in Stochastic Petri Nets. This paper presents how to decide the minimum resources required to a Flexible Manufacturing Cell using Synchronic Time concept.

  • PDF

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

  • Leem, Jae-Yung;Lee, Jong-Keun
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.10
    • /
    • pp.1557-1564
    • /
    • 2010
  • This study present to operator system about performance method by diagrammatic and analysis based on Petri Nets when accordion is performed. Especially, this study present to the basis an automatic performance education by visibility according to divide place and transition of correlation of musical objects. In this, our purpose is flexible performance of deadlock-freeness by visibility of operating process and detail of marking. This study is effective and useful of understand to performance process by Petri Nets modeling inclusive of many musical instrument. The first time, this study suggest performance model of accordion based on Petri Nets and verify of efficiency, an example.

A Study on the Minimizing Processing Time of Manufacturing System (제조시스템의 가공시간 최소화에 관한 연구)

  • 김성희;하정진
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.17 no.30
    • /
    • pp.167-175
    • /
    • 1994
  • Generally, queueing networks, networks, chains and simulation techniques are among the most widely used evaluation tools to study computer systems, manufacturing systems etc. But, these tools have some assumptions and difficulties. So, this thesis presents a method for manufacturing system using Petri nets. Petri nets are a graphical and mathmatical modeling tool and are promising tool for describing and studying systems that are characterized as being concurrent asychronous, dynamic, distributed and parrallel. It designs Petri net model for processing time of manufacturing system And it applied to a job shop system composed of 8 machines and 4 different job types.

  • PDF

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

  • Go, In-Seon;Choi, Juang-Hwan
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.3 no.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

A Model with an Inference Engine for a Fuzzy Production System Using Fuzzy Petri Nets (Fuzzy Petri Nets를 이용한 퍼지 추론 시스템의 모델링 및 추론기관의 구현)

  • ;Zeung Nam Bien
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.29B no.7
    • /
    • pp.30-41
    • /
    • 1992
  • As a general model of rule-based systems, we propose a model for a fuzzy production system having chaining rules and an inference engine associated with the model. The concept of so-called 'fuzzy petri nets' is used to model the fuzzy production system and the inference engine is designed to be capable of handling inexact knowledge. The fuzzy logic is adopted to represent vagueness in the rules and the certainty factor is used to express uncertainty of each rules given by a human expert. Parallel, inference schemes are devised by transforming Fuzzy Petri nets to matrix formula. Futher, the inference engine mechanism under the Mamdani's implication method can be desceribed by a simple algebraic formula, which makes real time inference possible.

  • PDF

Slices Method of Petri Nets Using the Transitive Matrix for Scheduling Analysis in FMS (유연생산 시스템 스케쥴링 분석을 위한 추이적 행렬을 이용한 패트리 넷의 분할)

  • Song, You-Jin;Kim, Jong-Wuk;Lee, Jong-Kun
    • 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.