timed modeling and verification of bpel processes using time petri nets
文献类型:会议论文
作者 | Song Wei ; Ma Xiaoxing ; Ye Chunyang ; Dou Wanchun ; L ; Jian |
出版日期 | 2009 |
会议名称 | 9th International Conference on Quality Software, QSIC 2009 |
会议日期 | August 24, |
会议地点 | Jeju, Korea, Republic of |
关键词 | Graph theory Petri nets |
页码 | 92-97 |
英文摘要 | The execution time, an important criterion to measure the quality of a BPEL process, can be influenced by some slow external partner services (i.e., some long-running services). Therefore, it is desirable to specify response time of services into the SLAs (service level agreements). In this way, service consumers could verify whether the candidate services satisfy the expected time requirements before they are invoked. However, existing solutions are time-consuming especially when the BPEL process is quite complex (e.g., involving parallel structures and loops) and the number of candidate services is huge. To address this problem, in this paper, we propose a time Petri nets-based verification approach that efficiently verifies time requirements for a BPEL process. This allows service consumers to quickly identify suitable partner services that satisfy the time requirements at service looking up stage. © 2009 IEEE. |
收录类别 | EI |
会议主办者 | Software Engineering Society of Korean; Institute for Information Scientists and Engineers; IEEE Reliability Society; KAIST (Korea Advanced Institute of Science and Technology); Korea Information Promotion Agency; Samsung SDS |
会议录 | Proceedings - International Conference on Quality Software
![]() |
会议录出版地 | United States |
语种 | 英语 |
ISSN号 | 15506002 |
ISBN号 | 9780769538280 |
源URL | [http://124.16.136.157/handle/311060/8540] ![]() |
专题 | 软件研究所_软件所图书馆_2009年期刊/会议论文 |
推荐引用方式 GB/T 7714 | Song Wei,Ma Xiaoxing,Ye Chunyang,et al. timed modeling and verification of bpel processes using time petri nets[C]. 见:9th International Conference on Quality Software, QSIC 2009. Jeju, Korea, Republic of. August 24,. |
入库方式: OAI收割
来源:软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。