• 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 Korea Society of Industrial Information Systems
• /
• v.4 no.1
• /
• pp.1-6
• /
• 1999

This paper is on the analysis for the real-time software requirement. This method can be used for TNPN(Timed Numerical Peri Net) as a easy communication means with real-users. It is based on the RTTL(Real Time Temporal Logic) for correctness the system. TNPN is used to represent a behavior specification language, the validity of specified behaviors in TNPN is expressed in RTTL, and analyzed through the teachability graph. Thus, the requirement between user and system is satisfied Using the example of shared track, the validity of the property of real-time(safetiness, responsiveness, liveness, priority) is verified. Also this framework if given to connection with a object, natually.

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

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

• 제어로봇시스템학회:학술대회논문집
• /
• 1993.10a
• /
• pp.1105-1110
• /
• 1993

We applied the simulation method using Petri Nets to a FMS model. Generally ordinary Petri Net would be short of describing a real FMS operations. Hence we adopted the extended Petri-Mets(EPN) and timed places in order to have performance evaluation. Our simulator use data based modeled of Petri Nets in simulation. We can enhance the overall production rate of the system with the obtained results over a number of simulations.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.4
• /
• pp.487-492
• /
• 2004

This paper deals with modeling method and application of Fuzzy Discrete Event System(FDES). FDES have characteristics which Crisp Discrete Event System(CDES) can't deals with and is constituted with the events that is determined by vague and uncertain judgement like biomedical or traffic control. In general, the modeling method of CDES has been studied many times, but that of FDES hasn't been nearly studied by qualitative character and scarcity of applicated system. This paper models traffic system with FDES's character in FTTPN and designs a traffic signal controller.

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

• International Journal of Control, Automation, and Systems
• /
• v.1 no.4
• /
• pp.431-443
• /
• 2003

This paper presents an efficient method to evaluate the performance of an extended stochastic Petri net by simple algebraic operations. The reachability graph is derived from an extended stochastic Petri net, and then converted to a timed stochastic state machine, using a semi-Markov process. The n-th moments of the performance index are derived by algebraic manipulations with each of the n-th moments of transition time and transition probability. For the derivation, three reduction rules are introduced on the transition trajectories in a well-formed regular expression. Efficient computation algorithms are provided to automate the suggested method. The presented method provides a proficient means to derive both the numerical and the symbolic solutions for the performance of an extended stochastic Petri net by simple algebraic manipulations.

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