{"title":"将WS-BPEL转换为定时自动机","authors":"Pramate Chandratarat, W. Vatanawood","doi":"10.1145/3374549.3374566","DOIUrl":null,"url":null,"abstract":"Web Service Business Process Execution Language (WS-BPEL) has become the business standard for orchestration of services and implemented the business process from the service composition notion. Including kinds of activities or conditions for describing the complex business requirement, such as the interaction between the service provider and operation process. In the real world of business processes have been involved services with complex interaction and have to comply with a variety of workflow and time constraints. How to prove that the time constraints and workflow control of the WS-BPEL are correct and consistent. Before beginning the system development process, for clearing this concern, we introduce the algorithm of the transformation rules from WS-BPEL to Timed Automata (TA). In this paper, Timed Automata is a part of model checking theory used as a target model for verifying time constraints and control flow of WS-BPEL as a source model. UPPAAL model checker tool used to verify our model after transformed for checking WS-BPEL properties such as liveness, safety property and deadlock-free. For proving this approach, BPEL2TdA was built to support automating transformation.","PeriodicalId":187087,"journal":{"name":"Proceedings of the 2019 3rd International Conference on Software and e-Business","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Transforming WS-BPEL into Timed Automata\",\"authors\":\"Pramate Chandratarat, W. Vatanawood\",\"doi\":\"10.1145/3374549.3374566\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Web Service Business Process Execution Language (WS-BPEL) has become the business standard for orchestration of services and implemented the business process from the service composition notion. Including kinds of activities or conditions for describing the complex business requirement, such as the interaction between the service provider and operation process. In the real world of business processes have been involved services with complex interaction and have to comply with a variety of workflow and time constraints. How to prove that the time constraints and workflow control of the WS-BPEL are correct and consistent. Before beginning the system development process, for clearing this concern, we introduce the algorithm of the transformation rules from WS-BPEL to Timed Automata (TA). In this paper, Timed Automata is a part of model checking theory used as a target model for verifying time constraints and control flow of WS-BPEL as a source model. UPPAAL model checker tool used to verify our model after transformed for checking WS-BPEL properties such as liveness, safety property and deadlock-free. For proving this approach, BPEL2TdA was built to support automating transformation.\",\"PeriodicalId\":187087,\"journal\":{\"name\":\"Proceedings of the 2019 3rd International Conference on Software and e-Business\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-12-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2019 3rd International Conference on Software and e-Business\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3374549.3374566\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2019 3rd International Conference on Software and e-Business","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3374549.3374566","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Web Service Business Process Execution Language (WS-BPEL) has become the business standard for orchestration of services and implemented the business process from the service composition notion. Including kinds of activities or conditions for describing the complex business requirement, such as the interaction between the service provider and operation process. In the real world of business processes have been involved services with complex interaction and have to comply with a variety of workflow and time constraints. How to prove that the time constraints and workflow control of the WS-BPEL are correct and consistent. Before beginning the system development process, for clearing this concern, we introduce the algorithm of the transformation rules from WS-BPEL to Timed Automata (TA). In this paper, Timed Automata is a part of model checking theory used as a target model for verifying time constraints and control flow of WS-BPEL as a source model. UPPAAL model checker tool used to verify our model after transformed for checking WS-BPEL properties such as liveness, safety property and deadlock-free. For proving this approach, BPEL2TdA was built to support automating transformation.