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...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autor principal: Melgratti, H.
Otros Autores: Roldán, C.
Formato: Acta de conferencia Capítulo de libro
Lenguaje:Inglés
Publicado: 2012
Acceso en línea:Registro en Scopus
DOI
Handle
Registro en la Biblioteca Digital
Aporte de:Registro referencial: Solicitar el recurso aquí
LEADER 05192caa a22005417a 4500
001 PAPER-9467
003 AR-BaUEN
005 20230518203923.0
008 190411s2012 xx ||||fo|||| 00| 0 eng|d
024 7 |2 scopus  |a 2-s2.0-84864029132 
040 |a Scopus  |b spa  |c AR-BaUEN  |d AR-BaUEN 
100 1 |a Melgratti, H. 
245 1 3 |a On correlation sets and correlation exceptions in ActiveBPEL 
260 |c 2012 
270 1 0 |m Melgratti, H.; Departamento de Computación, FCEyN, Universidad de Buenos AiresArgentina 
506 |2 openaire  |e Política editorial 
504 |a Bonelli, E., Compagnoni, A., Multipoint Session Types for a Distributed Calculus (2008) LNCS, 4912, pp. 240-256. , Barthe, G., Fournet, C. (eds.) TGC 2007. Springer, Heidelberg 
504 |a Boreale, M., Bruni, R., Caires, L., De Nicola, R., Lanese, I., Loreti, M., Martins, F., Zavattaro, G., SCC: A Service Centered Calculus (2006) LNCS, 4184, pp. 38-57. , Bravetti, M., Núñez, M., Zavattaro, G. (eds.) WS-FM 2006. Springer, Heidelberg 
504 |a (2004) Web Services Addressing (Ws-addressing), , http://www.w3.org/Submission/ws-addressing/, August 
504 |a (2007) Web Services Business Process Execution L Anguage (BPEL), , http://docs.oasis-open.org/wsbpel/2.0/wsbpel-v2.0.pdf, version 2.0 April 
504 |a Guidi, C., Lanese, I., Montesi, F., Zavattaro, G., On the interplay between fault handling and request-response service invocations (2008) Proceedings of 8th International Conference on Application of Concurrency to System Design (ACSD 2008), pp. 190-198. , IEEE 
504 |a Guidi, C., Lucchi, R., Gorrieri, R., Busi, N., Zavattaro, G., SOCK: A Calculus for Service Oriented Computing (2006) LNCS, 4294, pp. 327-338. , Dan, A., Lamersdorf, W. (eds.) ICSOC 2006. Springer, Heidelberg 
504 |a Honda, K., Vasconcelos, V.T., Kubo, M., Language Primitives and Type Discipline for Structured Communication-Based Programming (1998) LNCS, 1381, pp. 122-138. , Hankin, C. (ed.) ESOP 1998. Springer, Heidelberg 
504 |a Lanese, I., Vasconcelos, V.T., Martins, F., Ravara, A., Disciplining orchestration and conversation in service-oriented computing (2007) Proc. of SEFM2007, pp. 305-314. , IEEE Computer Society Press 
504 |a Lapadula, A., Pugliese, R., Tiezzi, F., A Calculus for Orchestration of Web Services (2007) LNCS, 4421, pp. 33-47. , De Nicola, R. (ed.) ESOP 2007. Springer, Heidelberg 
504 |a Lapadula, A., Pugliese, R., Tiezzi, F., A Formal Account of WS-BPEL (2008) LNCS, 5052, pp. 199-215. , Wang, A.H., Zavattaro, G. (eds.) COORDINATION 2008. Springer, Heidelberg 
504 |a Milner, R., A Calculus of Communication Systems (1980) LNCS, 92. , Springer, Heidelberg 
504 |a Plotkin, G., (1981) A Structural Approach to Operational Semantics, , Technical Report DAIMI FN-19, Aarhus University, Computer Science Department 
504 |a Viroli, M., A core calculus for correlation in orchestration languages (2007) J. Log. Algebr. Program., 70 (1), pp. 74-95A4 - Project ASCENS 
520 3 |a 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.  |l eng 
593 |a Departamento de Computación, FCEyN, Universidad de Buenos Aires, Argentina 
593 |a CONICET, Argentina 
690 1 0 |a FORMAL MODEL 
690 1 0 |a PROCESS INSTANCES 
690 1 0 |a SERVICE INSTANCES 
690 1 0 |a TYPE SYSTEMS 
690 1 0 |a ARTIFICIAL INTELLIGENCE 
700 1 |a Roldán, C. 
711 2 |c Aachen  |d 9 June 2011 through 10 June 2011  |g Código de la conferencia: 91249 
773 0 |d 2012  |g v. 7173 LNCS  |h pp. 212-226  |p Lect. Notes Comput. Sci.  |n Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)  |x 03029743  |w (AR-BaUEN)CENRE-983  |z 9783642300646  |t 6th International Symposium on Trustworthy Global Computing, TGC 2011 
856 4 1 |u https://www.scopus.com/inward/record.uri?eid=2-s2.0-84864029132&doi=10.1007%2f978-3-642-30065-3_13&partnerID=40&md5=08206f1a41f5013e7de93c513ac19645  |y Registro en Scopus 
856 4 0 |u https://doi.org/10.1007/978-3-642-30065-3_13  |y DOI 
856 4 0 |u https://hdl.handle.net/20.500.12110/paper_03029743_v7173LNCS_n_p212_Melgratti  |y Handle 
856 4 0 |u https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03029743_v7173LNCS_n_p212_Melgratti  |y Registro en la Biblioteca Digital 
961 |a paper_03029743_v7173LNCS_n_p212_Melgratti  |b paper  |c PE 
962 |a info:eu-repo/semantics/article  |a info:ar-repo/semantics/artículo  |b info:eu-repo/semantics/publishedVersion 
963 |a VARI 
999 |c 70420