Web Services allow an enterprise to focus on its own business expertise and to employ information technology services offered by others, however, doing so exposes the enterprise to the risk of loss of service or data, if the service provider fails. The use of multiple service providers reduces the risk of failure, but it introduces the complication of incompatible service interfaces, data formats, and stored data. In this paper, we propose a conversion infrastructure that facilitates the use of multiple alternative Web Services at different service providers, to achieve high availability, even in the event of a failure or a catastrophe.
{"title":"Conversion Infrastructure for Maintaining High Availability of Web Services Using Multiple Service Providers","authors":"P. Melliar-Smith, L. Moser","doi":"10.1109/ICWS.2015.110","DOIUrl":"https://doi.org/10.1109/ICWS.2015.110","url":null,"abstract":"Web Services allow an enterprise to focus on its own business expertise and to employ information technology services offered by others, however, doing so exposes the enterprise to the risk of loss of service or data, if the service provider fails. The use of multiple service providers reduces the risk of failure, but it introduces the complication of incompatible service interfaces, data formats, and stored data. In this paper, we propose a conversion infrastructure that facilitates the use of multiple alternative Web Services at different service providers, to achieve high availability, even in the event of a failure or a catastrophe.","PeriodicalId":250871,"journal":{"name":"2015 IEEE International Conference on Web Services","volume":"10 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128744494","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Wei Song, Xiaoxu Xia, H. Jacobsen, Pengcheng Zhang, Hao Hu
Event logs are of paramount significance for process mining and complex event processing. Yet, the quality of event logs remains a serious problem. Missing events of logs are usually caused by omitting manual recording, system failures, and hybrid storage of executions of different processes. It has been proved that the problem of minimum recovery based on a priori process specification is NP-hard. State-of-the-art approach is still lacking in efficiency because of the large search space. To address this issue, in this paper, we leverage the technique of process decomposition and present heuristics to efficiently prune the unqualified sub-processes that fail to generate the minimum recovery. We employ real-world processes and their incomplete sequences to evaluate our heuristic approach. The experimental results demonstrate that our approach achieves high accuracy as the state-of-the-art approach does, but it is more efficient.
{"title":"Heuristic Recovery of Missing Events in Process Logs","authors":"Wei Song, Xiaoxu Xia, H. Jacobsen, Pengcheng Zhang, Hao Hu","doi":"10.1109/ICWS.2015.24","DOIUrl":"https://doi.org/10.1109/ICWS.2015.24","url":null,"abstract":"Event logs are of paramount significance for process mining and complex event processing. Yet, the quality of event logs remains a serious problem. Missing events of logs are usually caused by omitting manual recording, system failures, and hybrid storage of executions of different processes. It has been proved that the problem of minimum recovery based on a priori process specification is NP-hard. State-of-the-art approach is still lacking in efficiency because of the large search space. To address this issue, in this paper, we leverage the technique of process decomposition and present heuristics to efficiently prune the unqualified sub-processes that fail to generate the minimum recovery. We employ real-world processes and their incomplete sequences to evaluate our heuristic approach. The experimental results demonstrate that our approach achieves high accuracy as the state-of-the-art approach does, but it is more efficient.","PeriodicalId":250871,"journal":{"name":"2015 IEEE International Conference on Web Services","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130414071","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
With the rapid growth of cloud computing, developing business applications on Platform-as-a-Service (PaaS) systems is increasingly popular among industry companies. Various services are developed to support different business requirements on PaaS systems. However, to the best of our knowledge, currently there is no service that provides mobile social messaging services to enable users of their apps to share messages in their social networks (e.g., We Chat, Whats App, Kaka Talk). Lack of such mobile social messaging services prevents industry companies from succeeding in drastic market competitions (e.g., Capture high customer satisfactory). In this paper, we propose a service-based framework to enable the mobile social messaging in PaaS systems (e.g., IBM Blue mix). Using this framework, developers can focus on the service encapsulation of existing applications, and define their business process flows via the conversation management in our platform (no coding work is needed). As such, our framework can effectively reduce the development workload for mobile social messaging in PaaS systems.
随着云计算的快速发展，在平台即服务(PaaS)系统上开发业务应用程序在行业公司中越来越流行。开发了各种服务来支持PaaS系统上的不同业务需求。然而，据我们所知，目前还没有一种服务提供移动社交信息服务，使其应用程序的用户能够在他们的社交网络中分享信息(例如，We Chat, what App, Kaka Talk)。缺乏这样的移动社交信息服务阻碍了行业公司在激烈的市场竞争中取得成功(例如，获取高客户满意度)。在本文中，我们提出了一个基于服务的框架来实现PaaS系统(例如，IBM Blue组合)中的移动社交消息传递。使用这个框架，开发人员可以专注于现有应用程序的服务封装，并通过我们平台中的会话管理定义他们的业务流程流(不需要编码工作)。因此，我们的框架可以有效地减少PaaS系统中移动社交消息传递的开发工作量。
{"title":"A Service-Based Framework for Mobile Social Messaging in PaaS Systems","authors":"Lijun Mei, Hao Chen, Shaochun Li, Qicheng Li, Guangtai Liang, Jeaha Yang","doi":"10.1109/ICWS.2015.108","DOIUrl":"https://doi.org/10.1109/ICWS.2015.108","url":null,"abstract":"With the rapid growth of cloud computing, developing business applications on Platform-as-a-Service (PaaS) systems is increasingly popular among industry companies. Various services are developed to support different business requirements on PaaS systems. However, to the best of our knowledge, currently there is no service that provides mobile social messaging services to enable users of their apps to share messages in their social networks (e.g., We Chat, Whats App, Kaka Talk). Lack of such mobile social messaging services prevents industry companies from succeeding in drastic market competitions (e.g., Capture high customer satisfactory). In this paper, we propose a service-based framework to enable the mobile social messaging in PaaS systems (e.g., IBM Blue mix). Using this framework, developers can focus on the service encapsulation of existing applications, and define their business process flows via the conversation management in our platform (no coding work is needed). As such, our framework can effectively reduce the development workload for mobile social messaging in PaaS systems.","PeriodicalId":250871,"journal":{"name":"2015 IEEE International Conference on Web Services","volume":"149 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131310448","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Yu Lei, Jiantao Zhou, Fengqi Wei, Yongqiang Gao, Bo Yang
How we manage Web services depends on how we understand their variable parts and invariable parts. Studying them separately could make Web service research much easier and make our software architecture much more loose-coupled. We summarize two variable parts that affect Web service compositions: uncertain invocation results and uncertain quality of services. These uncertain factors affect success rate of service composition. Previous studies model the Web service problem as a planning problem, while this problem is considered as an uncertain planning problem in this paper. Specifically, we use Partially Observable Markov Decision Process to deal with the uncertain planning problem for service composition. According to the uncertain model, we propose a reinforcement learning method, which is an uncertainty planning method, to compose web services. The proposed method does not need to know complete information of services, instead it uses historical data and estimates the successful possibilities that services are composed together with respect to service outcomes and QoS. Simulation experiments verify the validity of the algorithm, and the results also show that our method improves the success rate of the service composition.
{"title":"Web Service Composition Based on Reinforcement Learning","authors":"Yu Lei, Jiantao Zhou, Fengqi Wei, Yongqiang Gao, Bo Yang","doi":"10.1109/ICWS.2015.103","DOIUrl":"https://doi.org/10.1109/ICWS.2015.103","url":null,"abstract":"How we manage Web services depends on how we understand their variable parts and invariable parts. Studying them separately could make Web service research much easier and make our software architecture much more loose-coupled. We summarize two variable parts that affect Web service compositions: uncertain invocation results and uncertain quality of services. These uncertain factors affect success rate of service composition. Previous studies model the Web service problem as a planning problem, while this problem is considered as an uncertain planning problem in this paper. Specifically, we use Partially Observable Markov Decision Process to deal with the uncertain planning problem for service composition. According to the uncertain model, we propose a reinforcement learning method, which is an uncertainty planning method, to compose web services. The proposed method does not need to know complete information of services, instead it uses historical data and estimates the successful possibilities that services are composed together with respect to service outcomes and QoS. Simulation experiments verify the validity of the algorithm, and the results also show that our method improves the success rate of the service composition.","PeriodicalId":250871,"journal":{"name":"2015 IEEE International Conference on Web Services","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121153218","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
M. Hale, R. Gamble, John Hale, Charles Haney, Jessica Lin, Charles Walter
Sending malicious content to users for obtaining personnel, financial, or intellectual property has become a multi-billion dollar criminal enterprise. This content is primarily presented in the form of emails, social media posts, and phishing websites. User training initiatives seek to minimize the impact of malicious content through improved vigilance. Training works best when tailored to specific user deficiencies. However, tailoring training requires understanding how malicious content victimizes users. In this paper, we link a set of malicious content design factors, in the form of degradations and sophistications, to their potential to form a victimization prediction metric. The design factors examined are developed from an analysis of over 100 pieces of content from email, social media and websites. We conducted an experiment using a sample of the content and a game-based simulation platform to evaluate the efficacy of our victimization prediction metric. The experimental results and their analysis are presented as part of the evaluation.
{"title":"Measuring the Potential for Victimization in Malicious Content","authors":"M. Hale, R. Gamble, John Hale, Charles Haney, Jessica Lin, Charles Walter","doi":"10.1109/ICWS.2015.49","DOIUrl":"https://doi.org/10.1109/ICWS.2015.49","url":null,"abstract":"Sending malicious content to users for obtaining personnel, financial, or intellectual property has become a multi-billion dollar criminal enterprise. This content is primarily presented in the form of emails, social media posts, and phishing websites. User training initiatives seek to minimize the impact of malicious content through improved vigilance. Training works best when tailored to specific user deficiencies. However, tailoring training requires understanding how malicious content victimizes users. In this paper, we link a set of malicious content design factors, in the form of degradations and sophistications, to their potential to form a victimization prediction metric. The design factors examined are developed from an analysis of over 100 pieces of content from email, social media and websites. We conducted an experiment using a sample of the content and a game-based simulation platform to evaluate the efficacy of our victimization prediction metric. The experimental results and their analysis are presented as part of the evaluation.","PeriodicalId":250871,"journal":{"name":"2015 IEEE International Conference on Web Services","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121749660","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
As software consumption is shifting to mobile platforms, enterprises are looking for efficient ways to reuse their existing legacy systems by exposing their functionalities as services. Mining services from legacy code is therefore an important problem for the enterprises. In this paper we present a technique for mining service candidates from the database applications. Central to our mining technique is the specification and identification of data-access patterns which specify how a program interacts with the databases. In addition to finding service candidates which are internal functions in the source code, we also provide an algorithm to expose the function as a stateless service by generating a wrapper function around the internal function. We demonstrate the effectiveness of our technique on two open source applications and twelve industrial applications.
{"title":"Service Mining from Legacy Database Applications","authors":"Diptikalyan Saha","doi":"10.1109/ICWS.2015.66","DOIUrl":"https://doi.org/10.1109/ICWS.2015.66","url":null,"abstract":"As software consumption is shifting to mobile platforms, enterprises are looking for efficient ways to reuse their existing legacy systems by exposing their functionalities as services. Mining services from legacy code is therefore an important problem for the enterprises. In this paper we present a technique for mining service candidates from the database applications. Central to our mining technique is the specification and identification of data-access patterns which specify how a program interacts with the databases. In addition to finding service candidates which are internal functions in the source code, we also provide an algorithm to expose the function as a stateless service by generating a wrapper function around the internal function. We demonstrate the effectiveness of our technique on two open source applications and twelve industrial applications.","PeriodicalId":250871,"journal":{"name":"2015 IEEE International Conference on Web Services","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122730942","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Service orientation is one of the most popular paradigms for developing modular distributed software systems. In spite of the substantial research effort dedicated to the development of methods and tools to support SOAP-based service-oriented application development, in practice, RESTful services have surpassed SOAP-based services in popularity and adoption, primarily due to the simplicity of their invocation. However, poor adoption of REST specification standards and lack of systematic development tools have given rise to many, more or less compliant, variants of the Restful style constraints, which undermine the evolvability and interoperability of these systems. In this paper, we describe a tool that supports the systematization of RESTful application development, through the use of semi-automatically constructed WADL interface specifications, without compromising the ease of the overall practice. We illustrate the use and advantages of our tool on real-world REST APIs. Additionally, we comment on how REST APIs are documented, especially in comparison to the auto-generated WADLs.
{"title":"Using WADL Specifications to Develop and Maintain REST Client Applications","authors":"Marios Fokaefs, Eleni Stroulia","doi":"10.1109/ICWS.2015.21","DOIUrl":"https://doi.org/10.1109/ICWS.2015.21","url":null,"abstract":"Service orientation is one of the most popular paradigms for developing modular distributed software systems. In spite of the substantial research effort dedicated to the development of methods and tools to support SOAP-based service-oriented application development, in practice, RESTful services have surpassed SOAP-based services in popularity and adoption, primarily due to the simplicity of their invocation. However, poor adoption of REST specification standards and lack of systematic development tools have given rise to many, more or less compliant, variants of the Restful style constraints, which undermine the evolvability and interoperability of these systems. In this paper, we describe a tool that supports the systematization of RESTful application development, through the use of semi-automatically constructed WADL interface specifications, without compromising the ease of the overall practice. We illustrate the use and advantages of our tool on real-world REST APIs. Additionally, we comment on how REST APIs are documented, especially in comparison to the auto-generated WADLs.","PeriodicalId":250871,"journal":{"name":"2015 IEEE International Conference on Web Services","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131443106","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Online Social Networks (OSNs) have become an integral part of daily life in recent years. OSNs contain important participants, the trust relations between participants, and the contexts in which participants interact with each other. All of these have a great influence on the prediction of the trust between a source participant and a target participant, which is important for a participant's decision-making process in many applications, such as seeking service providers. However, predicting the trust from a source participant to a target one based on the whole social network is not really feasible. Thus, prior to trust prediction, the extraction of a small-scale sub-network containing most of the important nodes and contextual information with a high density rate could make trust prediction more efficient and effective. However, extracting such a sub-network has been proved to be an NP-Complete problem. To address this challenging problem, we propose BiNet: a social context-aware trust sub-network extraction model to search for near-optimal solutions effectively and efficiently. In this model, we first capture important factors that affect the trust between participants in OSNs. Next, we define a utility function to measure the trust factors of each node in a social network. At last, we design a novel binary ant colony algorithm with newly designed initialization and mutation processes for sub-network extraction incorporating the utility function. The experiments, conducted on two popular datasets of Epinion and Slash dot, demonstrate that our approach can extract sub-networks covering important participants and contextual information while keeping a high density rate. Our approach is superior to the state-of-the-art approaches in terms of the quality of extracted sub-networks within the same execution time.
{"title":"BiNet: Trust Sub-network Extraction Using Binary Ant Colony Algorithm in Contextual Social Networks","authors":"Xiaoming Zheng, Yan Wang, M. Orgun","doi":"10.1109/ICWS.2015.51","DOIUrl":"https://doi.org/10.1109/ICWS.2015.51","url":null,"abstract":"Online Social Networks (OSNs) have become an integral part of daily life in recent years. OSNs contain important participants, the trust relations between participants, and the contexts in which participants interact with each other. All of these have a great influence on the prediction of the trust between a source participant and a target participant, which is important for a participant's decision-making process in many applications, such as seeking service providers. However, predicting the trust from a source participant to a target one based on the whole social network is not really feasible. Thus, prior to trust prediction, the extraction of a small-scale sub-network containing most of the important nodes and contextual information with a high density rate could make trust prediction more efficient and effective. However, extracting such a sub-network has been proved to be an NP-Complete problem. To address this challenging problem, we propose BiNet: a social context-aware trust sub-network extraction model to search for near-optimal solutions effectively and efficiently. In this model, we first capture important factors that affect the trust between participants in OSNs. Next, we define a utility function to measure the trust factors of each node in a social network. At last, we design a novel binary ant colony algorithm with newly designed initialization and mutation processes for sub-network extraction incorporating the utility function. The experiments, conducted on two popular datasets of Epinion and Slash dot, demonstrate that our approach can extract sub-networks covering important participants and contextual information while keeping a high density rate. Our approach is superior to the state-of-the-art approaches in terms of the quality of extracted sub-networks within the same execution time.","PeriodicalId":250871,"journal":{"name":"2015 IEEE International Conference on Web Services","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130387996","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Lina Yao, Xianzhi Wang, Quan Z. Sheng, Wenjie Ruan, Wei Zhang
In this paper, we explore service recommendation and selection in the reusable composition context. The goal is to aid developers finding the most appropriate services in their composition tasks. We specifically focus on mashups, a domain that increasingly targets people without sophisticated programming knowledge. We propose a probabilistic matrix factorization approach with implicit correlation regularization to solve this problem. In particular, we advocate that the co-invocation of services in mashups is driven by both explicit textual similarity and implicit correlation of services, and therefore develop a latent variable model to uncover the latent connections between services by analyzing their co-invocation patterns. We crawled a real dataset from Programmable Web, and extensively evaluated the effectiveness of our proposed approach.
{"title":"Service Recommendation for Mashup Composition with Implicit Correlation Regularization","authors":"Lina Yao, Xianzhi Wang, Quan Z. Sheng, Wenjie Ruan, Wei Zhang","doi":"10.1109/ICWS.2015.38","DOIUrl":"https://doi.org/10.1109/ICWS.2015.38","url":null,"abstract":"In this paper, we explore service recommendation and selection in the reusable composition context. The goal is to aid developers finding the most appropriate services in their composition tasks. We specifically focus on mashups, a domain that increasingly targets people without sophisticated programming knowledge. We propose a probabilistic matrix factorization approach with implicit correlation regularization to solve this problem. In particular, we advocate that the co-invocation of services in mashups is driven by both explicit textual similarity and implicit correlation of services, and therefore develop a latent variable model to uncover the latent connections between services by analyzing their co-invocation patterns. We crawled a real dataset from Programmable Web, and extensively evaluated the effectiveness of our proposed approach.","PeriodicalId":250871,"journal":{"name":"2015 IEEE International Conference on Web Services","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124820724","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A. Weiss, V. Andrikopoulos, Michael Hahn, D. Karastoyanova
Reuse of service orchestrations or service compositions is extensively studied in the literature of process modeling. Sub-processes, process templates, process variants, and process reference models are employed as reusable elements for these purposes. The concept of process fragments has been previously introduced in order to capture parts of a process model and store them for later reuse. However, similar efforts on facilitating the reuse of processes that cross the boundaries of organizations expressed as service choreographies are not available yet. In this paper, we introduce the concept of choreography fragments as reusable elements for service choreography modeling. Choreography fragments can be extracted from choreography models, adapted, stored, and later inserted into new models. Based on a formal model for choreography fragments, we define methods and algorithms for the extraction and insertion of fragments from and into service choreographies. We then discuss an experimental and proof-of-concept evaluation of our proposal.
{"title":"Enabling the Extraction and Insertion of Reusable Choreography Fragments","authors":"A. Weiss, V. Andrikopoulos, Michael Hahn, D. Karastoyanova","doi":"10.1109/ICWS.2015.96","DOIUrl":"https://doi.org/10.1109/ICWS.2015.96","url":null,"abstract":"Reuse of service orchestrations or service compositions is extensively studied in the literature of process modeling. Sub-processes, process templates, process variants, and process reference models are employed as reusable elements for these purposes. The concept of process fragments has been previously introduced in order to capture parts of a process model and store them for later reuse. However, similar efforts on facilitating the reuse of processes that cross the boundaries of organizations expressed as service choreographies are not available yet. In this paper, we introduce the concept of choreography fragments as reusable elements for service choreography modeling. Choreography fragments can be extracted from choreography models, adapted, stored, and later inserted into new models. Based on a formal model for choreography fragments, we define methods and algorithms for the extraction and insertion of fragments from and into service choreographies. We then discuss an experimental and proof-of-concept evaluation of our proposal.","PeriodicalId":250871,"journal":{"name":"2015 IEEE International Conference on Web Services","volume":"235 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123041454","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：