• The Transactions of the Korea Information Processing Society
• /
• v.6 no.7
• /
• pp.1817-1824
• /
• 1999

How to efficiently and optimally schedule iterative is one of the critical issues in FMC(Flexible Manufacturing Cell). In this paper, we apply transformation rules to find the solution of the scheduling problem in FMC. These kinds of rules have already been applied for the analysis of autonomous Petri nets. Here in, transformation is intended to preserve the existence of at least one optimal solution for the scheduling problem. Some transformations rules to reduced TPN's size without changed the initial characteristics are proposed and applied to analyze the scheduling problem of FMC.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.04a
• /
• pp.1255-1258
• /
• 2012

클라우드 컴퓨팅에서 사용되는 웹 서비스들은 워크플로우에 따라 서비스가 설계되어 조합된다. 대표적인 웹서비스 명세언어인 BPEL의 검증방법에는 Petri nets, Abstract State Machine(ASM), BPE-Calculus 등이 존재한다. 하지만 기존의 방법은 설계와 검증이 분리되어 있어 일관성이 부족하고, 시각화 문제, 동일성, 시간에 대한 제약조건의 문제점이 존재한다. 이에 대한 해결방안으로 이동성, 재구성성, 동일성, 시간속성 등의 새로운 분석 방법을 제시하는 Onion 언어가 제안되었다. 본 논문은 BPEL로 명세된 서비스를 Onion 시스템에 적용시키기 위한, 변환 과정에 대해서 다룬다. 이에 대한 과정으로 BPEL의 액티비티를 Onion으로 변환하고, 워크플로우 패턴을 적용하여, 3 가지 패턴을 Onion OVL로 변환을 적용하였다. 이를 통하여 BPEL을 Onion OVL로 변환하는데 문제가 없음을 보였으며, 효율적인 표현이 가능함을 보였다. 추후 Onion 시스템의 컴포넌트로 적용하여, BPEL로 작성된 서비스를 Onion 시스템을 통해 분석/검증할 수 있다.

• Journal of KIISE:Computing Practices and Letters
• /
• v.5 no.4
• /
• pp.457-466
• /
• 1999

원자력 발전소 계측 제어 시스템, 의료 관련 시스템, 항공 관련 시스템 등 실생활과 밀접한 시스템에 소프트웨어의 사용이 점차 증가하고 있다. 이러한 시스템에서 소프트웨어의 오류는 예기치 않는 사고를 유발하여 인명, 재산상의 심각한 타격을 줄 수 있다. 그러므로 고신뢰도 소프트웨어의 개발 시에는 반드시 시스템의 안전성을 보장해 주어야 한다. 역방향 안전성 분석 방법은 시스템의 안전성을 분석하는 한가지 방법으로서 시스템의 위험 상태를 정의하고 그 위험의 원인들을 추적, 분석함으로써 안전성에 대한 효율적인 분석을 수행할 수 있는 장점을 갖는다. 이 논문에서는 소프트웨어 개발 초기 단계에서 안전성을 분석할 수 있는 방법으로 Colored Petri Nets(CPN)에 기반을 둔 역방향 안전성 분석 방법을 제시한다. 또한 CPN 역방향 안전성 분석 도구인 SAC(Safety Analyzer for CPN)의 설계 및 구현에 대해 언급한다. SAC은 기존의 상용 CPN 모델링 도구인 Design/CPN과 연계하여 사용될 수 있으므로 CPN으로 모델링된 시스템의 안전성을 분석할 수 있다는 장점이 있다. 이 논문에서는 예제로 자동 교통 제어 시스템의 일부를 CPN으로 모델링하고 SAC을 이용한 분석 과정을 기술한다.Abstract In safety-critical systems such as nuclear power plants, medical machines, and avionic systems which are closely related with our livings, the usage of software in the controlling part is growing rapidly. Since software errors in safety-critical systems may cause serious accidents leading to financial or human damages, system safety should be ensured during and after development of a system. A backward safety analysis technique defines system hazards and tries to trace their causes by analyzing system states backward. In this paper, we provide a backward safety analysis technique based on Colored Petri Nets(CPN), which is applicable to the early software development phase. Also Safety Analyzer for CPN(SAC), the supporting tool, is designed and implemented. Since SAC is compatible with Design/CPN, a commercial tool for supporting CPN, it can be applicable to analyze safety in practical problems. As an example, we model a part of the traffic light control system using CPN and analyze safety properties of the model using the SAC tool.

• The KIPS Transactions:PartC
• /
• v.8C no.1
• /
• pp.97-104
• /
• 2001

In this paper, we present a new hierarchical model for performance analysis of channel allocation and packet service protocol in wireless n network. The proposed hierarchical model consists of two parts : upper and lower layer models. The upper layer model is the structure state model representing the state of the channel allocation and call service. The lower layer model, which captures the performance of the system within a given structure state, is the wireless packet retransmission protocol model. These models are developed using SRN which is an modeling tool. SRN, an extension of stochastic Petri net, provides compact modeling facilities for system analysis. To get the performance index, appropriate reward rates are assigned to its SRN. Fixed point iteration is used to determine the model parameters that are not available directly as input. That is, the call service time of the upper model can be obtained by packet delay in the lower model, and the packet generation rates of the lower model come from call generation rates of the upper model.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.5B
• /
• pp.448-456
• /
• 2003

