• 한국경영과학회지
• /
• 제30권4호
• /
• pp.99-115
• /
• 2005

For an analysis of the performance of a computer system, the minimum cycle time method has been widely used. The minimum cycle time method is 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. A timed net is a modified version of a Petri net where a transition is associated with a delay time. In the real world, an event is associated with a probability of occurrence. However, a timed net is not equipped with any facility of specifying probability of event occurrence. Therefore, the minimum cycle time method applied on a timed net can easily overlook probabilities of occurrences of events and yield a wrong result. We are proposing 'Timed Net with Probabilities of Choices' where a transition can be associated with both delay time and a probability of occurrence. We also introduce an algorithm for minimum cycle time analysis on a 'Timed Net with Probabilities of Choices'. As an example of application, we are performing an analysis of the location based service system using 'Timed Net with Probabilities of Choices'.

• 품질경영학회지
• /
• 제18권2호
• /
• pp.54-68
• /
• 1990

Contingency response in a FMS system requires that the system be able to identify and evaluate a number of alternatives. This paper is outlined that DSS completes with a problem processor in corporating Timed Petri Nets model, and a data base system. DSS enables the FMS user to get the maximum benefit from a FMS. The structure of this DSS parallels the organizational activities involved in running the FMS. In designing a shop floor controller for FMS, interactions between the different real time, discrete event functions must be established. The specification of the machine tool and material handling system functions working as a concurrent and cooperative system is given in terms of Timed Petri Nets. In addition, the basic concepts and uses of Petri Nets are surveyed. The system to be studied is first modelled by a Timed Petri Nets and then procedure for evaluating the FMS system performance are presented. Numerical examples are studied to illustrate a session of the FMS used-DSS interaction.

• 한국통신학회논문지
• /
• 제24권6B호
• /
• pp.997-1003
• /
• 1999

다양한 멀티미디어 객체간의 시간 관계를 유연하게 서술할 수 있고, 미디어내의 시간 차이를 나타내는 지터와 미디어간의 시간 차이를 나타내는 스큐에 대한 서비스 품질 요구사항을 반영한 동기화 모델이 요구된다. 따라서 본 논문에서는 만족스런 서비스 품질을 제공하는 페트리 네트 기반의 멀티미디어 동기화 모델을 제안한다. 제안한 모델은 실시간 특징을 나타내는 데이터의 서비스 품질을 보장할 수 있는 최대 허용 지터 값과 최대 허용 스큐 값을 적용하였다. 본 논문에서는 페트리네트를 확장하여 분산환경에서 표현할 수 있는 새로운 동기화 규격 모델을 제안하고 제안한 모델의 검증을 위하여 페트리 네트의 두가지 분석방법에 의해 증명을 하였다. 그리고 기존의 모델과 비교하여 성능이 우수함을 보인다. 제안한 모델은 고품질 서비스의 보장을 요구하는 시스템에 적합한 모델이 된다.

• 한국통신학회논문지
• /
• 제18권5호
• /
• pp.695-707
• /
• 1993

Marked Petri Net(MPN) 모델은 최대 병행 활성화 랑데부 수에 따른 통신 복잡도를 분석할 수 있게 해준다. 그러나 이 모델은 시간과 확률 속성(Time and Probability characteristics)을 명시할 수 없음으로 통신 복잡도의 새로운 개념인 실행 시간 복잡도를 분석할 수 없다. 본 논문에서는 이러한 실행 시간 복잡도를 효율적으로 분석하기 위해 MPN에 새로운 제약 조건인 net 절감 법칙, 실행 시간, 그리고 확률 조건을 도입한 Ada Tasking Structure Nets(ATSN)을 제안한다. 끝으로 ATSN 모델을 이용하여 통신 복잡도의 분석 효과를 보인다.

• 대한산업공학회지
• /
• 제23권4호
• /
• pp.669-686
• /
• 1997

