• The KIPS Transactions:PartD
• /
• v.11D no.1
• /
• pp.115-122
• /
• 2004

Software system modeling has a goal for finding and solving system's problems by describing and analyzing system model in formal notations. Petri nets, as graphical formalism, have been used in describing and analyzing the software systems such as parallel systems, real-time system, and protocols. In the analysis of Petri nets, general system properties such as deadlock and liveness are analyzed by the reachability analysis. On the other side, specific properties such as functional requirements and constraints are checked by model-checking. However, since these analysis methods are based on enumeration of ail possible states, there nay be state explosion problem, which means that system states exponentially increase as the size of system is larger. In this paper, we propose a new method for mechanically checking system properties with avoiding state explosion problem. At first, system properties are described in property nets then the system model and the property net are composed and analyzed. In the compositional analysis, system parts irrelevant to the specific property are reduced to minimize the analysis domain of the system. And it is possible to mechanically check whether a specific property is satisfied or not.

• Journal of Korea Multimedia Society
• /
• v.7 no.4
• /
• pp.559-566
• /
• 2004

In general, the certainty factors of the fuzzy production rules and the certainty factors of fuzzy propositions appearing in the rules are represented by real values between zero and one. If it can allow the certainty factors of the fuzzy production rules and the certainty factors of fuzzy propositions to be represented by interval -valued fuzzy sets, then it can allow the reasoning of rule-based systems to perform fuzzy reasoning in more flexible manner. This paper presents fuzzy Petri nets and proposes an interval-valued fuzzy backward reasoning algorithm for rule-based systems based on fuzzy Petri nets Fuzzy Petri nets model the fuzzy production rules in the knowledge base of a rule-based system, where the certainty factors of the fuzzy propositions appearing in the fuzzy production rules and the certainty factors of the rules are represented by interval-valued fuzzy sets. The algorithm we proposed generates the backward reasoning path from the goal node to the initial nodes and then evaluates the certainty factor of the goal node. The proposed interval-valued fuzzy backward reasoning algorithm can allow the rule-based systems to perform fuzzy backward reasoning in a more flexible and human-like manner.

• Journal of the Korean Society for Railway
• /
• v.13 no.6
• /
• pp.570-576
• /
• 2010

This paper presents the use of the Petri Net Method for modeling railway tracks. The Petri Net is defined as having the characteristics of a parallel, asynchronous, distributed, inconclusive, statistical, etc. information handling system and is a graphical mathematical modeling tool to study the specifics of active movement. It's proven use can be seen at the Korean type Light Rail testing tracks where they modelled the Petri Net method using the train track encasing the segment, track, turnout, and platform as a singular factor and even though two trains either travelling in the same or opposite directions on a single test track equipped with a sidetrack can travel with the guarantee that the two will not collide.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.7
• /
• pp.2028-2040
• /
• 2000

A study on workflow as an automated business processing system is done recently. This appear proposes a method to verify commitability and integrity of workflow specifications, which include various dependencies between parallel tasks, using petri nets. For this, firstly, e describe briefly workflow specification method using workflow graphs. Secondly, we propose a method to convert a workflow graph into a petri net to verify workflow specifications. Thirdly, we suggest the commitability verification method using petri nets to check whether workflow specifications can commit or not and the integrity verification method to check whether invalid components exist or not. Lastly, we implement the proposed verification method and propose a defect extraction method.

• 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 KIISE:Computer Systems and Theory
• /
• v.27 no.6
• /
• pp.599-607
• /
• 2000

This paper suggests an efficient reachability analysis method of bounded petri nets. Reachability analysis is a fundamental basis for studying the dynamic properties of any discrete event systems. However, it takes at least exponential execution time and memory space to verify in general petri nets. That is, state space explosion problem may occur. In this paper, we attack problems of previous approaches - state space explosion and restrictions to applicable petri net classes - by formulating the reachability problem as set operation over structural relations among places on an unfolding.

• 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 Society for Bioinformatics Conference
• /
• 2005.09a
• /
• pp.348-353
• /
• 2005

In this paper we discuss the formulation and the analysis of a signaling pathway by Petri nets. In order to explicitly and formally describe the molecular mechanisms and pathological characteristics of signaling pathways, we propose a new modeling method to construct signaling pathways on the basis of formal representation of Petri net. Our proposed extended algorithm effectively finds basic enzymic components of signaling pathways by employing T-invariants of Petri nets with considering the origination leading to an occurrence of inhibition functions than existing methods. An application of the proposed algorithm is given with the example of Interleukin-1 and Interleukin-6 signaling pathways.

• Proceedings of the KIEE Conference
• /
• 1988.11a
• /
• pp.450-454
• /
• 1988

In order to represent and analyze distributed system design, the model based on an extended form of Petri nets, which enables one to represent both the structure and the behavior of a distributed system, is predented. Behavioral properties of the design representation are verified by translating the extended Petri net into an equivalent ordinary Petri net. The model emphasizes the unified representation of control flows, hierarchical structure, and distributed system state. Modeling technique isemployed for the performance and function analysis of flexible manufacturing system with a set of processors.

• Proceedings of the KIEE Conference
• /
• 1999.07c
• /
• pp.1136-1138
• /
• 1999

This paper describes a new method of the modeling of protection system and fault diagnosis in power systems using Petri nets. The Petri net models of protection system are compose of the operating process of protective devices and the fault diagnosis process. Fault diagnosis model which makes use of the nature of Petri net is developed to overcome the drawbacks of methods that depend on operator knowledge. The proposed method can reduce processing time and increase accuracy when compared with the traditional methods. And also this method covers online processing of real-time data from SCADA.