• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.10
• /
• pp.2310-2316
• /
• 2010

This paper presents an application of retiming to model checking, a branch of formal verification. Retiming can change the transition relation of a circuit without changing its input-output behaviour by relocating its registers. With the retiming, a given circuit can have a different structure more adequate for model checking. This paper proposes a cost function to reflect the number of registers and the characteristic of its transition relation and develops a heuristic annealing algorithm to search efficiently the circuit structures obtained by retiming. Experimental results show that the proposed method can improve the model checking performance.

• Journal of applied mathematics & informatics
• /
• v.3 no.2
• /
• pp.129-148
• /
• 1996

This paper propose the inference mechanism for handling linear polynomial constraints called consistency checking algorithm based on the feasibility checking algorithm borrowed from linear pro-gramming. in contrast with other approaches proposed algorithm can efficiently and coherented by linear polynomial forms. The developed algorithm is successfully applied to the symbolic simulation that offers a convenient means to conduct multiple simultaneous exploration of model behaviors.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07a
• /
• pp.904-906
• /
• 2005

최근 유비쿼터스 컴퓨팅 환경이 부각되면서 유비쿼터스 컴퓨팅 환경에서의 모델 검증을 위해 기존의 심볼릭 검증 모델을 응용한 매우 크고 여러 콤포넌트로 구성된 모델 검증 대상이 빈번히 변화하는 상황을 가정한 모델 검증 기술이 요구되었다. 본 논문에서는 빈번히 변화하는 모델 검증을 위해 새로운 알고리즘을 제시하고 완전히 증명하였으며 기존의 모델과 새로운 모델간의 성능 비교 실험으로 새로운 모델의 효율성을 증명하였다.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.39 no.3
• /
• pp.1-17
• /
• 2002

In this paper, we present our experiences in using symbolic model checker(SMV) to analyze a number of properties of RACE cache coherence protocol designed by ETRI(Electronics and Communications Research Institute) and to verify that RACE protocol satisfies important requirements. To investigate this, we specified the model of the RACE protocol as the input language of SMV and specified properties as a formula in temporal logic CTL. We successfully used the symbolic model checker to analyze a number of properties of RACE protocol. We verified that abnormal state/input combinations was not occurred and every possible request of processors was executed correctly We verified that RACE protocol satisfies liveness, safety and the property that any abnormal state/input combination was never occurred. Besides, We found some ambiguities of the specification and a case of starvation that the protocol designers could not expect before. By this verification experience, we show advantages of model checking method. And, we propose a new method to generate automatically test cases which are used in simulation and testing.

• Proceedings of the IEEK Conference
• /
• 2003.07b
• /
• pp.939-942
• /
• 2003

Design verification problem is emerging as an important issue to detect any design errors at the early stage of the design. Conventionally, design verifications have been done using a simulation technique. However, this technique has been proved not to cover all potential design errors. Therefore, formal technique is often used to verify digital circuits as an alternative. In this paper we adopted formal verification technique and verified some important properties derived from our pipelined digital systems, using SMV (Symbolic Model Verifier). Our example shows that model checking method (one of formal verification techniques) can be effectively performed in verifying the large digital systems.

• Proceedings of the Korea Society for Simulation Conference
• /
• 1992.10a
• /
• pp.7-7
• /
• 1992

Extending discrete event modelling formalisms to facilitate greater symbol manipulation capabilities is important to further their use in intelligent control and design of high autonomy systems. This paper defines an extension to the DEVS formalism that facilitates symbolic expression of discrete event times by extending the time base from the real numbers to the field of linear polynomials over the reals. A simulation algorithm is developed to generate the branching trajectories resulting from the underlying non-determinism. To efficiently manage linear polynomial constraints based on feasibility checking algorithm borrowed from linear programming. The extended formalism offers a convenient means to conduct multiple, simultaneous explorations of model behaviors. Examples of application are given with consideration on fault model analysis.

• Journal of KIISE:Software and Applications
• /
• v.31 no.6
• /
• pp.773-783
• /
• 2004

