Design of composable services

Feuerlicht, G

Design of composable services

Feuerlicht, G

Permalink

Publication Type:: Conference Proceeding
Citation:: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2009, 5472 LNCS pp. 15 - 27
Issue Date:: 2009-11-09

Open Access

Copyright Clearance Process

Recently Added
In Progress
Open Access

This item is open access.

Adobe PDF

Download full textAdobe PDF (301.35 kB)

View on publisher's site

View statistics

Full metadata record

Field	Value	Language
dc.contributor.author	Feuerlicht, G	en_US
dc.date.issued	2009-11-09	en_US
dc.identifier.citation	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2009, 5472 LNCS pp. 15 - 27	en_US
dc.identifier.isbn	3642012469	en_US
dc.identifier.isbn	9783642012464	en_US
dc.identifier.issn	0302-9743	en_US
dc.identifier.uri	http://hdl.handle.net/10453/11894
dc.description.abstract	Service composition methods range from industry standard approaches based on Web Services and BPEL to Semantic Web approaches that rely on AI techniques to automate service discovery and composition. Service composition research mostly focuses on the dynamic (workflow) aspects of compositions. In this paper we consider the static component of service composition and discuss the importance of compatibility of service interfaces in ensuring the composability of services. Using a flight booking scenario example we show that reducing the granularity of services by decomposition into service operations with normalized interfaces produces compatible interfaces that facilitate service assembly. We then show how relational algebra can be used to represent service operations and provide a framework for service assembly. © 2009 Springer Berlin Heidelberg.	en_US
dc.relation.ispartof	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)	en_US
dc.relation.isbasedon	10.1007/978-3-642-01247-1_3	en_US
dc.subject.classification	Artificial Intelligence & Image Processing	en_US
dc.title	Design of composable services	en_US
dc.type	Conference Proceeding
utslib.citation.volume	5472 LNCS	en_US
utslib.for	080309 Software Engineering	en_US
utslib.for	080604 Database Management	en_US
dc.location.activity	Sydney, Australia	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Strength - HCTD - Human Centred Technology Design
utslib.copyright.status	open_access
pubs.publication-status	Published	en_US
pubs.volume	5472 LNCS	en_US

Abstract:

Service composition methods range from industry standard approaches based on Web Services and BPEL to Semantic Web approaches that rely on AI techniques to automate service discovery and composition. Service composition research mostly focuses on the dynamic (workflow) aspects of compositions. In this paper we consider the static component of service composition and discuss the importance of compatibility of service interfaces in ensuring the composability of services. Using a flight booking scenario example we show that reducing the granularity of services by decomposition into service operations with normalized interfaces produces compatible interfaces that facilitate service assembly. We then show how relational algebra can be used to represent service operations and provide a framework for service assembly. © 2009 Springer Berlin Heidelberg.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/11894