In this research, an object-oriented Petri net model for representing a flexible process plan is proposed, which is hierarchically multi-faceted for supporting planning, scheduling, and shop floor control functions. The multi-faceted process plan model consists of the following: a) an object model which represents on object-oriented data model, b) a static model which represents a process flow model with process alternatives, and c) a dynamic model which represents a process activity model with resources alternatives, of a flexible process plan. Petri nets allow the static and the dynamic process plan models to be represented in a unified formalism with an ease of model transformation. The multi-faceted process plan model suggested in this paper, is illustrated with a prismatic port in comprehensive detail.

• 한국원자력학회:학술대회논문집
• /
• 한국원자력학회 1995년도 추계학술발표회논문집(1)
• /
• pp.173-178
• /
• 1995

The verification phase of knowledge base is an important part for developing reliable expert systems, especially in nuclear industry. Although several strategies or tools have been developed to perform potential ewer checking, they often neglect the reliability of verification methods. Because a Petri net provides a uniform mathematical formalization of knowledge base, it has been employed for knowledge base verification. In this work, we devise and suggest an automated tool, called COKEP (Checker Of Knowledge base using Extended Petri net), for detecting incorrectness, inconsistency, and incompleteness in a knowledge base. The scope of the verification problem is expanded to chained errors, unlike previous studies that assumed error incidence to be limited to rule pairs only. In addition, we consider certainty factor in checking, because most of knowledge bases have certainty factors.

• 한국산업정보학회:학술대회논문집
• /
• 한국산업정보학회 1999년도 추계공동학술대회 논문집:21세기지식경영과 정보기술
• /
• pp.769-781
• /
• 1999

Manufacturing systems are usually large, complex, and concurrent in nature that makes it difficult to model and simulate the behavior in advance. The paper proposes an approach, called OPNets, for modeling and validating manufacturing systems. The approach is based on object-oriented high-level Petri nets in which modeling components of Petri net are constructed into object hierarchy. The objects communicate with each other by passing messages. To enhance the reusability and maintainability, a system are developed by object hierarchy. Inheritance among object hierarchy is also supported in OPNets. The modeling scheme of OPNets tries to resolve the complexity problems of Petri net.

• 제어로봇시스템학회논문지
• /
• 제8권4호
• /
• pp.292-298
• /
• 2002

We focus on the slicing off some sub-nets using the transitive matrix. Control flows in the Petri nets is done based on the token flows. One control f]ow explains the independent tokens status and if the token-in divides into several tokens after firing a transition then the control flow divides to several flows, as well. Accordingly, we define that the basic unit of concur-rency (short BUC) is a set of the executed control flows based on the behavioral properties in the net. The BUC is S-invariant which has one control flow. We show the usefulness of transitive matrix to slice off some subnets from the original net based on BUC-through on an example.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2006년 학술대회 논문집 정보 및 제어부문
• /
• pp.181-183
• /
• 2006

This paper proposes an intelligent decision framework for update of the environment model using GSPN(generalized stochastic petri nets). The GSPN has several advantages over direct use of the Markov Process. The modeling, analysis, and performance evaluation are conducted on the mathematical basis. By adopting the probabilistic approach, our decision framework helps the robot to decide the time to update the map. The robot navigates autonomously for a long time in dynamic environments. Experimental results show that the proposed scheme is useful for service robots which work semi-permanently and improves dependability of navigation in dynamic environments.

• Transactions on Control, Automation and Systems Engineering
• /
• 제2권2호
• /
• pp.121-129
• /
• 2000

In this paper, an optimal group control for elevator systems is proposed with timed Petri net based approach. Elevator system is modeled by time Petri nets and hall call response times are estimated with moment generating functions (MGFs) methos, which is applicable to real traffic patterns. Two assignment policies are proposed to satisfy the demands of passengers(i.e. hall/car calls) and to handle exceptional situations. In addition, optimal algorithms are implementated to minimize cost functions. THe performances of the elevator system employing the proposed algorithms are compared with each others in ways of several performance measures by a computer simulation.