• Journal of KIISE:Software and Applications
• /
• v.35 no.9
• /
• pp.529-537
• /
• 2008

Since concurrent software is hard to debug, the verification of such systems inevitably needs automatic tools which support exhaustive searching. Bounded Model Checking (BMC) is one of them. Within a bound k, BMC exhaustively check some errors in execution traces of the given system. In this paper, we introduce the tool that performs BMC for LTS, modeling language for concurrent programs. In this tool, a property is described by a FLTL formula, which is suitable to present the property with actions in a LTS model. To experiment with existential model checkers and out tool, we compare and analysis the performance of the developed tool and others.

• Journal of KIISE:Software and Applications
• /
• v.34 no.8
• /
• pp.743-751
• /
• 2007

Model checking has been successfully applied to hardware verification. Software is more subtle than hardware with respect to formal verification due to its infinite state space. Although there are many research activities in this area, bounded model checking is regarded as a promising technique. Bounded model checking uses an upper bound to unroll its model, which is the main advantage of bounded model checking compared to other model checking techniques. In this paper, we applied bounded model checking to verify BIR which is the input model for the model checking tool BOGOR. Some BIR examples are verified with our technique. Experimental results show that bounded model checking is better than explicit model checking provided by BOGOR. This paper presents the formalization of BIR and the encoding algorithm of BIR into CNF.

• Journal of Electrical Engineering and Technology
• /
• v.1 no.4
• /
• pp.513-519
• /
• 2006

As a very important part in development of the protocol, verifications for developed protocol specification are complementary techniques that are used to increase the level of confidence in the system functions by their specifications. Using the informal method for specifying the protocol, some ambiguity may be contained therein. This indwelling ambiguity in control systems can cause the occurrence of accidents, especially in the case of safety-critical systems. To clear the vagueness contained in the designed protocol, we use the LTS (Labeled Transition System) model to design the protocol for railway signaling. And then, we verify the safety and the liveness properties formally through the model checking method. The modal ${\mu}$-calculus, which is an expressive method of temporal logic, has been applied to the model checking method. We verify the safety and liveness properties of Korean standard protocol for railway signaling systems. To perform automatic verification of the safety and liveness properties of the designed protocol, a communication verification tool is implemented. The developed tools are implemented by C++ language under Windows XP. It is expected to increase the safety and reliability of communication protocol for signaling systems by using the developed communication verification tool.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.14 no.4
• /
• pp.332-339
• /
• 2014

Face classification has wide applications in security and surveillance. However, this technique presents various challenges caused by pose, illumination, and expression changes. Face recognition with long-distance images involves additional challenges, owing to focusing problems and motion blurring. Multiple frames under varying spatial or temporal settings can acquire additional information, which can be used to achieve improved classification performance. This study investigates the effectiveness of multi-frame decision-level fusion with photon-counting linear discriminant analysis. Multiple frames generate multiple scores for each class. The fusion process comprises three stages: score normalization, score validation, and score combination. Candidate scores are selected during the score validation process, after the scores are normalized. The score validation process removes bad scores that can degrade the final output. The selected candidate scores are combined using one of the following fusion rules: maximum, averaging, and majority voting. Degraded facial images are employed to demonstrate the robustness of multi-frame decision-level fusion in harsh environments. Out-of-focus and motion blurring point-spread functions are applied to the test images, to simulate long-distance acquisition. Experimental results with three facial data sets indicate the efficiency of the proposed decision-level fusion scheme.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.11
• /
• pp.4543-4552
• /
• 2010

A leader is a special process who roles as the coordinator within multiple processes of a group. In a distributed system, leader election is the procedure of electing a coordinator. This is a very important issue for building fault-tolerant distributed systems. When two normal mobile ad hoc networks are merged, there are two leaders. This violates the safety property, so a mechanism to detect and handle are required. In mobile ad hoc distributed computing system, we propose a leader competition protocol and to prove the temporal logic to it. This solution is based on the group membership detection algorithm.

• Proceedings of the Korean Society of Propulsion Engineers Conference
• /
• 2012.05a
• /
• pp.436-442
• /
• 2012

In the process of liquid rocket engine design, obtaining method of the dynamic characteristics of engine should be emphasized typically to determine the control logic and algorithms of the throttle valves in the propellant feed pipeline. However, determining the dynamic characteristics of an engine through the autonomous test is very hard and laborious, so that the numerical approach is prevailing. In this study, using the previously developed dynamic analysis model of the engine around the steady state, we introduced a disturbance to this model, and obtained the dynamic response in the time domain. And by applying the well-known Levy method to this temporal response, we could deduce the transfer function of that system that can give us various information of engine and can be manipulated to design the control system.

• Journal of Information Processing Systems
• /
• v.15 no.3
• /
• pp.570-592
• /
• 2019

The Event-B design pattern is an excellent way to quickly develop a formal model of the system. Researchers have proposed a number of Event-B design patterns, but they all lack formal behavior semantics. This makes the analysis, verification, and simulation of the behavior of the Event-B model very difficult, especially for the control-intensive systems. In this paper, we propose a novel method to transform the Event-B synchronous control flow design pattern into the labeled transition system (LTS) behavior model. Then we map the design pattern instantiation process of Event-B to the instantiation process of LTS model and get the LTS behavior semantic model of Event-B model of a multi-level complex control system. Finally, we verify the linear temporal logic behavior properties of the LTS model. The experimental results show that the analysis and simulation of system behavior become easier and the verification of the behavior properties of the system become convenient after the Event-B model is converted to the LTS model.

• Cross-Cultural Studies
• /
• v.22
• /
• pp.329-354
• /
• 2011

This paper aims to probe into the meaning of Ranhou in Mandarin Chinese and to account for discourse functions of it in radio call-in programme. For this purpose, the present study investigates the meaning of Ran and Hou repectively at first and explains the change of meaning of Ranhou, because we assume that Ranhou is compounded by Ran and Hou, and the core meaning is derived from its compounded meaning. Then we examine which time category Ranhou belongs to more based on the concept of time(reference, event, discourse) in Schiffrin(1987), and examine also where it is located within turn. Following this examination, we analysis and explain discourse functions what it is situated. Therethrough, we understand that 1) Ran has 'agreement or confirmation of preceded utterance' therefore has anaphoric meaning, and Hou has 'after' in the meaning cline: back of body-back part-behind-after-retarded(proposed by Heine et al. 1991), so that Ranhou has 'after agreement or confirmation of preceded utterance of mine' and extends to 'on premise preceded utterance or event' furthermore, and therefore can have possibility having various functions; 2) Ranhou has various functions in natural language in spite of the institutional setting. It can indicate (1) temporal relation of events, (2) logic relation of two(or more) events, e.g. causality, elaboration, concession, list, (3) turn maintence, acquisition, management, (4) verbal filler.

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

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.4
• /
• pp.1013-1024
• /
• 1997

In the traditional object modeling methodologies, the object model can be said as formal since it has been based on rich semantic model. But almost of all methodolgies lack in formality the dyamic model and modeling process. Dynamic model cannot represent exctly the timing constraints and the interaction among the objects, which are very important features in real-time and multimedia system. In this paper, we formalize the synamic moedl and modeling proxess based on object behavior and state. This model defines the object state space using the concepts in algebra stucture and defines the object behavior func-tion. Also this model can formalize object kifecycle and conurrency among the objects usint the temporal logiction. Also this model can frlmaize object lifecycle and conurrency among the objects using the tempral logic and behavior founction. We apply firing rules to behacior function for modeling the dependency of interaction among the objescts.