{"title":"多方业务协议的正式框架","authors":"M. Mancioppi","doi":"10.2139/ssrn.1272903","DOIUrl":null,"url":null,"abstract":"Service Oriented Architecture deployments comprise large numbers of long-running, highly dynamic complex end-to-end service interactions reflecting asynchronous message flows that typically transcend several organizations and span several geographical locations. Business protocols are formalisms to model the structure of the message-based interactions among services and can be flexible ranging from conventional inter-organizational point-to-point service interactions to fully blown dynamic multi-party interactions of global reach. In this work we introduce a formal framework based on Deterministic Finite Automata enriched with temporal constraints, to describe multi-party business protocols. We extend this framework with the notion of multi-party business protocol soundness and show how it is possible to execute a multi-party protocol consistently in a completely distributed manner while guaranteeing eventual termination.","PeriodicalId":262155,"journal":{"name":"POL: Service Industry (Topic)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A Formal Framework for Multi-Party Business Protocols\",\"authors\":\"M. Mancioppi\",\"doi\":\"10.2139/ssrn.1272903\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Service Oriented Architecture deployments comprise large numbers of long-running, highly dynamic complex end-to-end service interactions reflecting asynchronous message flows that typically transcend several organizations and span several geographical locations. Business protocols are formalisms to model the structure of the message-based interactions among services and can be flexible ranging from conventional inter-organizational point-to-point service interactions to fully blown dynamic multi-party interactions of global reach. In this work we introduce a formal framework based on Deterministic Finite Automata enriched with temporal constraints, to describe multi-party business protocols. We extend this framework with the notion of multi-party business protocol soundness and show how it is possible to execute a multi-party protocol consistently in a completely distributed manner while guaranteeing eventual termination.\",\"PeriodicalId\":262155,\"journal\":{\"name\":\"POL: Service Industry (Topic)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-01-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"POL: Service Industry (Topic)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2139/ssrn.1272903\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"POL: Service Industry (Topic)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2139/ssrn.1272903","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Formal Framework for Multi-Party Business Protocols
Service Oriented Architecture deployments comprise large numbers of long-running, highly dynamic complex end-to-end service interactions reflecting asynchronous message flows that typically transcend several organizations and span several geographical locations. Business protocols are formalisms to model the structure of the message-based interactions among services and can be flexible ranging from conventional inter-organizational point-to-point service interactions to fully blown dynamic multi-party interactions of global reach. In this work we introduce a formal framework based on Deterministic Finite Automata enriched with temporal constraints, to describe multi-party business protocols. We extend this framework with the notion of multi-party business protocol soundness and show how it is possible to execute a multi-party protocol consistently in a completely distributed manner while guaranteeing eventual termination.