{"title":"使用正式组合方法和时间自动机的业务流程验证","authors":"L. Mendoza","doi":"10.1109/CLEI.2013.6670616","DOIUrl":null,"url":null,"abstract":"Several firms are defining their Business Processes (BPs) using the standard Business Process Model and Notation (BPMN). BPs modelled with BPMN are maintained and used by different workers within a company, thus the correctness of critical BPs should be validated and verified. In this work we present how Model Checking verification technique for software has been integrated within a Formal Compositional Verification Approach (FVCA) and Timed Automata (TA) to allow the automatic verification of critical BPs modelled with BPMN. The use of our FVCA support business analysts and designers in the formal specification of BP-task model with TA. The application of the FVCA is aimed at guaranteeing the correctness of the BP-task model with respect to initial properties specification derived from business rules. In order to show a practical use of our proposal and Uppaal tool, one instance of an enterprise-project related to Customer Relationship Management business is discussed.","PeriodicalId":263586,"journal":{"name":"Latin American Computing Conference / Conferencia Latinoamericana En Informatica","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Business process verification using a Formal Compositional Approach and Timed Automata\",\"authors\":\"L. Mendoza\",\"doi\":\"10.1109/CLEI.2013.6670616\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Several firms are defining their Business Processes (BPs) using the standard Business Process Model and Notation (BPMN). BPs modelled with BPMN are maintained and used by different workers within a company, thus the correctness of critical BPs should be validated and verified. In this work we present how Model Checking verification technique for software has been integrated within a Formal Compositional Verification Approach (FVCA) and Timed Automata (TA) to allow the automatic verification of critical BPs modelled with BPMN. The use of our FVCA support business analysts and designers in the formal specification of BP-task model with TA. The application of the FVCA is aimed at guaranteeing the correctness of the BP-task model with respect to initial properties specification derived from business rules. In order to show a practical use of our proposal and Uppaal tool, one instance of an enterprise-project related to Customer Relationship Management business is discussed.\",\"PeriodicalId\":263586,\"journal\":{\"name\":\"Latin American Computing Conference / Conferencia Latinoamericana En Informatica\",\"volume\":\"45 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Latin American Computing Conference / Conferencia Latinoamericana En Informatica\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CLEI.2013.6670616\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Latin American Computing Conference / Conferencia Latinoamericana En Informatica","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CLEI.2013.6670616","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Business process verification using a Formal Compositional Approach and Timed Automata
Several firms are defining their Business Processes (BPs) using the standard Business Process Model and Notation (BPMN). BPs modelled with BPMN are maintained and used by different workers within a company, thus the correctness of critical BPs should be validated and verified. In this work we present how Model Checking verification technique for software has been integrated within a Formal Compositional Verification Approach (FVCA) and Timed Automata (TA) to allow the automatic verification of critical BPs modelled with BPMN. The use of our FVCA support business analysts and designers in the formal specification of BP-task model with TA. The application of the FVCA is aimed at guaranteeing the correctness of the BP-task model with respect to initial properties specification derived from business rules. In order to show a practical use of our proposal and Uppaal tool, one instance of an enterprise-project related to Customer Relationship Management business is discussed.