Abstract
Web service is an emerging paradigm for distributed computing. First, in order to verify Web services rigorously, it is important to provide a formal semantics for the flow-based Web service language (WS). A suitable formal model should cover most features of the WS. The existing formal models either abstract from data, cover a simple subset of WS, or omit the interactions between certain components. This paper presents a Web service automaton, an extension of Mealy machine, to fulfill the formal model requirements of the Web service domain. Second, semantic compatibility checking between Web services is another important issue. The existing checking approaches are post-checking, where the compatibility is checked after composition. As a complement to post-checking, we proposes anti-patterns for Web service interactions as a pre-checking, so that certain incompatible Web services can be modified or re-selected in the earliest stages
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
