Font Size: a A A

A Method Of Mapping Sequence Diagrams To Colored Petri Nets

Posted on:2018-05-06Degree:MasterType:Thesis
Country:ChinaCandidate:H L ZhangFull Text:PDF
GTID:2438330518457961Subject:Systems analysis and integration
Abstract/Summary:PDF Full Text Request
As business processes no longer limit within organization,cross-organizational business process becomes a hot topic in business process areas.As a language of modeling business process,sequence diagram not only has friendly graphical representation,but also makes the model easy to understand.The sequence diagram contains a variety of control flow structures,such as selection,concurrency,loop and break,which can describe the complex collaborative process between organizations.In order to solve the problem of sequence modeling choreography model lacks formal analysis methods,it is necessary to map sequence diagrams into a modeling language with formal semantic.The current researches only pay attention to the synchronous messages in sequence diagram,not consider the asynchronous message,which will missing some concurrency relation in sequence diagram.Therefore,it is essential to propose a mapping method which concentrate on asynchronous message.Based on the existing work,this paper process a method to map sequence diagram into Colored Petri Nets,which distinguish the message types in the sequence diagram,and mapping the concurrent structure in the segments of interaction.The main work of this paper is as follow:1.Proposed dependencies between a sequence diagram message according to the sequential relationship weak sequence diagram,traction concurrent relationship of sequence diagram.This paper summarizes seven basic concurrent in the sequence diagram and presents the basic interaction fragment to the CPN mapping rules based on the basic concurrent structure corresponding to the Petri nets model;2.In this paper,the shortcomings of the combined fragment mapping method in the existing literature are improved,and the mapping algorithm of the sequence diagram to the colored Petri net is designed;3.Based on the above two points,a method of mapping from sequence diagram to CPN is designed.And design the conversion tool SD2CPN for this method.The sequence diagram will be converted to an XML file that can be executed by CPN Tools,which can be used for formal analysis methods such as path extraction on CPN Tools.To facilitate the analysis of the sequence diagram.
Keywords/Search Tags:Sequence diagram, Concurrent relation, CPN, Mapping algorithm, Business process
PDF Full Text Request
Related items