• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.13 no.3
• /
• pp.200-207
• /
• 2013

Petri Nets are a system description and analysis tool. Reachability is one of the most basic properties in Petri Net research. In a sense, reachability research is the foundation study for other dynamic properties of Petri Nets through which many problems involving Petri Nets can be described. Nowadays, there are two mature analysis methods-the matrix equation and the reachability tree. However, both methods are localized, i.e., it is difficult to find a general algorithm that can determine reachability for an arbitrary Petri Net, especially an unbounded Petri Net. This paper proposes and proves three propositions in order to present a subclass of a Petri Net, the live single-branch Petri Net, whose reachability is equivalent to the satisfiability of the state equation.

• Kyungpook Mathematical Journal
• /
• v.59 no.3
• /
• pp.505-513
• /
• 2019

In this paper, we study orthanogonal polynomials by looking at their comrade matrices and reachability matrices. First, we focus on the algebraic structure that is exhibited by comrade matrices. Then, we explain some properties of this algebraic structure which helps us to find a connection between comrade matrices and reachability matrices. In the last section, we use this connection to determine the determinant, eigenvalues, and eigenvectors of these matrices. Finally, we derive a factorization for det R(A, x), where R(A, x) is the reachability matrix for a comrade matrix A and x is a vector of indeterminates.

• Journal of KIISE:Information Networking
• /
• v.27 no.4
• /
• pp.482-488
• /
• 2000

프로토콜 검증에 있어서 reachability analysis를 사용하는 방법은 널리 알려지고 많이 사용되는 방법이다. Reachability analysis를 통한 검증 방법에 있어서는 프로토콜의 동작을 나타내는 reachability graph의 생성이 중요하다. 그러나 시간이 관련되는 경우 발생하는 상태 수 폭증또는 시간의 실수적 성질의 문제가 있어서 reachability graph의 생성에 큰 장애가 되어왔다. 실시간 시스템이나 프로토콜에 있어서 타이머는 대기 시간의 한계를 지정하거나 일정한 시간간격을 시스템에 알릴 수 있도록 하는 등 시간의 상대적 기준점으로 사용되며 이외에도 여러 가지 용도로 타이머를 사용하게 되어 프로토콜을 모델링하는데 있어서 타이머는 불가결하다. 본 논문에서는 타이머를 모델링하지 못하며 통신 프로토콜과 그 환경을 모델링하는데 적절치 못하던 기존의 방법과 달리 타이머를 포함하며 통신 프로토콜과 그환경을 적절히 표현할 수 있도록 시스템을 기술하는 방법과 함께 상대적 시간 개념으로 천이와 타이머를 다루는 방법을 통해서 시간개념과 타이머가 들어있는 프로토콜의 reachability graph를 유도하는 방법을 제안하였다. 제안한 방법을 통해서 기존방법으로는 찾아낼수 없었던 시스템의 오류를 찾아낼 수 있었다. 이를 통해 보다 실제 프로토콜에 가깝에 모델링하고 검증할 수 있는 기반을 마련하고 있다.

• The Journal of Korea Robotics Society
• /
• v.16 no.4
• /
• pp.313-318
• /
• 2021

This paper proposes a new method to generate inverse reachability maps that are more efficient for mobile manipulators than the previous algorithms. The base positioning is important to perform the given tasks. Using the inverse reachability method, we can know where to place the robot's base for given tasks. For example, the robot successfully performed the task with relocation, even when the target is initially in a low manipulability area or outside the workspace. However, there are some inefficiencies in the online process of the classical inverse reachability method. We describe what inefficiencies appear in the online phase and how to change the offline process to make the online efficient. Moreover, we demonstrate that the proposed approach achieves better performance than usual inverse reachability approaches for mobile manipulation. Finally, we discuss the limitations and advantages of the proposed method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.1C
• /
• pp.78-83
• /
• 2002

Reachability analysis of finite state machines is very useful for many computer-aided design applications such as communication protocol or microprecessor design. We present new techniques to improve approximate reachability analysis. The key idea is to used an iterative approximate reachability analysis technique in which don't care sets derived from previous iterations are used to improve the approximation in subsequent iterations. Experimental results show that the new techniques can improve reachability analysis significantly compared to existing analysis techniques.

