Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/1640206.1640225acmotherconferencesArticle/Chapter ViewAbstractPublication PagesinternetwareConference Proceedingsconference-collections
research-article

Formal verification of service composition in pervasive computing environments

Published: 17 October 2009 Publication History
  • Get Citation Alerts
  • 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.

    References

    [1]
    Weiser, M. 1991. The computer for the 21st century. Science American, 265, 3 (Sep. 1991), 66--75.
    [2]
    Chakraborty, D., Perich, F., Joshi, A., Finin, T., and Yesha, Y. 2002. A reactive service composition architecture for pervasive computing environments. In: Proceedings of the 7th personal wireless communications conference, Singapore, 53--62.
    [3]
    Vijay, K. G., and Ragunath M. T. 1992. Concurrent Regular Expressions and Their Relationship to Petri Nets. Theory of Computer Science, 96, 2, 285--304.
    [4]
    Okazaki, M., Aoki, T., and Katayama, T. 2002. Extracting threads from concurrent objects for the design of embedded systems, In Proceedings of Asia-Pacific Software Engineering Conference APSEC 2002, 107--116.
    [5]
    Jansamak, S., and Surarerks, A. 2004. Formalization of UML Statechart Models Using Concurrent Regular Expressions. In Proc. 27th Australasian Computer Science Conference (ACSC2004), Dunedin, New Zealand, CRPIT, 26. Estivill-Castro, V., Ed. ACS, 83--88.
    [6]
    Vijay, K. G. 1989. Modeling of distribute systems by concurrent regular expressions. In 2nd Int. Conf. on Formal Description Techniques for Distributed Systems and Communication Protocols, Vancouver, Canada.
    [7]
    Campbell, R. H., and Habermann, A. N. 1974. The specification of process synchronization by path expressions. In E. Gelenbe and C. Kaiser, editors, Int. Symp. on Operating Systems, volume 16 of LNCS,. Springer-Verlag, 89--102.
    [8]
    Jeff, M., and Jeff, K. 2006. Concurrency: state models and java programs. John Wiley, New York, NY, USA, Second Edition.
    [9]
    Foster, H., Emmerich, W., Kramer, J., Magee, J., Rosenblum, D., and Uchitel, S. 2007. Model Checking Service Compositions under Resource Constraints. In Proceedings of ESEC/FSE 2007, Dubrovnik, Croatia.
    [10]
    Breugel, F. V., and Koshkina, M. 2006. Models and Verification of BPEL, Technical Report, York University, Toronto, Canada (2006), http://www.cse.yorku.ca/~franck/research/drafts/tutorial.pdf.
    [11]
    Foster, H., Uchitel, S., J Kramer, J., Magee, J. 2003. Model-based Verification of Web Service Compositions. IEEE Automated Software Engineering (ASE) 2003, Montreal, Canada.
    [12]
    Dhaminda A. 2008. Pervasive Services Engineering for SOAs. ICSOC PhD Symposium 2008, 6th International Conference on Service Oriented Computing, December 1--5, 2008, University of Technology, Sydney.
    [13]
    Foster, H. 2006. A Rigorous Approach to Engineering Web Service Compositions. PhD thesis, Imperial College, London, UK.
    [14]
    Holzmann, G. J. 2004. The Spin Model Checker: Primer and Reference Manual. Addison-Wesley, Boston, MA, USA.
    [15]
    Jeff, M., Jeff, K., Robert, C., Sebastian, U., and Howard, F. 2009. Labelled Transition System Analyser (LTSA v3.0). http://www.doc.ic.ac.uk/ltsa/.
    [16]
    Xiang, F., Tevfik, B., and Jianwen, S. 2004. WSAT: A tool for formal analysis of web services. In R. Alur and D. Peled, editors, Proceedings of the 16th International Conference on Computer Aided Verification, volume 3114 of LNCS, Springer-Verlag, 510--514.
    [17]
    Tevfik, B. 2008. Service Choreography and Orchestration with Conversations. Invited abstract. Proceedings of the 9th International Conference on Concurrency Theory (CONCUR 2008), Toronto, Canada, 2--3.

    Cited By

    View all
    • (2023)Formal Analysis of Trust and Reputation for Service Composition in IoTSensors10.3390/s2306319223:6(3192)Online publication date: 16-Mar-2023

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Other conferences
    Internetware '09: Proceedings of the First Asia-Pacific Symposium on Internetware
    October 2009
    150 pages
    ISBN:9781605588728
    DOI:10.1145/1640206
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    • CCF: China Computer Federation

    In-Cooperation

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 17 October 2009

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. concurrent regular expressions
    2. finite state process
    3. pervasive computing environments
    4. service composition

    Qualifiers

    • Research-article

    Funding Sources

    Conference

    Internetware '09
    Sponsor:
    • CCF

    Acceptance Rates

    Overall Acceptance Rate 55 of 111 submissions, 50%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)1
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 09 Aug 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2023)Formal Analysis of Trust and Reputation for Service Composition in IoTSensors10.3390/s2306319223:6(3192)Online publication date: 16-Mar-2023

    View Options

    Get Access

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media