• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.39 no.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.

• 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.

• Journal of the Korea Society for Simulation
• /
• v.11 no.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.

• Journal of the Korean Society for Precision Engineering
• /
• v.12 no.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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.14 no.3
• /
• pp.197-206
• /
• 1989

In this paper, we represent an improved algorithm of performance evaluation for communication protocol. It is an algorithm that analyzes Extended Timed Perti Net models including time which have been successfully used to model and evaluate the performance of distributed system. While Timed Petri Nets generally limted to free-choice and safe nets, our algorithm permits the construnction of elegant models of restricted concurrent processing. Furthermore, to reduce the state space size of Timed Reachability Graph, we improve the algorithm by using Maximum Firing Rule and sets of simultaneously firing transitions. Procedures for constructing of Timed Reachability Graphs and analyzing are presented, and we demonstrate the usefulness of this algorithm by applying it to the analysis of the communication protocol.

• 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.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.7
• /
• pp.891-900
• /
• 2002

Timed Petri nets are one of the most important formalisms used to specify concurrent systems, However, timed Petri nets cannot represent the dynamics of systems within the formalism explicitly. Such incomplete formalisms make the modeling very difficult because modelers should know not only the formalism itself but also its problem-specific simulation algorithm. In this paper we present a formalism which can express the dynamics of systems and an simulator.

• 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.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.34C no.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.

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