• Journal of The Korean Association of Information Education
• /
• v.13 no.1
• /
• pp.96-104
• /
• 2009

We want to achieve the reliable information system such as e learning system in the internet environments. The difficulty of the program reliability estimation comes from faults that occurred from program and data files are distributed among several servers. This paper is focus on a modeling approach based on Colored Petri Nets to estimate the program reliability in an internet environment. The procedure of analyzing the reliability is as follows. At first, we propose an internet program model. This model is transformed into a Colored Petri net, and the reliability is estimated. We adapt this model to the analyzing the reliability in the internet environment. This method is very simple, and is very helpful to develope program

• Journal of KIISE:Software and Applications
• /
• v.27 no.3
• /
• pp.210-216
• /
• 2000

Place/Transition(P/T) nets has been used in protocol verification and concurrent system verification since it is suitable for describing concurrency and provides several well-established verification techniques. And it has been used as a base formalism for such high-level Petri nets as colored Petri nets, object-oriented Petri nets and etc. However, when analyzing complex models using P/T nets and P/T nets-based high-level Petri nets, there may be state explosion in reachability analysis due to improper handling of concurrency. In this paper, we define a structural concurrency in P/T nets, propose a partitioning algorithm based on the detected structural concurrency, and provide analysis techniques for such properties as boundedness of places and liveness of transitions, which are performed on compositional reachability graphs. The analysis techniques based on Petri net slices can be used in efficiently analyzing P/T nets-based high-level Petri net models as well as P/T net models.

• Proceedings of the Korean Nuclear Society Conference
• /
• 1997.10a
• /
• pp.271-276
• /
• 1997

Verification is a process aimed at demonstrating whether a system meets it's specified requirements. As expert systems are used in various applications, the knowledge base verification of systems fakes an important position. The conventional Petri net approach that has been studied recently in order to verify the knowledge base is found that it is inadequate to verify the knowledge base of large and complex system, such as alarm processing system of nuclear power plant. Thus, we propose an improved method that models the knowledge base as enhanced colored Petri net. In this study. we analyze the reachability and the error characteristics of the knowledge base and apply the method to verification of simple knowledge base.

• International Journal of Advanced Culture Technology
• /
• v.8 no.4
• /
• pp.242-248
• /
• 2020

Most works of art are done through brokers, and transaction details are not disclosed to the public and are always at risk of tampering. To solve these problems, many Artworks Blockchain Platforms that apply blockchain technology to art transactions are being used. Several companies are currently operating these platforms, but since various blockchain platforms are operated according to the content, the operating methods of each platform are different, and a related model is needed to solve these problems due to compatibility issues between platforms. In this paper, we collect the latest Artworks Blockchain Platforms data, and based on this, we will create and analyze the Color Petri net model of Artworks Blockchain Platform.

• International Journal of Advanced Culture Technology
• /
• v.10 no.4
• /
• pp.420-426
• /
• 2022

Developing a machine learning model and putting it into production goes through a number of steps. Automated Machine Learning(AutoML) appeared to increase productivity and efficiency by automating inefficient tasks that occur while repeating this process whenever machine learning is applied. The high degree of automation of AutoML models allows non-experts to use machine learning models and techniques without the need to become machine learning experts. Automating the process of applying machine learning end-to-end with AutoML models has the added benefit of creating simpler solutions, generating these solutions faster, and often generating models that outperform hand-designed models. In this paper, the AutoML data is collected and AutoML's Color Petri net model is created and analyzed based on it.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.13 no.2
• /
• pp.449-456
• /
• 2018

The advent of cryptography has become a means of obtaining real monetary benefits to hackers, which has recently led to a surge in the number of Ransomware and the associated damage has increased significantly. It is expected that malicious codes will be expanded to new areas by meeting passwords, and Ransomware will be further increased in the future. To solve these problems, we need a model that can detect and block intrusion of Ransomware by analyzing the intrusion path of Ransomware. In this paper, we collect and analyze the data of Ransomware, and create and analyze Ransomware's color Petri net model.

• Journal of Institute of Control, Robotics and Systems
• /
• v.5 no.6
• /
• pp.724-733
• /
• 1999

An effective method of system modeling and dynamic scheduling for the back-end line of semiconductor manufacturing is proposed. The virtual factory, describing semiconductor manufacturing line, is designed in detail, and then a Petri net model simulator is developed for operation and control of the modular cells of the virtual factory. The petri net model is a colored timed Petri nets (CTPNs). The simulator will be utilized to analyze and evaluate various dynamic status and operatons of manufacturing environments. The dynamic schedulaer has a hierarchical structure with the higher for planning level and the lower for dynamic scheduling level. The genetic algorithm is applied to extract optimal conditions of the scheduling algorithm. The proposed dynamic scheduling is able to realize the semiconductor manufacturing environments for the diversity of products, the variety of orders by many customers, the flexibility of order change by changing market conditions, the complexity of manufacturing processes, and the uncertainty of manufacturing resources. The proposed method of dynamic scheduling is more effective and useful in dealing with such recent pressing requirements including on-time delivery, quick response, and flexibility.

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

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10a
• /
• pp.258-260
• /
• 1998

CPN(Colored Petri Net)은 시스템을 분석하고 설계하는 모델링 기법인 페트리넷의확장형으로서, 토큰에 color을 부여하여 자료흐름까지 고려할 수 있다. 이 연구에서 Estelle 로 기술된 프로토콜 명세를 Design /CPN에 적용가능한 CPN으로의 변환 방법을 제안하였다. 그리고 변환된 CPN을 Design /CPN에 입력하여 얻은 OG(Occurrence Graph)와 각 노드에 대한 내부 정보인 descriptor를 이용하여, 자료흐름이 고려된 보다 간편하고 효율적인 테스트 케이스를 생성하였다.