Navegar

Colección

Datos Estadísticas

Artículo

Este artículo es de Acceso Abierto y puede ser descargado en su versión final desde nuestro repositorio
Consulte el artículo en la página del editor
Consulte la política de Acceso Abierto del editor

Abstract:

Orchestrators are descriptions at implementation level and may contain sensitive information that should be kept private. Consequently, orchestration languages come equipped with a notion of abstract processes, which enable the interaction among parties while hiding private information. An interesting question is whether an abstract process accurately describes the behavior of a concrete process so to ensure that some particular property is preserved when composing services. In this paper we focus on compliance, i.e, the correct interaction of two orchestrators and we introduce two definitions of abstraction: one in terms of traces, called trace-based abstraction, and the other as a generalization of symbolic bisimulation, called simulation-based abstraction.We show that simulation-based abstraction is strictly more refined than trace-based abstraction and that simulation-based abstraction behaves well with respect to compliance.

Registro:

Documento: Artículo
Título:Abstract processes in orchestration languages
Autor:Buscemi, M.G.; Melgratti, H.
Ciudad:York
Filiación:IMT Lucca Institute for Advanced Studies, Italy
FCEyN, University of Buenos Aires, Argentina
Palabras clave:Abstract process; Concrete process; Private information; Sensitive informations; Simulation-based; Simulation-based abstraction; Symbolic bisimulation; Channel capacity; Linguistics; Abstracting
Año:2009
Volumen:5502
Página de inicio:301
Página de fin:315
DOI: http://dx.doi.org/10.1007/978-3-642-00590-9_22
Título revista:18th European Symposium on Programming, ESOP 2009
Título revista abreviado:Lect. Notes Comput. Sci.
ISSN:03029743
PDF:https://bibliotecadigital.exactas.uba.ar/download/paper/paper_03029743_v5502_n_p301_Buscemi.pdf
Registro:https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03029743_v5502_n_p301_Buscemi

Referencias:

  • Alur, R., Henzinger, T.A., Kupferman, O., Vardi, M.Y., Alternating Refinement Relations (1998) LECTURE NOTES IN COMPUTER SCIENCE, (1466), pp. 163-178. , CONCUR '98 Concurrency Theory
  • Arun-Kumar, S., Natarajan, V., Conformance: A precongruence close to bisimilarity (1995) STRICT, pp. 148-165. , Springer Workshops in Computer Series, Springer, Heidelberg
  • Boreale, M., De Nicola, R., A symbolic semantics for the pi-calculus (1996) Information and Computation, 126 (1), pp. 34-52
  • Bravetti, M., Zavattaro, G., Towards a unifying theory for choreography conformance and contract compliance (2007) Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 34-50. , 4829 LNCS Software Composition - 6th International Symposium, SC 2007, Revised Selected Papers
  • Castagna, G., Gesbert, N., Padovani, L., A theory of contracts for web services (2008) POPL 2008, pp. 261-272. , In: Necula, G.C.,Wadler, P. (eds.), ACM, New York
  • De Alfaro, L., Henzinger, T.A., Interface Theories for Component-Based Design (2001) LECTURE NOTES IN COMPUTER SCIENCE, (2211), pp. 148-165. , Embedded Software. First International Workshop, EMSOFT 2001 Tahoe City, CA, USA, October 8-10, 2001 Proceedings
  • Dezani-Ciancaglini, M., Mostrous, D., Yoshida, N., Drossopoulou, S., Session types for object-oriented languages (2006) Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 328-352. , 4067 LNCSECOOP 2006 - Object-Oriented Programming - 20th European Conference, Proceedings
  • Fournet, C., Hoare, C.A.R., Rajamani, S., Rehof, J., Stuck-free conformance (2004) CAV 2004. LNCS, 3114, pp. 242-254. , In: Alur, R., Peled, D.A. (eds.), Springer, Heidelberg
  • Gay, S., Hole, M., Subtyping for session types in the pi calculus (2005) Acta Informatica, 42 (2-3), pp. 191-225. , DOI 10.1007/s00236-005-0177-z
  • Hennessy, M., Lin, H., Symbolic bisimulations (1995) Theoretical Computer Science, 138, pp. 353-389
  • Honda, K., Types for dyadic interaction (1993) CONCUR 1993. LNCS, 715, pp. 509-523. , In: Best, E. (ed.), Springer, Heidelberg
  • Laneve, C., Padovani, L., The must preorder revisited (2007) CONCUR 2007. LNCS, 4703, pp. 212-225. , In: Caires, L., Vasconcelos, V.T. (eds.), Springer, Heidelberg
  • Laneve, C., Padovani, L., The pairing of contracts and session types (2008) Concurrency, Graphs and Models. LNCS, 5065, pp. 681-700. , In: Degano, P., De Nicola, R., Meseguer, J. (eds.), Springer, Heidelberg
  • Massuthe, P., Schmidt, K., Operating guidelines - An automata-theoretic foundation for the service-oriented architecture (2005) Proceedings - International Conference on Quality Software, 2005, pp. 452-457. , DOI 10.1109/QSIC.2005.47, 1579171, Proceedings - Fifth International Conference on Quality Software, QSIC 2005
  • Milner, R., A calculus of communicating systems (1980) LNCS, 92. , Springer, Heidelberg
  • Milner, R., (1989) Communication and Concurrency, , Prentice Hall International, Englewood Cliffs

Citas:

---------- APA ----------
Buscemi, M.G. & Melgratti, H. (2009) . Abstract processes in orchestration languages. 18th European Symposium on Programming, ESOP 2009, 5502, 301-315.
http://dx.doi.org/10.1007/978-3-642-00590-9_22
---------- CHICAGO ----------
Buscemi, M.G., Melgratti, H. "Abstract processes in orchestration languages" . 18th European Symposium on Programming, ESOP 2009 5502 (2009) : 301-315.
http://dx.doi.org/10.1007/978-3-642-00590-9_22
---------- MLA ----------
Buscemi, M.G., Melgratti, H. "Abstract processes in orchestration languages" . 18th European Symposium on Programming, ESOP 2009, vol. 5502, 2009, pp. 301-315.
http://dx.doi.org/10.1007/978-3-642-00590-9_22
---------- VANCOUVER ----------
Buscemi, M.G., Melgratti, H. Abstract processes in orchestration languages. Lect. Notes Comput. Sci. 2009;5502:301-315.
http://dx.doi.org/10.1007/978-3-642-00590-9_22