• Journal of Korea Game Society
• /
• v.15 no.5
• /
• pp.49-56
• /
• 2015

As the popularity of casual games, they are increasing the needs to satisfy personal dispositions and the gameplay requirements of the various users in the game development process. These require analysis of action patterns of gameplay of various users in the testing phase of the game development. In this paper, we propose a method to analyze action patterns of gameplay through Petri net model simulation with gameplay metrics data. The proposed method has practical simulation environments because of using gameplay metrics data, and it can analyze diversely like reachability, coverbility, and liveness given by Petri net model analysis. An application example of the proposed method using a Petri net modeling tool GPenSIM v4.0 is given to analyze the patterns of gameplay in game Pacman. The results of simulations is presented. The presented results show that the proposed method can analysis patterns of gameplay diversely.

• Proceedings of the KIEE Conference
• /
• 2000.11d
• /
• pp.679-681
• /
• 2000

This thesis presents a analysis method of hybrid synthesis petri net for automated manufacturing systems in discrete event dynamic system. There are many errors that can happen to petri net modeling of complex systems because petri net modeling process has so many steps. A new matrix analysis method presented in this thesis can confirm the property of petri net such as boundedness, liveness and reversibility, modify errors which can be occurred in modeling.

• Proceedings of the KIEE Conference
• /
• 1999.07b
• /
• pp.838-840
• /
• 1999

In this paper, modeling and analysis of discrete event systems by temporal logic frame works and petri net is considered. The reachability tree of the petri net can be used to solve the safeness, boundedness, conservation and coverability problems of discrete event systems. But the reachability tree of the petri net do not solve reachability and liveness problems in general. We proposed a method that synthesised the petri net and the temporal logic frameworks. This method slove some problems of petri net by logical representation of temporal logic frameworks.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.60 no.7
• /
• pp.1347-1353
• /
• 2011

While most of the existing protection schemes have been designed with local information around individual components, these local schemes are not considered capable of protecting the modern electric power gird with growing complexity. Recent blackouts in North America and Europe have renewed the emphasis on coordinated protection and control actions to avoid systemwide blackouts, utilizing all of the available grid information. Thus, this paper proposes a new methodology, Agent-based Colored Petri Net (ACPN) modeling for systematically representing, modeling and analyzing information flows and interactions among the entities of the electric power grid. The paper demonstrates its efficacy and accuracy by investigating an ACPN model of a wide area protection system for a typical power grid. The proposed modeling and analysis schemes may further provide a framework to help assure reliability and interoperability of diverse smart grid components.

• Korean Journal of Computational Design and Engineering
• /
• v.13 no.1
• /
• pp.36-44
• /
• 2008

This paper proposes a modeling and simulation process of a panel production line (PPL) in a shipyard. The panel production line is an assembly process to produce a main panel of a flat block and a curved block. In this paper, its activity analysis is carried out using expression of IDEF0, and its process is qualitatively and quantitatively analyzed and modeled by Petri Nets. A commercial discrete event simulation tool, $QUEST^{TM}$, is used for virtual PPL and simulation. The modeling results by Petri Net are mapped to elements of the simulation tool. Finally, an integrated simulation environment of PPL is implemented in order to efficiently utilize the virtual PPL model. With the help of IDEF0 and Petri Nets, we could systematically analyze and describe the PPL process that are characterized as being concurrent, asynchronous, distributed, parallel, nondeterministic, and/or stochastic. Also, the dynamic and concurrent activities of a PPL system were able to be simulated. A timing concept can be included into the Petri nets model to evaluate performance and dependability issues of the system.

• Journal of Information Technology Applications and Management
• /
• v.12 no.1
• /
• pp.157-172
• /
• 2005

Recently, location-based service (LBS) is a hot issue in the field of computer applications. So many papers introducing new techniques of implementing a LBS and new application fields of LBS have been published recently. However, to the best of our knowledge, none of them discusses feasibility test in the prior to the implementation. The importance of a feasibility test for a design prior to the implementation cannot be overemphasized. This paper presents a method of feasibility test for a LBS design. Our method performs three steps. At the first step, we build a Petri net model of the LBS system which is depicted in natural language. The second step is to analyse the Petri net to find errors and flaws in the design. We also improve the Petri net model by fixing the errors and flaws in this step. A feasibility test is the third and final step. In this step. we verify if the design satisfies the user's requirement in the senses of quality of service (QoS) and of minimizing the implementation cost. The third step is performed in the manner of mathematical analysis of the Petri net.

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

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.19 no.3
• /
• pp.28-36
• /
• 1982

Petri nets have been used for medeling a wide variety of systems from computer to social systems. This paper disusses Petri nets in the context of mathematical representation and its associated bag theory. The method of modeling systems such as event-condition, computer progranm computer operation and PERT chart is discribed and their Petri net representation are presented. Finally Petri net representation of tunnel diode oscillator circuit and the analysis of the circuit using Petri net are discussed with the program and results.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.59.5-59
• /
• 2001

Multi-agent robot system is the system which executes by cooperating with each robots and controlling several robots. Capability and function of each robot must be considered for cooperation behavior. Furthermore, it is necessary to analyze the given environment and to replace complex task with some simple tasks. Analysis of the given environment and role assignment for the given tasks are composed of discret event. In this paper, the hierarchical controller for multi-agent robot system using the petri-net state diagram is proposed. The proposed modeling method is implemented for soccer robot system. The effectiveness of proposed modeling method is shown through experiment.

• Proceedings of the IEEK Conference
• /
• 2002.07b
• /
• pp.971-974
• /
• 2002

Petri net is an effective modeling tool for concurrent systems. Liveness problem is one of analysis problems in Petri net theory verifying whether the system is free from any local deadlocks. It is well known that computational complexity of liveness problem of general Petri net is deterministic exponential space. Some subclasses, such as marked graph and free choice net, are suggested where liveness problem is verified in less complexity. This paper studies liveness of siphon containing circuit (SCC) net. Liveness condition based on algebraic inequalities is shown. Then polynomial time decidability of liveness of SCC net is derived, if the given net is known to be an SCC net a priori.