Asynchronous Messaging between Web Services Using SSDL
IEEE Internet Computing
ASDL: a wide spectrum language for designing web services
Proceedings of the 15th international conference on World Wide Web
Verification of web service descriptions using graph-based traversal algorithms
Proceedings of the 2007 ACM symposium on Applied computing
Formal interaction specification in public health surveillance systems using π-calculus
Computer Methods and Programs in Biomedicine
VGC: Generating Valid Global Communication Models of Composite Services Using Temporal Reasoning
ICSOC '08 Proceedings of the 6th International Conference on Service-Oriented Computing
Finite-state verification of the ebXML protocol
Electronic Commerce Research and Applications
Verification of Web Services with Timed Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
Verification of business process integration options
BPM'06 Proceedings of the 4th international conference on Business Process Management
Automatic translation of WS-CDL choreographies to timed automata
EPEW'05/WS-FM'05 Proceedings of the 2005 international conference on European Performance Engineering, and Web Services and Formal Methods, international conference on Formal Techniques for Computer Systems and Business Processes
| Hi-index | 0.00 |
Availability of a wide variety of Web services over the Internet offers opportunities of providing new value added services built by composing them out of existing ones. Service composition poses a number of challenges. A composite service can be very complex in structure, containing many temporal and data-flow dependencies between their constituent services. Furthermore, each individual service is likely to have its own sequencing constraints over its operations. It is highly desirable therefore to be able to validate that a given composite service is well formed: proving that it will not deadlock or livelock and that it respects the sequencing constraints of the constituent services. With this aim in mind, the paper proposes simple extensions to web service definition language (WSDL) enabling the order in which the exposed operations should be invoked to be specified. In addition, the paper proposes a composition language for defining the structure of a composite service. Both languages have an XML notation and a formal basis in the 驴-calculus (a calculus for concurrent systems). The paper presents the main features of these languages, and shows how it is possible to validate a composite service by applying the 驴-calculus reaction rules.