• The Journal of the Korea institute of electronic communication sciences
• /
• v.10 no.5
• /
• pp.593-598
• /
• 2015

Non-linear cellular automata is difficult to analyze mathematically than linear cellular automata. So it is difficult to identify reachable states and attractors of nongroup non-linear cellular automata than nongroup linear cellular automata. In this paper, we propose a new reachable table to overcome these problems. We can see the next state for all the states of the non-linear cellular automata by the proposed reachable table. In addition, we can identify reachable states and attractors by the reachable table.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.6
• /
• pp.1132-1136
• /
• 2006

In this paper, we analyze reachable/nonreachable states of 3-neighborhood cellular automata and propose the algorithm finding the predecessor of a reachable state.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.406-409
• /
• 2006

In this paper, we analyze reachable/nonreachable state of 3-neighborhood cellular automata and propose give the algorithm finding the predecessor of a reachable state.

• 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.

• Journal of KIISE:Software and Applications
• /
• v.30 no.3_4
• /
• pp.212-218
• /
• 2003

State invariant is a property that holds in every reachable state. It can be used not only in understanding and analyzing complex software systems, but it can also be used for system verifications such as checking safety, liveness, and consistency. For these reasons, there are many vital researches for deriving state invariant from finite state machine models. In previous works every reachable state is to be considered to generate state invariant. Thus it is likely to be too complex for the user to understand. This paper seeks to answer the question `how to simplify state invariant\ulcorner`. Since the complexity of state invariant is strongly dependent upon the size of states to be considered, so the smaller the set of states to be considered is, the shorter the length of state invariant is. For doing so, we let the user focus on some interested scopes rather than a whole state space in a model. Computation Tree Logic(CTL) is used to specify scopes in which he/she is interested. Given a scope in CTL, mixed reachability analysis is used to find out a set of states inside it. Obviously, a set of states calculated in this way is a subset of every reachable state. Therefore, we give a weaker, but comprehensible, state invariant.

• Journal of applied mathematics & informatics
• /
• v.17 no.1_2_3
• /
• pp.663-670
• /
• 2005

In this paper we shall give some decompositions derived from cyclic subautomata or neighborhoods of the automaton. Also we shall discuss some characterizations of cyclic automata when an automaton is maximal cyclic refinement. If m $\in$ M is totally reachable state, we shall see that {$mX^{\ast}$} is minimal.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.6
• /
• pp.558-571
• /
• 1992

In this paper, we propose an improved method of state exploration called the extended circular exploration (ECE) for the efficiency of state exploration and the reduction of explosively growing state. The ECE does not need to explore all the reachable global states, and It can be applied to JV($\boxDr$$\geq$ 2) -party protocol with alternative routes, i.e., it is applicable to the protocol In which adaptiverouting mechanism can be performed. The ECE eliminates a restriction of topology of the conventional circular exploration(CE) by exploring only those global states which are reachable, provided that the participant processes of any group of transitions proceed at the same speed, and that they can be formed as a cycle. Thus the state space explored if not exhaustive. The algorithm presented can detect deadlock error and unspecified reception error It requires storage space and /or execution time much less than those of the conventional perturbation(CP) . It might be used for a solution of the N-process collision and the interference mechanism.

• Journal of applied mathematics & informatics
• /
• v.17 no.1_2_3
• /
• pp.671-678
• /
• 2005

In this paper we shall give some characterizations of strongly cyclic and totally reachable (TR) automata when A = (M, X, $\delta$) is MinCR-automaton. Also we shall see that if an automaton A is strongly cyclic, then A is cyclic and a TR-automaton. When A is MinmaxCR-automaton, we shall give another characterizations for a strongly cyclic and cyclic TR-automaton.

• Journal of applied mathematics & informatics
• /
• v.16 no.1_2
• /
• pp.585-593
• /
• 2004

In this paper we shall discuss the minimal, maximal and primary subautomata. Also the concepts of the totally reachable state and source will be introduced. It is an interesting part that mX＊ is minimal iff the source S(m) is maximal. We shall point out that the characterization of primary subautomaton comes from the properties associated with the sources S(m)'s.

• The KIPS Transactions:PartD
• /
• v.13D no.1 s.104
• /
• pp.111-116
• /
• 2006

Given a state, it is essential to for the finite state model analysis (such as model checking) to decide whether or not the state is reachable. W a site of the model is small, the whole state space is to be explored exhaustively. However, it is very difficult or even impossible if a size of the model is large. In this case, the model can be reduced into a smaller one via abstraction which does not allow e false positive error. this paper, we devise such an abstraction and apply it to the Nemorize game solving. As a result, unsolved game due to the state explosion problem is solved with the proposed abstraction.