Blind-date Conversation Joining
Luca Cesari (Universit\`a di Pisa / Universit\`a degli Studi di, Firenze, Italy), Rosario Pugliese (Universit\`a degli Studi di Firenze,, Italy), Francesco Tiezzi (IMT Advanced Studies Lucca, Italy)
TL;DR
This paper introduces a method for clients to asynchronously join ongoing conversations in service-oriented applications without prior knowledge, using orchestration languages and formal semantics for implementation and analysis.
Contribution
It presents a novel 'blind-date joining' approach enabled by WS-BPEL and formalized with COWS, enhancing flexibility in conversation participation.
Findings
Implemented blind-date joining with WS-BPEL
Provided formal semantics using COWS
Validated approach with an online games case study
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.