• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.7
• /
• pp.50-58
• /
• 1993

Petri nets aare capable of modeling a large variety of systems, it is necessary to analyze the modeled system for verifying the behavior. In this paper, we propose an algorithm which analyzes Petri nets by comparing initial marking with modified incidence matrix. The proposed algoriths is able to analyze petri net involving self-loop, and is able to verify the order of sequence according to that of firing.

• The KIPS Transactions:PartC
• /
• v.8C no.5
• /
• pp.621-628
• /
• 2001

SET is one of the useful protocol for credit payment in the Electronic market. Since, the delivery problem is conformed to delivery cooperation not payment problem, the classic SET protocol didn\`t consider about the certification of delivery. But the environment of electronic market be changed to manage the sold, delivery and payment etc.. In this paper, based on this consider, we propose a new SET protocol which has an function to verify the delivery based on SKP and verify it after analyzed by Petri nets. Specially, we consider SKP between Customer, Merchant, and Acquirer for improve the verify function.

• Journal of the Korea Society for Simulation
• /
• v.19 no.4
• /
• pp.67-75
• /
• 2010

Deadlock usually appears in contain subsystem which is run in parallel and resources share modules. Siphons and traps have been well introduced to characterize deadlocks of Petri nets. Siphon concept be well used for proposing the detect and prevent deadlock by the pleasure researchers. But it's need many times and efforts to detect all siphon sub-nets in the Petri model. Since transitive matrix could explain all relations between the place and transitions in Petri nets, we propose an algorithm to detect all siphon sub-nets after analyzed the transitive matrix's properties. Examples are givens to illustrate the method.

• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10b
• /
• pp.1564-1569
• /
• 1991

In this paper we describe Flexible Manufacturing Systems (FMS) using Petri nets, since Petri nets provide a powerful tool for modeling dynamical behavior of discrete concurrent processes. We deal with off-Line and on-Line rule-based scheduling of FMS. The role of the rule-base is to generate appropriate priority rule for resolving conflicts, that is, for selecting one of enabled transitions to be fired in a conflict set of the Petri nets. This corresponds to select a part type to be processed in the FMS. Towards developing more Intelligent Manufacturing Systems (IMS) we propose a conceptual framework of a futuristic intelligent scheduling system.

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

• Proceedings of the Korea Committee for Ocean Resources and Engineering Conference
• /
• 2001.05a
• /
• pp.26-31
• /
• 2001

Petri nets(PN) have been introduced as a poweful analyzing and design tool for the discrete systems such as sequential control systems. However, one of the important problems in its applications is that the model can not be analyzed easily when we deal with large scale systems because of increase of the number of components of the systems. To overcome this problem, some methods for dividing or reducing of PN have been suggested. In this paper, an approach for hierarchical expression of PN based on Sequential Function Chart(SFC) and Bottom Up oriented Mehodology(BUM) is proposed. Especially, some definition and rules are defined in order to divide and compose sub PN. A measuring tank system will be described as a typical kind of discrete systems and modeled by some sub PN based on the SFC and BUM by the proposed method in this paper.

• Proceedings of the Korea Society for Simulation Conference
• /
• 1992.10a
• /
• pp.12-12
• /
• 1992

This paper proposes an analysis method of Petri nets (PNs) using the relational algebra (RA). More specifically, we represent PNs in relations of the relational model. Based on such representation, we first develop an algorithms for analyzing properties of PNs, such as boundedness, conservation, coverability, reachability, and liveness. The advantage of this approach is as follows: First, the algorithms represented by RA can be easily converted to a query language such as SQL of the widely used, commercial relational database management systems (DBMSs). Second, we can alleviate the problem of state space explosion because relational DBMSs can handle large amounts of data efficiency. Finally, we can use the DBMS's query language to interpret the Petri nets and make simulation.

• Nuclear Engineering and Technology
• /
• v.55 no.3
• /
• pp.861-869
• /
• 2023

This article proposes a novel approach to measure the performance of Safety-Critical Systems (SCS). Such systems contain multiple processing nodes that communicate with each other is modeled by a Petri nets (PN). The paper uses the PN for the performance evaluation of SCS. A set of ordinary differential equations (ODEs) is derived from the Petri net model that represent the state of the system, and the solutions can be used to measure the system's performance. The proposed method can avoid the state space explosion problem and also introduces new metrics of performance, along with their measurement: deadlock, liveness, stability, boundedness, and steady state. The proposed technique is applied to Shutdown System (SDS) of Nuclear Power Plant (NPP). We obtained 99.887% accuracy of performance measurement, which proves the effectiveness of our approach.

• International Journal of Contents
• /
• v.4 no.3
• /
• pp.20-28
• /
• 2008

To obtain realistic performance measures for wireless networks, one should consider changes in performance due to failure related behavior. In performability analysis, simultaneous consideration is given to both pure performance and performance with failure measures. SRN is an extension of stochastic Petri nets and provides compact modeling facilities for system analysis. In this paper, a new methodology to model and analyze performability based on stochastic reward nets (SRN) is presented. Composite performance and availability SRN models for wireless handoff schemes are developed and then these models are decomposed hierarchically. The SRN models can yield measures of interest such as blocking and dropping probabilities. These measures are expressed in terms of the expected values of reward rate functions for SRNs. Numerical results show the accuracy of the hierarchical model. The key contribution of this paper constitutes the Petri nets modeling techniques instead of complicate numerical analysis of Markov chains and easy way of performance analysis for channel allocation under SRN reward concepts.

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