An Approach to Tackle Livelock-Freedom in SOA

We calculate a fixed finite set of state space fragments for a service P, where each fragment carries a part of the whole behavior of P. By composing these fragments according to the behavior of a service R we build the state space of their composition P R which can be checked for deadlocks and livelocks. We show that this approach is applicable to realize a "find" request by a service R with a provided service P in SOA.

• Type: Conference
• Year: 2008
• Where: AWPN
• Authors: Christian Stahl, Karsten Wolf
• Keywords: Algorithms, AWPN 2008, Fixed Finite Set, State Space, State Space Fragments