• Journal of KIISE
• /
• v.44 no.10
• /
• pp.1034-1044
• /
• 2017

Although traversal strategies are important for the performance of model checking, many studies have ignored the impact of traversal strategies in model checking with a block-encoded abstract reachability graph. Studies have considered traversal strategies only for an abstract reachability graph without block-encoding. Block encoding plays a crucial role in the model checking performance. This paper therefore describes Dual-traversal strategy, a simple and novel technique to control traversal strategies in a block-encoded abstract reachability graph. This method uses two traversal strategies for a model checking, one for effective block-encoding, and the other for traversal in an encoded abstract reachability graph. Dual-traversal strategy is very simple and can be implemented without overhead compared to the existing single-traversal strategy. We implemented the Dual-traversal strategy in an open source model checking tool and compare the performances of different traversal strategies. The results show that the model checking performance varies from the traversal strategies for the encoded abstract reachability graph.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.12
• /
• pp.3109-3120
• /
• 1996

SDL has been standardized to specify behavioral aspects of communication systems based on the formal description technique, and it is powerful and user friendly in the sense of supporting human communication and understanding, formal analysis andcomparison of behaviors, alternative implementations and design optimization, and its structural decomposition. However, SDL is not sufficient for an efficient handing of entrire system descriptions because the communication systems are generally very complex, and composed from the various interactions among sub-systems. Also, it is very difficult to explicitly verify dynamic views such as liveness and reachability. it leads the demands on analysis scheme to verify dynamic behaviros of specified systems. This paper presents modeling concepts of Petri Nets from SDL and transformation rules to Numerical Petri Nets to provide efficient technqiques for verification of dynamic behaviors, and proposes the reachability garaph that is able to trace all reachable states of a modeled system and reduce an information loss on the reachability tree.

• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06b
• /
• pp.441-443
• /
• 2012

계층 군집화 (Hierarchical Clustering)는 전역정보를 활용하여 군집화를 하기 때문에 다양한 군집 분석(Cluster Analysis) 방법들 중에 비교적 많이 이용되고 있으나 군집화의 결과를 덴드로그램의 형태로 나타내 전체 군집들의 정보를 직관적으로 확인하기에는 어려움이 존재한다. 이러한 문제를 개선하기 위해서 기존 Dendrogram의 정보를 크게 훼손하지 않고 직관적으로 클러스터의 정보를 확인할 수 있는 Reachability plot이 개발되었다. 그러나 Centroid Linkage 방식과 같이 덴드로그램이 비단조적이 될 수 있는 계층 군집화에서는 이것을 기존의 Reachability plot 방식으로 변환할 경우 정보가 왜곡 되어 나타날 수 있다. 따라서 우리는 이러한 문제를 해결하기 위한 방법을 제안함으로써 비단조적 덴드로그램의 경우에도 군집들을 정보의 왜곡 없이 표현할 수 있도록 하였다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.6
• /
• pp.599-607
• /
• 2000

This paper suggests an efficient reachability analysis method of bounded petri nets. Reachability analysis is a fundamental basis for studying the dynamic properties of any discrete event systems. However, it takes at least exponential execution time and memory space to verify in general petri nets. That is, state space explosion problem may occur. In this paper, we attack problems of previous approaches - state space explosion and restrictions to applicable petri net classes - by formulating the reachability problem as set operation over structural relations among places on an unfolding.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.14 no.3
• /
• pp.197-206
• /
• 1989

In this paper, we represent an improved algorithm of performance evaluation for communication protocol. It is an algorithm that analyzes Extended Timed Perti Net models including time which have been successfully used to model and evaluate the performance of distributed system. While Timed Petri Nets generally limted to free-choice and safe nets, our algorithm permits the construnction of elegant models of restricted concurrent processing. Furthermore, to reduce the state space size of Timed Reachability Graph, we improve the algorithm by using Maximum Firing Rule and sets of simultaneously firing transitions. Procedures for constructing of Timed Reachability Graphs and analyzing are presented, and we demonstrate the usefulness of this algorithm by applying it to the analysis of the communication protocol.