• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.10
• /
• pp.3624-3637
• /
• 2014

At SAC 2004, Junod and Vaudenay designed the FOX family based on the Lai-Massey scheme. They noted that it was impossible to find any useful differential characteristic or linear trail after 8 rounds of FOX64 or FOX128. In this paper, we provide the lower bound of differentially active S-boxes in consecutive rounds of the Lai-Massey scheme that has SPS as its F-function, and we propose the necessary conditions for the reachability of the lower bound. We demonstrate that similar results can be obtained with respect to the lower bound of linearly active S-boxes by proving the duality in the Lai-Massey scheme. Finally, we apply these results to FOX64 and FOX128 and prove that it is impossible to find any useful differential characteristics or linear trail after 6 rounds of FOX64. We provide a more precise security bound for FOX128.

• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06b
• /
• pp.24-29
• /
• 2008

여러 개의 작업이 동시에 작동 할 때 서로 다른 작업에서 특정한 로봇이나 장치를 사용하기 위하여 상대방의 작업이 끝나기를 기다리는 상태를 교착상태라 하며 생산공정에서는 효율성과 경제성 제고에 가장 중요한 문제 중 하나다. 지금까지 이러한 교착상태 확인은 도달성(reachability)기법이나 서브넷(Subnet)으로 분리하여 분석하는 기법 등이 가장 많이 사용 되었으나, 분석에 필요한 시간과 노력, 복잡성과 효율성에 있어서 효과적이지 못한 단점을 가지고 있다. 본 연구는 페트리넷(Petri Net)에서 모든 플레이스(Place) 간의 관계를 나타내는 추이(Transitive)행렬을 이용하여 교착상태가 나타날 가능성이 있는 자원공유 플레이스(Place)를 분석하여 교착상태를 검증하는 정책을 제시한다. 이를 위하여 교착상태를 확인할 수 있는 자원공유 플레이스의 관계를 정의하고, FMS(Flexible Manufacturing System) 모델을 이용하여 제안한 알고리즘의 성과를 검증한다.

• International Journal of Aeronautical and Space Sciences
• /
• v.11 no.2
• /
• pp.118-125
• /
• 2010

This paper describes a mid-course guidance strategy based on the earliest intercept geometry (EIG) guidance. An analytical solution and performance validation will be addressed for generalized mid-course guidance problems in area air-defence in order to improve reachability and performance. The EIG is generated for a wide range of possible manoeuvres of the challenging missile based on the guidance algorithm using differential geometry concepts. The main idea is that a mid-course guidance law can defend the area as long as it assures that the depending area and objects are always within the defended area defined by EIG. The velocity of Intercept Point in EIG is analytically derived to control the Intercept Geometry and the defended area. The proposed method can be applied in deciding a missile launch window and launch point for the launch phase.

• Journal of information and communication convergence engineering
• /
• v.10 no.4
• /
• pp.329-336
• /
• 2012

For designing broadcast protocols in mobile ad hoc networks (MANETs), one of the important goals is to reduce the rebroadcast packets redundancy while reaching all the nodes in network. In this paper, we propose a probabilistic broadcasting mechanism based on selfishness and additional coverage in MANETs. Our approach dynamically adjusts the rebroadcast probability according to the extra covered area and number of neighbor nodes. By these two factors, mobile hosts can be classified into three groups: normal, low selfishness, and high selfishness groups. The nodes in the normal group forward packets for other nodes with high probability, whereas the nodes in the low selfishness group rebroadcast packets with low probability and the nodes in the high selfishness group do not rebroadcast packets. We compared our approach with simple flooding and the fixed probabilistic approach. The simulation results show that the proposed schemes can significantly reduce the number of retransmissions by up to 40% compared simple flooding and fixed probabilistic scheme without significant reduction in the network reachability and end-to-end packet delay.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.40 no.3
• /
• pp.299-307
• /
• 1991

This paper deals with the determination of a firing sequence of transitions in the reachability problem of Safe Petri Net. The determination problem of a firing sequence is very important from the point of practical view, especially in the control of the discrete systems modelled by Safe Petri Net. The determination method of a firing sequence of transitions by means of the matrix equation for the discrete systems modelled by Safe Petri Net is proposed. First, a construction method of the indicence matrix and the firing rule for Safe Petri Net with self-loop are presented by defining the permissive arc in place of self-loop. Next, we develop a method that can find the enable transitions of Safe Petri Net by means of the matrix equation of Safe Petri Net. Finally, by using this method, we propose an algorithm that determines the firing sequence of transitions of Safe Petri Net.

• Proceedings of the KSR Conference
• /
• 2004.06a
• /
• pp.1452-1455
• /
• 2004

In this paper, we develope a protocol verification tool that verifies the correctness of rail signal control protocol type 2 specified in LTS(Labeled Transition System) by using model checking method. This tool automatically checks several properties for deadlock, livelock and reachability of states and actions on LTS. and removes many errors and ambiguities of an informal method used in the past, so saves down expenditures and times required in the protocol development. Therefore it is expected that there will be an increase in safety, reliability and efficiency in terms of the maintenance of the signaling system by using the developed verification tool.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.33A no.10
• /
• pp.48-60
• /
• 1996

This paper focuses on the necessities of interworking and dervation of the requirements of interworking system for interworking between 64 Kbps based N-ISDN (narrowband ISDN) and B-ISDN(broadband ISDN). Furthermore, the design and the implementation of IWF (interworking function) are presentd. We analyze two ISDN signalling systems, and propose the architecture of interworking system. And then we make the baisc call procedure model between N-ISDN and B-ISDN, and verify the dynamic behaviors through the reachability tree of petri net. IWF is designed and implemented for transforming the differences between the two signalling systems. The operational confirmity of th eimplemented program was confirmed by the local test method. The performance of IWF was evaluated throguh the simulation language SLAM-II. As the result of evaluation shows, we confirm that the processing delay is maintained within 3 ms under the utilization 0.9.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.13 no.3
• /
• pp.231-238
• /
• 1988

A new approach to the reachability analysis of communication protocols is presented using a modified maximal progress state exploation for two communicating finite state machines. The task of generating all reachable states is divided into two independent subtasks. In each subtask, only the states which are reachable by forcing modified maximal progress sequence for one machine are generated. Modified maximal progress state exploration saves space and time over maximal progress state exploration.

• Proceedings of the KIEE Conference
• /
• 2001.11c
• /
• pp.212-214
• /
• 2001

Siphons and traps are special structures of Petri nets with closely related to liveness for the deadlock analysis of Discrete Event Dynamic Systems. It can analysis the liveness of Petri nets using the siphon and trap without to check reachability.[1] Deadlock analysis approach we proposed is based on the notion of potential deadlock which are siphons that eventually become empty. And in this paper, we proposed a initial marking method by siphon to avoid and to prevent deadlock. It is shown that our approach is more efficient than classical state enumeration approach.

• International Journal of Control, Automation, and Systems
• /
• v.1 no.4
• /
• pp.431-443
• /
• 2003

This paper presents an efficient method to evaluate the performance of an extended stochastic Petri net by simple algebraic operations. The reachability graph is derived from an extended stochastic Petri net, and then converted to a timed stochastic state machine, using a semi-Markov process. The n-th moments of the performance index are derived by algebraic manipulations with each of the n-th moments of transition time and transition probability. For the derivation, three reduction rules are introduced on the transition trajectories in a well-formed regular expression. Efficient computation algorithms are provided to automate the suggested method. The presented method provides a proficient means to derive both the numerical and the symbolic solutions for the performance of an extended stochastic Petri net by simple algebraic manipulations.