• Journal of the Korea Safety Management & Science
• /
• v.13 no.3
• /
• pp.1-8
• /
• 2011

The overall goal of a safety based railroad system is either to eliminate hazards in designing or to minimize the possibility of it. In order to indicate system safety or low risk although it may not be possible to achieve zero risk conditions, first, it shall ensure that any disasters would occur due to system operation because the prescribed specifications are properly fulfilled and there are no failures of any kind. Second, the risk of faults or failures leading to a mishap must be eliminated or minimized by using fault-tolerance or fail-safe procedures. This paper will attempt to summarize the personal and social risk criterion at widely scattered points, presently used as a safety approach in all over EU, in order to establish the step by step procedures of the detailed standard for railway facilities. In addition, we present the new safety analysis method using the SIL-based evaluation standard and the Reachability Graph of the Petri Net.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.12 no.1
• /
• pp.85-92
• /
• 1998

In this paper, we design a sequential system controller, which is capable of processing parallel sequence, on the basis of analysis of control specification described by Petri Net with incidence matrix. The sequential system controller consists of input conditioning unit and petri net control unit which is composed of the token control unit and firing unit. The firing unit determines the firing condition of the transfer signal on the basis of the token status of token control unit. By the proposed scheme, we can easily develop and implement the sequential system controller of automated warehousing system, automated transportation system, elevator system, and so on, as it is possible to modify control specification by changing simply the content of incidence matrix ROM and to expand easily functional capacity as the result of modular design.design.

• Journal of the Korea Society for Simulation
• /
• v.17 no.3
• /
• pp.75-83
• /
• 2008

A deadlock is a condition in which the excessive demand for the resources being used by others causes activities to stop and it is one of the important problems in process control system to detect and prevent deadlocks. While the reachability analyze methods or divide subnets for analyzing methods are well used, it requires a lot of times and effects to analyze the detection of the deadlock status. Furthermore, it could not be effective if the model is complex or huge. Therefore, it is necessary to develop a new and more efficient deadlock detection algorithm. In this paper, a deadlock detection conditions after analyzed the Petri Net using the transitive matrix has been proposed to solve these problems. For presenting the results, the suggested deadlock detection algorithm was also adapted to an illustrated FMS (Flexible Manufacturing System) model.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.1
• /
• pp.173-181
• /
• 2009

This paper proposes an algorithm to transform RDF(Resource Description Framework) models for ontology into CPN(Colored Petri Net) models. The algorithm transforms the semantics of the RDF model into the topology of the CPN by mapping the classes and the properties of the RDF onto the places of the CPN model then reflects the RDF statements on the CPN by representing the relationships between them as token transitions on the CPN. The basic idea of reflecting the RDF statements on the CPN is to generate a token, which is an ordered pair consisting of two tokens (one from the place mapped into the subject and the other one from the place mapped into the object) and transfer it to the place mapped into the predicate. We have actually built CPN models for given RDF models on the CNPTools and inferred and extracted answers to the RDF queries on the CPNTools.

• The Journal of Society for e-Business Studies
• /
• v.13 no.3
• /
• pp.67-83
• /
• 2008

Web caching server is one of the important components of any web site, as it makes the access of users to web content much faster while balancing the network and server load. There are many caching approaches proposed in order to solve this problem. Classically, we know several caching algorithms like FIFO, LRU, LRU-min and etc. Most of them have their advantages and disadvantages based on specific context. The purpose of this paper is to introduce the new concept of caching objects along with their related content and test the performance of the proposed caching method using CPN Tools simulator program. It is generally known that the use of Colored Petri Nets(CPNs) for modeling the simulation of new idea is one of the popular methods of system evaluation throughout software development projects. Moreover it could be very handy in describing the overall logic of the system. The CPN Tools is one of the most robust simulator programs which supports all necessary tools and functions to build and run the simulation model for CPN. Therefore in this paper, we will use CPN Tools software in order to build a simulator for our innovative caching approach named as web caching with related content. Then we will analyze the results derived from the simulation of our model and will make corresponding conclusions.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.8
• /
• pp.3656-3671
• /
• 2016

