Blind-date Conversation Joining

Luca Cesari
(Università di Pisa / Università degli Studi di Firenze, Italy)
Rosario Pugliese
(Università degli Studi di Firenze, Italy)
Francesco Tiezzi
(IMT Advanced Studies Lucca, Italy)

We focus on a form of joining conversations among multiple parties in service-oriented applications where a client may asynchronously join an existing conversation without need to know in advance any information about it. More specifically, we show how the correlation mechanism provided by orchestration languages enables a form of conversation joining that is completely transparent to clients and that we call 'blind-date joining'. We provide an implementation of this strategy by using the standard orchestration language WS-BPEL. We then present its formal semantics by resorting to COWS, a process calculus specifically designed for modelling service-oriented applications. We illustrate our approach by means of a simple, but realistic, case study from the online games domain.

In António Ravara and Josep Silva: Proceedings 9th International Workshop on Automated Specification and Verification of Web Systems (WWV 2013), Florence, Italy, 6th June 2013, Electronic Proceedings in Theoretical Computer Science 123, pp. 3–18.
Published: 31st July 2013.

ArXived at: http://dx.doi.org/10.4204/EPTCS.123.3 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org