Blind-date Conversation Joining.

@inproceedings{Cesari2013BlinddateCJ,
  title={Blind-date Conversation Joining.},
  author={Luca Cesari and Rosario Pugliese and Francesco Tiezzi},
  booktitle={WWV 2013},
  year={2013}
}
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… 
1 Citations

Figures and Tables from this paper

Blind-date conversation joining

This paper shows that the correlation mechanism provided by orchestration languages enables the blind-date conversation joining strategy, and formally describes its behaviour by resorting to COWS, a process calculus specifically designed for modelling service-oriented applications.

References

SHOWING 1-10 OF 17 REFERENCES

A Calculus for Orchestration of Web Services

It is shown that C?WS can model all the phases of the life cycle of service-oriented applications, such as publication, discovery, negotiation, orchestration, deployment, reconfiguration and execution, while modelling their dynamic behaviour.

Multiparty asynchronous session types

This work extends the foregoing theories of binary session types to multiparty, asynchronous sessions, which often arise in practical communication-centred applications, and introduces a new notion of types in which interactions involving multiple peers are directly abstracted as a global scenario.

Towards a Formal Foundation to Orchestration Languages

  • Mirko Viroli
  • Computer Science
    Electron. Notes Theor. Comput. Sci.
  • 2004

On Correlation Sets and Correlation Exceptions in ActiveBPEL

This paper proposes a formal model for correlation sets accounting for correlation exceptions, and investigates different type systems aimed at ensuring that orchestrators are free from some kind of correlation exceptions.

Deadlock-freedom-by-design: multiparty asynchronous global programming

This work proposes a purely-global programming model that defines a new class of deadlock-free concurrent systems, provides type inference, and supports session mobility, and develops a typing discipline that verifies choreographies against protocol specifications, based on multiparty sessions.

An Efficient Management of Correlation Sets with Broadcast

A data structure, based on radix trees and an algorithm for managing a correlation mechanism that supports the broadcast primitive, without degrading the performances are proposed.

Sessions and Pipelines for Structured Service Programming

The main result shows that in CaSPiS it is possible to program a "graceful termination" of nested sessions, which guarantees that no session is forced to hang forever after the loss of its partner.

Graceful Interruption of Request-Response Service Interactions

This work investigates an intermediate approach in which it is not necessary for the fault handler to wait for the response, but it is still possible on response arrival to gracefully close the conversation with the remote service.

JOLIE: a Java Orchestration Language Interpreter Engine