Verifying Deadlock- and Livelock Freedom in an SOA Scenario

Abstract

In a service-oriented architecture (SOA), a service broker assigns a previously published service (stored in a service registry) to a service requester. It is desirable for the composition of the requesting and the assigned service to interact properly. While proper interaction is often reduced to deadlock freedom of the composed system, we additionally consider livelock freedom as a desirable property for the interaction of services. In principle, deadlock-and livelock freedom can be verified by inspecting the state space of the composition of (public views of) the involved services.The contribution of this paper is to propose a methodology to build that state space from pre-computed fragments which are computed upon publishing a service. That way, we shift computation time from the time critical "request" phase of service brokerage to the less critical "publish" phase. Interestingly, our setting enables state space reduction methods that are intrinsically different from traditional state space reductions.

Service Discovery Using Communication Fingerprints

“…For this purpose, we proposed an alternative check [20] which preprocesses fragments of the state space to be checked at publish time. However, even this check must in worst case be applied to all compositions R ⊕ P i where {P 1 , .…”

Industrial Robot Programming and UPnP Services Orchestration for the Automation of Factories

“…Nevertheless, if the system enters into a deadlock, a lot of time -and money -might be necessary in order to reset the process and synchronize the required devices so as to continue with production. With SOA-based systems, deadlocks can be detected -and, from there, avoided -as there is a continuous development of formal methods to check the deadlock freedom in SOA scenarios [26], [28] and [45].…”