Most of the research in the area of wireless communications exclusively relies on simulations. Further, it is essential that the mobility management strategies and routing protocols should be validated under realistic conditions. Most appropriate mobility models play a pivotal role to determine, whether there is any subtle error or flaw in a proposed model. Simulators are the standard tool to evaluate the performance of mobility models however sometimes they suffer from numerous documented problems. To accomplish the widely acknowledged lack of formalization in this domain, a Coloured Petri nets (CPNs) based random direction mobility model for specification, analysis and validation is presented in this paper for wireless communications. The proposed model does not suffer from any border effect or speed decay issues. It is important to mention that capturing the mobility patterns through CPN is challenging task in this type of the research. Further, an appropriate formalism of CPNs supported to analyze the future system dynamic status. Finally the formal model is evaluated with the state space analysis to show how predefined behavioral properties can be applied. In addition, proposed model is evaluated based on generated simulations to track origins of errors during debugging.

• Journal of Computing Science and Engineering
• /
• v.9 no.1
• /
• pp.9-19
• /
• 2015

The most important challenge in the region-based abstraction method as an approach to compute the state space of time Petri Nets (TPNs) for model checking is that the method results in a huge number of regions, causing a state explosion problem. Thus, region-based abstraction methods are not appropriate for use in developing practical tools. To address this limitation, this paper applies a modification to the basic region abstraction method to be used specially for computing the state space of TPN models, so that the number of regions becomes smaller than that of the situations in which the current methods are applied. The proposed approach is based on the special features of TPN that helps us to construct suitable and small region graphs that preserve the time properties of TPN. To achieve this, we use TPN-TCTL as a timed extension of CTL for specifying a subset of properties in TPN models. Then, for model checking TPN-TCTL properties on TPN models, CTL model checking is used on TPN models by translating TPN-TCTL to the equivalent CTL. Finally, we compare our proposed method with the current region-based abstraction methods proposed for TPN models in terms of the size of the resulting region graph.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1995.04a
• /
• pp.193-200
• /
• 1995

A shop floor control system(SFCS), a central part of agile manufacturing, performs the production activities required to fill orders. In order to effectively control these activities, CSCW (computer supported cooperative work) is adopted where a supervisor does not exist. In this paper, we define functional perspective of CSCW-based shop floor control using planning, scheduling, and execution functions. In particular, we focus on an execution model that can coordinate the planning and scheduling functions. Execution can be defined informally as a function that downloads and performs a set of scheduled tasks. Execution is also responsible for identifying and resolving various errors whether they come from hardware or software. The purpose of this research is to identify all the execution activities and solving techniques under the assumptions of CSCW-based heterarchical control architecture. This paper also proposes a classification scheme for execution activities of CSCW-based heterarchical control architecture. Petri-nets are used as a unified framework for modeling and controlling execution activities. For solving the nonexistence of a supervisor, A negotiation-based solution technique is utilized.

• Proceedings of the KSR Conference
• /
• 2011.10a
• /
• pp.1263-1268
• /
• 2011

Rail infrastructure manager and operators shall establish emergency response plans. Emergency Response Planning Activities expanded coincidence events should be modeled. Identify the emergency response organization for the purpose of knowledge is required. In other words, control concepts and skills needed core elements. Structured analysis & design technic methodology is Compared with other modeling techniques through a simple graphical model is visualized. The information contained in a model real problems that considering the state of the system activities, so that knowledge acquired in situations where the modeling becomes possible. In this paper, using structured analysis techniques, infrastructure deployment model of the proposed features. In addition to emergency response planning in the 1960s in Germany, Karl Petrie (Carl Petri) devised various means of modeling the situation presents a Petri net model.

• IE interfaces
• /
• v.22 no.1
• /
• pp.10-16
• /
• 2009

In this paper, we propose an efficient search algorithm for finding an optimal schedule to minimize makespan, while avoiding deadlock situation in Flexible Manufacturing Systems (FMS) with finite capacity, in which each job needs to be processed in several job stages for completion. The proposed algorithm uses a modeling and control method based on Petri-net. Especially, we improve the efficiency of the search algorithm by using a priority rule and an efficient bounding function during the search procedure. The performance of the proposed algorithm is evaluated through a numerical experiment, showing that it holds considerable promise for providing an optimal solution efficiently comparing to past work.