Formal verification of service composition in pervasive computing environments

Authors:
Junqing Chen;Linpeng Huang
Affiliations:
Shanghai Jiao Tong University, Shanghai, P.R. China;Shanghai Jiao Tong University, Shanghai, P.R. China
Venue:
Proceedings of the First Asia-Pacific Symposium on Internetware
Year:
2009

Citing 9
Cited 0

Concurrent regular expressions and their relationship to Petri nets

Theoretical Computer Science
Modeling of Distributed Systems by Concurrent Regular Expressions

FORTE '89 Proceedings of the IFIP TC/WG6.1 Second International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols
A Reactive Service Composition Architecture for Pervasive Computing Environments

PWC '02 Proceedings of the IFIP TC6/WG6.8 Working Conference on Personal Wireless Communications
The specification of process synchronization by path expressions

Operating Systems, Proceedings of an International Symposium
Extracting threads from concurrent objects for the design of embedded systems

APSEC '02 Proceedings of the Ninth Asia-Pacific Software Engineering Conference
Formalization of UML statechart models using Concurrent Regular Expressions

ACSC '04 Proceedings of the 27th Australasian conference on Computer science - Volume 26
Concurrency: State Models And Java Programs

Concurrency: State Models And Java Programs
Model checking service compositions under resource constraints

Proceedings of the the 6th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering
Spin model checker, the: primer and reference manual

Spin model checker, the: primer and reference manual

Quantified Score

Hi-index	0.00

Visualization

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.