• 한국시뮬레이션학회논문지
• /
• 제11권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.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 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.

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

• 품질경영학회지
• /
• 제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.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1994년도 Proceedings of the Korea Automatic Control Conference, 9th (KACC) ; Taejeon, Korea; 17-20 Oct. 1994
• /
• 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.

• 한국멀티미디어학회논문지
• /
• 제13권10호
• /
• pp.1557-1564
• /
• 2010

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

• 산업경영시스템학회지
• /
• 제17권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.

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

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

• 제어로봇시스템학회논문지
• /
• 제8권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.