普适计算环境中服务组合的正式验证

Junqing Chen, Linpeng Huang
{"title":"普适计算环境中服务组合的正式验证","authors":"Junqing Chen, Linpeng Huang","doi":"10.1145/1640206.1640225","DOIUrl":null,"url":null,"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.","PeriodicalId":20631,"journal":{"name":"Proceedings of the 8th Asia-Pacific Symposium on Internetware","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2009-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Formal verification of service composition in pervasive computing environments\",\"authors\":\"Junqing Chen, Linpeng Huang\",\"doi\":\"10.1145/1640206.1640225\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":20631,\"journal\":{\"name\":\"Proceedings of the 8th Asia-Pacific Symposium on Internetware\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-10-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 8th Asia-Pacific Symposium on Internetware\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1640206.1640225\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 8th Asia-Pacific Symposium on Internetware","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1640206.1640225","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

普适计算在我们的日常生活中扮演着不可或缺的角色。由于普适计算环境中设备的移动性和资源限制,服务组合的设计和实现将是一项更加复杂和具有挑战性的任务。本文提出了一种基于行为建模和分析技术的服务组合建模方法。将服务行为模型表示为并发正则表达式,然后通过将并发正则表达式转换为有限状态过程表示法,将服务行为模型建模为标记转换系统。根据指定的系统属性(即行为一致性、安全性)验证服务行为正变得更加灵活和有效。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Formal verification of service composition in pervasive computing environments
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信