Formal identification of right-grained services for service-oriented modeling
- Authors
- Kim, Y.; Doh, K.-G.
- Issue Date
- Oct-2009
- Publisher
- Springer Verlag
- Keywords
- Business process model; Graph clustering; Service granularity; Service identification; UML activity diagram
- Citation
- Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), v.5802, pp 261 - 273
- Pages
- 13
- Journal Title
- Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
- Volume
- 5802
- Start Page
- 261
- End Page
- 273
- URI
- https://scholarworks.sookmyung.ac.kr/handle/2020.sw.sookmyung/148120
- DOI
- 10.1007/978-3-642-04409-0_29
- ISSN
- 0302-9743
1611-3349
- Abstract
- Identifying the right-grained services is important to lead the successful service orientation because it has a direct impact on two major goals: the composability of loosely-coupled services, and the reusability of individual services in different contexts. Although the concept of service orientation has been intensively debated in recent years, a unified methodic approach for identifying services has not yet been reached. In this paper, we suggest a formal approach to identify services at the right level of granularity from the business process model. Our approach uses the concept of graph clustering and provides a systematical approach by defining the cost metric as a measure of the interaction costs. To effectively extract service information from the business model, we take activities as the smallest units in service identification and cluster activities with high interaction cost into a task through hierarchical clustering algorithm, so as to reduce the coupling of remote tasks and to increase local task cohesion. © 2009 Springer-Verlag Berlin Heidelberg.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - 공과대학 > 기초공학부 > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.