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. Proceedings of the 9th International Workshop on Automated Specification and Verification of Web Systems (WWV2013)
Blind-date Conversation Joining / L. Cesari; R. Pugliese; F. Tiezzi. - In: ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE. - ISSN 2075-2180. - ELETTRONICO. - 123:(2013), pp. 3-18. [10.4204/EPTCS.123.3]
Blind-date Conversation Joining
PUGLIESE, ROSARIO;F. Tiezzi
2013
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. Proceedings of the 9th International Workshop on Automated Specification and Verification of Web Systems (WWV2013)I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.