Using strong bisimulation to resolve ontology integration equality

Matching the conceptual definitions from different formal ontologies is the main task in ontology integration. The matching is done based on similarity relations. Evaluation and comparison of the approaches is very difficult and impedes usability as well as methodological interoperability. In this paper, we discuss ontology integration similarity relation, and discuss ontology integration equality in detail. Then, we introduce the syntax and semantics of the process algebra CCS, giving the definition of strong bisimulation, we also examine the transitions of (G|H)[f], showing there is a matching transition from G[f]|H[f]). We show that strong bisimulation can be used to resolve ontology integration equality, a approach is presented.