Formal verification of service composition in pervasive computing environments

Abstract

Pervasive Computing plays an integral role in our daily life. Due to the mobility and resource limit of devices in pervasive computing environments, the design and implementation of service composition will be a more complex and challenging task. In this paper, an approach based on behavioral modeling and analysis techniques for modeling service composition is proposed. A service behavior model is represented as Concurrent Regular Expressions and then is modeled as a Labelled Transition System by transforming Concurrent Regular Expressions into Finite State Process notation. Verification of the service behavior against specified system properties, (i.e. behavior consistency, safety) is becoming more flexible and effective.