In this paper we shall show a general framework of studying some properties between relational structures and first order languages describing them. Recently usual two-valued models have been quite naturally extended to the Boolean-valued models especially in set theory when Cohen's forcing method was studied by the Boolean-valued method. Here we want to clarify a general construction of Boolean-valued models using the analogous method of a construction of Stone-tech compactification and ultrafilters of Boolean algebras. Properly speaking, the concept of compactifications is one of the important concepts in topology, but applying its method we can easily treat model constructions if we are given a language and a structure of the same similarity type. In section 1 we will define a Boolean-valued structure. Then we study classical models in section 2. Further we show the relations between classical models and so called Kripke models with respect to a introduction of constants in section 3.