• Transactions on Control, Automation and Systems Engineering
• /
• v.2 no.2
• /
• pp.121-129
• /
• 2000

In this paper, an optimal group control for elevator systems is proposed with timed Petri net based approach. Elevator system is modeled by time Petri nets and hall call response times are estimated with moment generating functions (MGFs) methos, which is applicable to real traffic patterns. Two assignment policies are proposed to satisfy the demands of passengers(i.e. hall/car calls) and to handle exceptional situations. In addition, optimal algorithms are implementated to minimize cost functions. THe performances of the elevator system employing the proposed algorithms are compared with each others in ways of several performance measures by a computer simulation.

• Journal of Korea Multimedia Society
• /
• v.2 no.2
• /
• pp.200-216
• /
• 1999

In this paper, we propose a BTPN (Beta-distributed Timed Petri Net) model which is not only an effective multimedia synchronization and authoring specification model, but also a direct control model for playout of a title. Methods of specification of relationships among all media objects in a title by using the BTPN structure and language, as well as methods of analysis of the BTPN by means of a Remaining Timed Reachability Graph and Timing diagram, are proposed. A concept of critical object path, coming from PERT/CPM, is useful for modeling the uncertainty of playout of a multimedia title and editing of title.

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

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1990.04a
• /
• pp.22-31
• /
• 1990

In this paper, we have studied modelling and simulation of computer communication protocols theoretically. After describing a definition and functions of communication protocols, we have classified models for protocol design. And, in those protocol models, by endowing Timed Petri Net (TPN) models with a time function .tau., we have proposed a structural definition of TPN models. Furthermore, in order to complement Petri Net Based models with some problems, we have introduced the Discrete EVent system Specification (DEVS) concept in system simulation field. As an important result of our study, we have presented a theorem, which says that a TPN model becomes a DEVS model, and proved it. According to the theorem, we can perform efficient simulation by using the DEVS model transformed from a TPN model when we intend the TPN model to be simulated, otherwise we design another simulation model for it.

• Journal of the Korea Society for Simulation
• /
• v.9 no.1
• /
• pp.67-81
• /
• 2000

In this paper, a new software package for modeling and simulating discrete-event dynamic systems is developed. The new software is a general-purpose, graphical tool based on timed Petri-nets and is developed using Visual Basic and Visual C++ for the window environment. It allows the user to graphically build a Petri-net model and enter input data for executing the Petri-net simulation model. It is equipped with a deadlock detection and recovery function as well as an automatic error check function. In addition, the software supports various enabling functions and distribution functions and provides various statistics for the performance measures of interests pertaining to the system. We expect the new software will be used in a wide number of applications including computer, communication and manufacturing systems.

• Proceedings of the Safety Management and Science Conference
• /
• 2003.05a
• /
• pp.299-304
• /
• 2003

Manufacturing companies must possess a new type of production system with characteristics of reconfigurability, reusability and scalability (Dove 1995), i.e. an agile manufacturing system. Such system will allow flexibility not only in producing a variety of part, but also in changing the system itself, which is a difference form flexible manufacturing systems. A fundamental early step in the reconfiguring process for agile manufacturing system is to develop a model that adequately describes the proposed systems, in order to be able to study and evaluate the impact of the reconfiguring decision on the system performance, before its construction. Therefore, in this paper, an Object & Knowledge-based Interval Timed Petri-Net (OKITPN) approach is proposed.

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

In this Paper prestnting an extended timed Petri net model which Can be used for the performance analysis of Distributed System. An analysis methodology based on a reachiabilitylike approach is prestented efficiency to find out the behaviour of these nets in terms of performance. And the proposed extended timed prtri net models are simulated to show practicability of the accuracy of the extended model in representing system specification.

• Journal of Institute of Control, Robotics and Systems
• /
• v.5 no.6
• /
• pp.724-733
• /
• 1999

An effective method of system modeling and dynamic scheduling for the back-end line of semiconductor manufacturing is proposed. The virtual factory, describing semiconductor manufacturing line, is designed in detail, and then a Petri net model simulator is developed for operation and control of the modular cells of the virtual factory. The petri net model is a colored timed Petri nets (CTPNs). The simulator will be utilized to analyze and evaluate various dynamic status and operatons of manufacturing environments. The dynamic schedulaer has a hierarchical structure with the higher for planning level and the lower for dynamic scheduling level. The genetic algorithm is applied to extract optimal conditions of the scheduling algorithm. The proposed dynamic scheduling is able to realize the semiconductor manufacturing environments for the diversity of products, the variety of orders by many customers, the flexibility of order change by changing market conditions, the complexity of manufacturing processes, and the uncertainty of manufacturing resources. The proposed method of dynamic scheduling is more effective and useful in dealing with such recent pressing requirements including on-time delivery, quick response, and flexibility.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.5
• /
• pp.695-707
• /
• 1993

Marked Petri Net(MPN) is used to analyze communication complexity with respect to the maximum number of concurrently active rendezvous. But, because it cannot represent timed & probability characteristics explicitly, it is not used to analyze the new execution time of complexity with respect to the communication. Thus to effectively analyze that execution time complexity, we propose Ada Tasking Structure Nets (ATSN) introduced restrictive conditions : net reduction rules, execution time, and probability. Finally, we show the powers of analyze of communication complexity with ATSN.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.16 no.2
• /
• pp.128-147
• /
• 1991

We propose a dynamic incidence matrix (DIM) for reflecting states and time conditions of a timed Petri net (TPN) explicitly. Since a DIM consists of a conventional incidence matrix, two time-related vectors and two state-related vectors, we can get the advantages inherent in the conventional incidence matrix of describing a static structure of a system as well as another advantage of expressing time dependent state transitions. We introduce an algorithm providing the DIM with a state transition mechanism. Because the algorithm is, in fact, an algorithmic model for discrete event simulation of TPN models, we provide a theoretical basis of model transformation of a TPN model into a DEVS(Discrete Event system Specification) model. By executing the algorithm we can carry out performance analysis of computer communication protocols which are represented TPN models.