A Method Of Mapping The Collaboration Graph Arrangement To Peer

In this thesis,we describes how to map collaboration diagram into peers,which is the key question in up-down modeling of inter-organizational business process.Muti-view modeling inter-organizational business process assures there are no abnormal behaviors between interactions.Generally,the current proposals for mapping need two steps:1.Mapping collaboration diagram into another model which has formal semantics;2.Mapping this new model into peer.The multiple transitions means we need to take multiple risks.Therefore,it is a key problem to map collaboration diagram into peers,with the premise of semantic consistency,in the field of inter-organizational business process.In this thesis,we extracts and operates the depending relationships among messages from collaboration diagram It would be possible to map collaboration diagram into peers directly.This thesis does the main work as follows:1.Extracting the syntax and semantic features of collaboration diagram,which offers the prerequisite for collaboration diagram soundness checking.Some existing articles merely pay close attention to syntax features,but not semantic features.For this reason,I focus on semantic features of collaboration diagram in order to make a comprehensive verification.2.Mapping the collaboration diagram into peers directly,the method we proposed applies the concept of transitive closure which comes from discrete mathematics.This method builds directly dependency set?indirectly dependency set?minimal dependency set for messages from collaboration diagram,which simplifies the transition.3.Making a consistency verification between Peer and collaboration diagram.The result shows that peer totally maintains the sematic of collaboration diagram,which also verifies the correctness of mapping method.4.Programming to implement the method,trying to prove whether it is feasible or not We use a software named Turfun Plato to draw the collaboration diagram and totally meet the standard of UML.The output of this software is an xml file,which can extract information more easily.The method including analyzing?expanding.extracting and mapping.The result is N minimal depending relationships correspond to N Peers.These minimal depending relationships presented by petri net,not only helps peer follow the semantics of collaboration diagram,but also has formal semantics,which provides convenience for realizable analysis.