Mathias Gotz, Stephan Roser, Florian Lautenbacher, B. Bauer
{"title":"面向图形的流程模型的令牌分析","authors":"Mathias Gotz, Stephan Roser, Florian Lautenbacher, B. Bauer","doi":"10.1109/EDOCW.2009.5332020","DOIUrl":null,"url":null,"abstract":"In Business Process Management, graph-based models are used to represent coordination protocols between collaborating partners as well as for service orchestration and composition. At runtime however, current process engines are commonly based on mainly block-structured languages, such as BPEL, that differ structurally and semantically from process graphs. Recent work has accomplished elaborate mappings between both representations. Although most mappings strongly depend on the segmentation of the graph-model into components, the necessary graph-decomposition itself is not described in these works. This paper presents a novel approach based on Token Analysis to automatically identify components. The technique also allows for optimizations by integrating further steps in the translation of process graphs to executable workflows.","PeriodicalId":226791,"journal":{"name":"2009 13th Enterprise Distributed Object Computing Conference Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"23","resultStr":"{\"title\":\"Token analysis of graph-oriented process models\",\"authors\":\"Mathias Gotz, Stephan Roser, Florian Lautenbacher, B. Bauer\",\"doi\":\"10.1109/EDOCW.2009.5332020\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In Business Process Management, graph-based models are used to represent coordination protocols between collaborating partners as well as for service orchestration and composition. At runtime however, current process engines are commonly based on mainly block-structured languages, such as BPEL, that differ structurally and semantically from process graphs. Recent work has accomplished elaborate mappings between both representations. Although most mappings strongly depend on the segmentation of the graph-model into components, the necessary graph-decomposition itself is not described in these works. This paper presents a novel approach based on Token Analysis to automatically identify components. The technique also allows for optimizations by integrating further steps in the translation of process graphs to executable workflows.\",\"PeriodicalId\":226791,\"journal\":{\"name\":\"2009 13th Enterprise Distributed Object Computing Conference Workshops\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-11-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"23\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 13th Enterprise Distributed Object Computing Conference Workshops\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EDOCW.2009.5332020\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 13th Enterprise Distributed Object Computing Conference Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EDOCW.2009.5332020","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In Business Process Management, graph-based models are used to represent coordination protocols between collaborating partners as well as for service orchestration and composition. At runtime however, current process engines are commonly based on mainly block-structured languages, such as BPEL, that differ structurally and semantically from process graphs. Recent work has accomplished elaborate mappings between both representations. Although most mappings strongly depend on the segmentation of the graph-model into components, the necessary graph-decomposition itself is not described in these works. This paper presents a novel approach based on Token Analysis to automatically identify components. The technique also allows for optimizations by integrating further steps in the translation of process graphs to executable workflows.