m (Scipediacontent moved page Draft Content 608135092 to Boreale et al 2008a) |
|||
Line 3: | Line 3: | ||
Service-oriented computing is calling for novel computational models and languages with primitives for client-server interaction, orchestration and unexpected events handling. We present CaSPiS , a process calculus where the notions of session and pipelining play a central role. Sessions are two-sided and can be equipped with protocols executed by each side. Pipelining permits orchestrating the flow of data produced by different sessions. The calculus is also equipped with operators for handling (unexpected) termination of the partner's side of a session. Several examples are presented to provide evidence for the flexibility of the chosen set of primitives. Our 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. | Service-oriented computing is calling for novel computational models and languages with primitives for client-server interaction, orchestration and unexpected events handling. We present CaSPiS , a process calculus where the notions of session and pipelining play a central role. Sessions are two-sided and can be equipped with protocols executed by each side. Pipelining permits orchestrating the flow of data produced by different sessions. The calculus is also equipped with operators for handling (unexpected) termination of the partner's side of a session. Several examples are presented to provide evidence for the flexibility of the chosen set of primitives. Our 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. | ||
− | |||
− | |||
− | |||
− | |||
− | |||
Line 15: | Line 10: | ||
* [https://link.springer.com/content/pdf/10.1007%2F978-3-540-68863-1_3.pdf https://link.springer.com/content/pdf/10.1007%2F978-3-540-68863-1_3.pdf] | * [https://link.springer.com/content/pdf/10.1007%2F978-3-540-68863-1_3.pdf https://link.springer.com/content/pdf/10.1007%2F978-3-540-68863-1_3.pdf] | ||
+ | |||
+ | * [http://link.springer.com/content/pdf/10.1007/978-3-540-68863-1_3 http://link.springer.com/content/pdf/10.1007/978-3-540-68863-1_3], | ||
+ | : [http://dx.doi.org/10.1007/978-3-540-68863-1_3 http://dx.doi.org/10.1007/978-3-540-68863-1_3] | ||
+ | |||
+ | * [https://link.springer.com/chapter/10.1007/978-3-540-68863-1_3 https://link.springer.com/chapter/10.1007/978-3-540-68863-1_3], | ||
+ | : [https://core.ac.uk/display/154843804 https://core.ac.uk/display/154843804], | ||
+ | : [https://dblp.uni-trier.de/db/conf/fmoods/fmoods2008.html#BorealeBNL08 https://dblp.uni-trier.de/db/conf/fmoods/fmoods2008.html#BorealeBNL08], | ||
+ | : [https://www.di.unipi.it/~bruni/publications/Slides-FMOODS-2008.pdf https://www.di.unipi.it/~bruni/publications/Slides-FMOODS-2008.pdf], | ||
+ | : [https://dl.acm.org/citation.cfm?id=1424552 https://dl.acm.org/citation.cfm?id=1424552], | ||
+ | : [http://eprints.imtlucca.it/281 http://eprints.imtlucca.it/281], | ||
+ | : [https://doi.org/10.1007/978-3-540-68863-1_3 https://doi.org/10.1007/978-3-540-68863-1_3], | ||
+ | : [https://arpi.unipi.it/handle/11568/121472 https://arpi.unipi.it/handle/11568/121472], | ||
+ | : [https://rd.springer.com/chapter/10.1007/978-3-540-68863-1_3 https://rd.springer.com/chapter/10.1007/978-3-540-68863-1_3], | ||
+ | : [https://academic.microsoft.com/#/detail/1492982544 https://academic.microsoft.com/#/detail/1492982544] |
Service-oriented computing is calling for novel computational models and languages with primitives for client-server interaction, orchestration and unexpected events handling. We present CaSPiS , a process calculus where the notions of session and pipelining play a central role. Sessions are two-sided and can be equipped with protocols executed by each side. Pipelining permits orchestrating the flow of data produced by different sessions. The calculus is also equipped with operators for handling (unexpected) termination of the partner's side of a session. Several examples are presented to provide evidence for the flexibility of the chosen set of primitives. Our 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.
The different versions of the original document can be found in:
Published on 01/01/2008
Volume 2008, 2008
DOI: 10.1007/978-3-540-68863-1_3
Licence: CC BY-NC-SA license
Are you one of the authors of this document?