• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.665-668
• /
• 2000

In this paper, we are focused on the analysis of Petri nets model using the subnet. Specially, we are proposes a divide-conquer method of Petri nets under the condition of one-boundedness for all the Petri nets. The usefulness of the approach is shown by applying the proposed techniques to a illustration model.

• Journal of Korea Multimedia Society
• /
• v.9 no.11
• /
• pp.1503-1514
• /
• 2006

Today, consumers can access Internet from everywhere, therefore most commercial and other organizations provide their services on the Web. As the result, countless Web service systems are already on the Internet and more systems are under construction. Therefore, many researches of verifying that the system to be constructed will not have any deadlock and will run successfully without any problem at the early stage of design have been performed. Several Petri net based verification methods have also been published. However, they have focused on building Petri net models of Web service systems and none of them introduces efficient analysis methods. As a mathematical technique with which we can find the minimum duration time needed to fire all the transitions at least once and coming back to the initial marking in a timed net, the minimum cycle time method has been widely used in computer system analysis. A timed net is a modified version of a Petri net where a transition is associated with a delay time. A delay time used in a timed net is a constant even though the duration time associated with an event in the real world is a stochastic number in general. Therefore, this paper proposes 'Mixedly Distributed Stochastic Timed Net' where a transition can be associated with a stochastic number and introduce a minimum cycle time analysis method for 'Mixedly Distributed Stochastic Timed Net'. We also introduce a method of analysing a Web service system's response time with the minimum cycle time analysis method for 'Mixedly Distributed Stochastic Timed Net.'.

• The Journal of the Korea Contents Association
• /
• v.8 no.10
• /
• pp.64-75
• /
• 2008

The concept of a hyper-presentation, as an extension of a hypermedia, is the presentation in which time-varying multimedia presentations are dynamically linked together and a hyperlink's context can be changed over time at any time during a continuous presentation. While this concept provides users with a flexible and powerful presentation for their descriptions of the multimedia datum, inconsistency problems in the synchronized presentations occur by hyper links can be introduced. This paper introduces a method of describing the hyper-presentation using petri-net and propose a methods of checking It's inconsistent hyper link loop in the hyper-presentation description.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.20 no.42
• /
• pp.9-19
• /
• 1997

최근 제조업체들은 고객의 다양한 요구와 제품의 Life Cycle 단축에 따른 제조환경의 변화 에 직면하고 있다. 이러한 변화에 능동적으로 대처하기 위한 수단으로 효율성과 유연성이 크게 부각된 유연생산시스템(FMS)의 역할은 대단히 크다. 따라서, 본 연구에서는 유연생산시스템을 평가하고 모델링하는 도구인 Petri net 모델링 기법을 이용하여 효율성이 뛰어난 흐름생산방식을 적용한 복잡한 유연생산 시스템의 통제시스템 모델 설정과 시스템정지(deadlock) 예방에 대한 분석을 하였으며, AGVs의 셀이동 생산시스템을 제어할수 있는 FMS의 계층적 TPN 모델링을 구축하였다.

• Proceedings of the KIEE Conference
• /
• 2003.11b
• /
• pp.219-222
• /
• 2003

본 논문에서는 주어진 자동화 시스템에 대하여 Critical Path 기법을 적용한 최적화 연구를 수행하였다. 탄약 운반 자동화 시스템에 대하여 공정순서와 시간개념이 들어간 Timed Petri-Net을 이용한 이산사건 공정모델을 구축하였으며, 이를 기초로 초기조건 및 제약조건을 고려하여 제악탐색기법을 이용하여 Critical Path를 찾고 여유 공정을 산출항으로써 공정 시간 최적화를 수행하였다.

• Industrial Engineering and Management Systems
• /
• v.4 no.2
• /
• pp.184-191
• /
• 2005

In this article we study the feasibility of the Ant Colony Optimisation (ACO) algorithm for finding optimal Kanban allocations in Kanban systems represented by Stochastic Petri Net (SPN) models. Like other optimisation algorithms inspired by nature, such as Simulated Annealing/Genetic Algorithms, the ACO algorithm contains a large number of adjustable parameters. Thus we study the influence of the parameters on performance of ACO on the Kanban allocation problem, and identify the most important parameters.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.205-205
• /
• 2000

In this paper, we are proposed an analysis method of the operation schedule in FMS using Time Petri Nets(TPN) unfolding. TPN's unfolding is one of the analysis methods after changed non-cyclic net from the concurrent net without to expand the state explosion. We are illustrated this proposed to analyze a schedule problem in Ratio-driven FMS modeling.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2012.01a
• /
• pp.91-94
• /
• 2012

융합 시스템의 표본으로 주목받고 있는 IPTV는 라디오 전파 방송이 아닌 인터넷을 통하여 사용자들에게 멀티미디어 콘텐츠를 제공한다. IPTV 응용 분야에는 VOD(Video On Demand) 서비스, 교육, 문화, 오락 등 다양한 양방향 응용 서비스가 포함된다. 본 연구에서는 이러한 IPTV 시스템을 페트리 넷으로 표현하고, CPNTools를 이용하여 페트리 넷을 분석함으로써 IPTV 시스템이 막힘없이 운행됨을 검증한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.04a
• /
• pp.83-88
• /
• 2000

본 논문은 mobile agent 시스템 설계의 예를 보인다. 본 시스템 설계에서 구축될 시스템의 사양은 자연어로 묘사되어 있다고 가정한다. 본 시스템 설계 과정은 다음과 같다. 첫째, 시스템 사양으로부터 필요한 사이트들을 분별하고, 둘째, 사이트간에 송수신 되는 정보들을 분별해, 이들 정보 개체들을 각각 한 개의 agent로 구현한다. 셋째, 각 Agent가 수행할 과업을 Petri net으로 정확히 표현한다. Agent가 정의되는 위치에 따라 필요한 통신량이 좌우됨으로 통신량을 최소화시키는 관점에서 Agent 정의의 위치를 결정한다.

• 제어로봇시스템학회:학술대회논문집
• /
• 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.