Research Article
Verifying Service Choreography Model Based on Description Logic
Algorithm 1
Construct SHOIN(D) Tbox&Abox.
Input: the meta model and the application model | Output: Tbox, Abox | begin | (1) Tbox = , Abox = ; | (2) for all MetaConcepts in meta concept model, do | (3) Tbox = ; | (4) if is the superclass of , then | Tbox = ; | (5) else if has a data attribute (data type is ), then | Tbox = ; | (6) else if and Tbox | and Tbox, then | Tbox = ; | (7) end if; | (8) end for; | (9) for all MetaRelation in meta concept model, the relation is the inverse relation of , do | Tbox = ; | (10) end for; | (11) for all the multiplicity constraints in range and domain of every relation in meta concept model, | the relation is the inverse relation of , do | (12) if multiplicity constraints is “” then | Tbox = ; | (13) else if multiplicity constraints is “” then | Tbox = ; | (14) else if multiplicity constraints is “1” then | Tbox = ; | (15) end if; | (16) end for; | (17) return Tbox; | (18) for all individuals in application concept model, | (19) if AppFunction(o) = c, do | Abox = ; | (20) end for; | (21) for all individuals , in application concept model, | (22) if AppFunction(r) = R, do | Abox = ; | (23) end for; | (24) return Abox; | end |
|