Automata Semantics and Analysis of BPEL
Zheng, Yongyan and Krause, Paul J. (2007) Automata Semantics and Analysis of BPEL In: 2007 Inaugural IEEE-IES Digital EcoSystems and Technologies Conference.
Web service is an emerging paradigm for distributed computing. In order to verify web services rigorously, it is important to provide a formal semantics for flow-based web service languages such as BPEL. A suitable formal model should cover most features of BPEL. The existing formal models either abstract from data, cover a simple subset of BPEL, or omit the interactions between BPEL activities. This paper presents Web Service Automata, an extension of Mealy machines, to fulfil the formal model requirements of the web service domain. Secondly, the paper analyses the control handling and data handling of BPEL, so that these can be verified in a clear manner.
|Item Type:||Conference or Workshop Item (UNSPECIFIED)|
|Divisions :||Faculty of Engineering and Physical Sciences > Computing Science|
|Date :||21 February 2007|
|Uncontrolled Keywords :||BPEL, Web service, design model analysis, finite state machine|
|Additional Information :||In Proceedings of the 2007 Inaugural IEEE International Conference on Digital Ecosystems and Technologies (IEEE DEST 2007), pp. 147 - 152.© 2007 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
|Depositing User :||Mr Adam Field|
|Date Deposited :||27 May 2010 14:46|
|Last Modified :||23 Sep 2013 18:36|
Actions (login required)
Downloads per month over past year