In this parer, an ABR (Available Bit Rate) congestion control algorithm for voice transmission in ATM networks was proposed. To deal with the network congestion problem, not only the buffer level of a switch but also the variation of the buffer level were considered. Also, to resolve the unfairness among sources where the bit transfer rates vary, a loading factor that is used to adjust the bit rate was introduced. To show the superiority of this paper over others, simulation was done with a network of 7 voice sources and 4 switches, which was represented by Petri net model. ExSpect was used for simulation. The simulation results showed that there was improvement in network utilization and that unfairness among sources were resolved a lot.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.39 no.6
• /
• pp.53-67
• /
• 2002

The multimedia synchronization is one of the key issues to be resolved in order to provide a good quality of multimedia related services, such as Video on Demands(VoD), Lecture on Demands(LoD), and tele-conferences. In this paper, we introduce an adaptive multimedia synchronization algorithm using the level of buffers and load of servers, which are modeled and analyzed by ExSpect, a Petri net based simulation tool. In the proposed algorithm, the audio and video buffers are divided to 5 different levels, and the pre-defined play-out speed controller tries to make the buffer level to be normal in different temporal relations between multimedia streams using buffer levels and server loads. Because each multimedia packet is played by the pre-defined play-out speed, the media data can be reproduced within the permissible limit of errors while preserving the level of buffers to be normal. The proposed algorithm is able to handle and support various communication restrictions between providers and users, and offers little jitter play-out to many users in networks with the limited transmission capability. The performance of the developed algorithm is analyzed in various network conditions using a Petri net simulation tool.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.2045-2050
• /
• 2003

This paper describes the development of service robotic systems with the Tripodal schematic control architecture. We show practical advantages of the proposed architecture by giving examples of our experience. First, we explain how to add new task using Tripodal architecture approach. The Tripodal architecture provides some crucial organizing principles and core components that are used to build the basis for the system. Thus, the newly developed behaviors, motion algorithm, knowledge, and planning schemes are arranged so as to guarantee the efficiency of the performance of components. Second, we describe the reusability and scaleability of our architecture by introducing the implementation process of the guide robot Jinny. Most of modules developed for former robots like PSR-1 and PSR-2 systems are used directly to the Jinny system without significant modification. Experimental results clearly showed that the developed strategy is useful, even if the hardware configurations as well as software algorithms are more complex and more accumulating.

• Journal of Korean Institute of Industrial Engineers
• /
• v.25 no.1
• /
• pp.87-99
• /
• 1999

A shop floor control system(SFCS) performs the production activities required to fill orders. In order to effectively control these activities, the autonomous agent-based heterarchical shop floor control architecture is adopted where a supervisor does not exist. In this paper, we define functional perspective of the heterarchical shop floor control using planning, scheduling, and execution modules. In particular, we focus on an execution module that can coordinate the planning and scheduling modules and a general execution module that easily can be modified to execute the other equipment. The execution module can be defined informally as a module that downloads and performs a set of scheduled tasks. The execution module 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 the heterarchical control architecture. And we model the execution module in object-oriented modelling technique for generalization. The execution module modeled in object-oriented concept can be adopted to the other execution module easily. This paper also proposes a classification scheme for execution activities of the 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 IEEK Conference
• /
• 2002.07b
• /
• pp.955-958
• /
• 2002

A workflow is a flow of work supported by computers. An instance of a workflow is called case. Companies need to constantly refine their current workflows in order to meet various requirements. The change of current workflows is called dynamic change of the workflow. Since Ellis et al. proposed three change types, Flush, Abort, and Synthetic Cut-Over in 1995, various change types have been proposed. A promising change type is Migrate proposed by Sadiq et al., because Migrate changes workflow definitions immediately and makes the redo of cases minimum. However, the formal modeling and time-dependent analysis of Migrate has not been done. This paper proposes a method of computing change time of Migrate dynamic changes for time-dependent analysis. Change time is a measure for evaluating dynamic changes. We first show a Petri-nets-based model of Migrate dynamic changes. Then we present a method of computing change time based on the net model. Finally, we apply the method to 270 examples, and show experimental results, and comparison with Ellis et al..'s three change types.

• Management Science and Financial Engineering
• /
• v.14 no.1
• /
• pp.23-34
• /
• 2008

In this study, we consider stationary waiting times in a Poisson driven single-server m-node queues in series. We assume that service times at nodes are independent, and are either deterministic or non-overlapped. Each node excluding the first node has a finite waiting line and every node is operated under a FIFO service discipline and a communication blocking policy (blocking before service). By applying (max, +)-algebra to a corresponding stochastic event graph, a special case of timed Petri nets, we derive the explicit expressions for stationary waiting times at all areas, which are functions of finite buffer capacities. These expressions allow us to compute the performance measures of interest such as mean, higher moments, or tail probability of waiting time. Moreover, as applications of these results, we introduce optimization problems which determine either the biggest arrival rate or the smallest buffer capacities satisfying probabilistic constraints on waiting times. These results can be also applied to bounds of waiting times in more general systems. Numerical examples are also provided.