This paper presents a method for real-time verification of Statecharts. Statecharts has been widely used for real-time reactive systems, and supports two time models: synchronous and asynchronous. However, existing real-time verification methods for them are incompatible with the asynchronous time model or increase state space by introducing new variables to the target models. We solved these problems by extending existing model checking algorithms. The extended algorithms can be used with both time models of Statecharts because they consider time increasing transitions only. In addition, they do not increase target state space since they count those transitions internally without additional variables. We extended an existing model checker, NuSMV, based on the proposed algorithms and conducted some experiments to show their advantage.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.27 no.4
• /
• pp.87-109
• /
• 2002

A satisfiability problem in propositional logic is the problem of checking for the existence of a set of truth values of atomic prepositions that renders an input propositional formula true. This paper describes an empirical investigation of a particular integer programming approach, using the set covering model, to solve satisfiability problems. Our satisfiability engine, SETSAT, is a fully integrated, linear programming based, branch and bound method using various symbolic routines for the reduction of the logic formulas. SETSAT has been implemented in the integer programming shell MINTO which, in turn, uses the CPLEX linear programming system. The logic processing routines were written in C and integrated into the MINTO functions. The experiments were conducted on a benchmark set of satisfiability problems that were compiled at the University of Ulm in Germany. The computational results indicate that our approach is competitive with the state of the art.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2002.05a
• /
• pp.61-65
• /
• 2002

These days, in order to satisfy the complex and various demands of the customers, the telecommunication networks must provide rapid and flexible services, with the support of efficient service and network management systems. To satisfy these requirements, many objects for management have been released to manage network services and elements. But there are no efficient ways to manage these newly managed objects in object-oriented software. Therefore, we study several problems, when a subsystem using object-oriented technique is implemented. The first problem is that interface works between realized application programs using its technique. The second problem is that reusability of internal managed objects is difficult. In this paper, we will point out some problems and to solve these problems, we have proposed the Object Management System (OMS) architecture, which supports a transparent interface between object-oriented applications and the distributed data repositories. Also in order to manage efficient business objects stored in the different repositories, we suggest a method for integrating dynamic information resources in heterogeneous and distributed network environments. Finally, we applied OMS to TINA(Telecommunication Information Network Architecture) domain, implemented OMS, and verified it with SMV(Symbolic Model Verifier) which is model checking technology.

• Asia-Pacific Journal of Business Venturing and Entrepreneurship
• /
• v.10 no.4
• /
• pp.95-111
• /
• 2015

This purpose of this study is to academically define what "luxury products" mean, and to clarify the cognitive structural relationship between product attributes and "luxuriousness" in relation to the determinant of luxuriousness that eventually affects the purchase intention of consumers. This study is also written under the theory that luxuriousness leads to benefits such as functional benefit, experiential benefit, symbolic benefit, and exclusive benefit; which all provide core values to consumers and serve as effect factors that influence the psychological satisfaction of consumers. The commonly discussed measure of the determinant of luxuriousness has often failed to adequately describe the reasons to why the consumers prefer luxury products. This study also aims to suggest a new path in how and what the consumers perceive as luxury products, and to conceptualize what luxuriousness means in the marketing perspectives on the background of a previous theory. The part of product attributes are divided in the following sections: the quality and design of functional cues and brands of symbolic cues, as well as prices. The part of the determinant of luxuriousness is divided in sections of superiority, scarcity, differentiation, and traditionality. Therefore, this study used the theoretical concept used in such common measures as well as 282 examples to empirically analyze the relationship between product attributes and luxuriousness of luxury products, and how such affect the purchase intentions of consumers. The survey used to aid this study targeted luxury product consumers regarding "B" brand of automobiles. Using the analysis through a structural equation model, the study draws a conclusion that in a relationship between product attributes and luxuriousness, quality(which is one of the functional cues) affects the facts of superiority, differentiation in a significant way, and design affects the factors of scarcity in a significant way. And brand(one of the symbolic cues) significantly affects the factors of traditionality within the luxuriousness factors, and price appeared to affect superiority and scarcity. Additionally, the brand of product attributes significantly affects purchase intention, and superiority and scarcity of luxuriousness affects purchase intention in a significant way. The structural concept of luxury and luxuriousness suggested in the study will provide the theoretical basis for building a new case study, and the determinants of luxuriousness in the marketing perspective will be a practical help for checking the consumers' psychological reasons for purchase.