On correlation sets and correlation exceptions in ActiveBPEL
Correlation sets are a programming primitive that allows instance identification in orchestration languages. A correlation set is a set of properties (i.e., values carried on by messages) that are used to associate each received message with a process instance: every time a service receives a messag...
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | SER |
| Materias: | |
| Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_03029743_v7173LNCS_n_p212_Melgratti |
| Aporte de: |
| Sumario: | Correlation sets are a programming primitive that allows instance identification in orchestration languages. A correlation set is a set of properties (i.e., values carried on by messages) that are used to associate each received message with a process instance: every time a service receives a message, it explores its content and determines a service instance that should handle the received message. Based on a concrete implementation, this paper proposes a formal model for correlation sets accounting for correlation exceptions. We also investigate different type systems aimed at ensuring that orchestrators are free from some kind of correlation exceptions. © 2012 Springer-Verlag. |
|---|