eprintid: 115 rev_number: 18 eprint_status: archive userid: 29 dir: disk0/00/00/01/15 datestamp: 2011-03-03 11:38:59 lastmod: 2011-07-11 14:33:42 status_changed: 2011-03-03 11:38:59 type: book_section metadata_visibility: show item_issues_count: 0 creators_name: Buscemi, Maria Grazia creators_name: Melgratti, Hernán C. creators_id: m.buscemi@imtlucca.it creators_id: title: Contracts for Abstract Processes in Service Composition ispublished: pub subjects: QA75 divisions: CSA full_text_status: public note: ©M.G. Buscemi & H. Melgratti This work is licensed under the Creative Commons Attribution License. abstract: Contracts are a well-established approach for describing and analyzing behavioral aspects of web service compositions. The theory of contracts comes equipped with a notion of compatibility between clients and servers that ensures that every possible interaction between compatible clients and servers will complete successfully. It is generally agreed that real applications often require the ability of exposing just partial descriptions of their behaviors, which are usually known as abstract processes. We propose a formal characterization of abstraction as an extension of the usual symbolic bisimulation and we recover the notion of abstraction in the context of contracts. date: 2011-01 date_type: published series: Electronic Proceedings in Theoretical Computer volume: 46 publisher: Electronic Proceedings in Theoretical Computer Science pagerange: 9-27 id_number: 10.4204/EPTCS.46.2 refereed: TRUE book_title: Proceedings Foundations for Interface Technologies (FIT’10). editors_name: Legay, Axel editors_name: Caillaud, Benoît official_url: http://dx.doi.org/10.4204/EPTCS.46.2 funders: Research supported by the EU FET-GC2 IST-2004-16004 Integrated Project SENSORIA citation: Buscemi, Maria Grazia and Melgratti, Hernán C. Contracts for Abstract Processes in Service Composition. In: Proceedings Foundations for Interface Technologies (FIT’10). Electronic Proceedings in Theoretical Computer, 46 . Electronic Proceedings in Theoretical Computer Science, pp. 9-27. (2011) document_url: http://eprints.imtlucca.it/115/1/buscemi_melgratti_FIT10.pdf