Xuling Chang, Linpeng Huang, Jianpeng Hu, Chen Li, Bei Cao
{"title":"具有时间性质的活动图到定时彩色Petri网的转换","authors":"Xuling Chang, Linpeng Huang, Jianpeng Hu, Chen Li, Bei Cao","doi":"10.1109/COMPSAC.2014.36","DOIUrl":null,"url":null,"abstract":"The activity diagram is widely used for describing and understanding workflows, however, it lacks a formal semantics and cannot be manipulated by computer. In this paper, we present a transformation from UML activity diagrams with time properties to timed coloured petri nets (TCPNs) in a formal way. We extend the activity diagram with time properties and a formal model named extended activity hyper graph (EAH) is defined. By mapping this formal model to a clocked transition system (CTS), we define a weak semantics for it. A list of transformation rules are proposed to show how this can be transformed to a TCPN model. We partially prove the model equivalence of the two models. Finally, an example of Game Capture application is used to validate our approach.","PeriodicalId":106871,"journal":{"name":"2014 IEEE 38th Annual Computer Software and Applications Conference","volume":"61 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Transformation from Activity Diagrams with Time Properties to Timed Coloured Petri Nets\",\"authors\":\"Xuling Chang, Linpeng Huang, Jianpeng Hu, Chen Li, Bei Cao\",\"doi\":\"10.1109/COMPSAC.2014.36\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The activity diagram is widely used for describing and understanding workflows, however, it lacks a formal semantics and cannot be manipulated by computer. In this paper, we present a transformation from UML activity diagrams with time properties to timed coloured petri nets (TCPNs) in a formal way. We extend the activity diagram with time properties and a formal model named extended activity hyper graph (EAH) is defined. By mapping this formal model to a clocked transition system (CTS), we define a weak semantics for it. A list of transformation rules are proposed to show how this can be transformed to a TCPN model. We partially prove the model equivalence of the two models. Finally, an example of Game Capture application is used to validate our approach.\",\"PeriodicalId\":106871,\"journal\":{\"name\":\"2014 IEEE 38th Annual Computer Software and Applications Conference\",\"volume\":\"61 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-07-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 IEEE 38th Annual Computer Software and Applications Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/COMPSAC.2014.36\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE 38th Annual Computer Software and Applications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COMPSAC.2014.36","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Transformation from Activity Diagrams with Time Properties to Timed Coloured Petri Nets
The activity diagram is widely used for describing and understanding workflows, however, it lacks a formal semantics and cannot be manipulated by computer. In this paper, we present a transformation from UML activity diagrams with time properties to timed coloured petri nets (TCPNs) in a formal way. We extend the activity diagram with time properties and a formal model named extended activity hyper graph (EAH) is defined. By mapping this formal model to a clocked transition system (CTS), we define a weak semantics for it. A list of transformation rules are proposed to show how this can be transformed to a TCPN model. We partially prove the model equivalence of the two models. Finally, an example of Game Capture application is used to validate our approach.