Compositional Choreographies

Fabrizio Montesi; Nobuko Yoshida

doi:10.1007/978-3-642-40184-8_30

Compositional Choreographies

Fabrizio Montesi, Nobuko Yoshida

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

We propose a new programming model that supports a compositionality of choreographies. The key of our approach is the introduction of partial choreographies, which can mix global descriptions with communications among external peers. We prove that if two choreographies are composable, then the endpoints independently generated from each choreography are also composable, preserving their typability and deadlock-freedom. The usability of our framework is demonstrated by modelling an industrial use case implemented in a tool for Web Services, Jolie.

Original language	English
Title of host publication	CONCUR 2013 – Concurrency Theory
Subtitle of host publication	24th International Conference, CONCUR 2013, Buenos Aires, Argentina, August 27-30, 2013. Proceedings
Publisher	Springer Berlin Heidelberg
Pages	425-439
Number of pages	15
ISBN (Electronic)	978-3-642-40184-8
ISBN (Print)	978-3-642-40183-1
DOIs	https://doi.org/10.1007/978-3-642-40184-8_30
Publication status	Published - 2013
Externally published	Yes

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer Berlin Heidelberg
Volume	8052
ISSN (Print)	0302-9743

Access to Document

10.1007/978-3-642-40184-8_30

http://link.springer.com/chapter/10.1007%2F978-3-642-40184-8_30

1 Finished

From Data Types to Session Types - A Basis for Concurrency and Distribution
Wadler, P.
EPSRC
20/05/13 → 19/11/20
Project: Research

Cite this

@inproceedings{34048a807e4141b295a4c947ac81a70a,

title = "Compositional Choreographies",

abstract = "We propose a new programming model that supports a compositionality of choreographies. The key of our approach is the introduction of partial choreographies, which can mix global descriptions with communications among external peers. We prove that if two choreographies are composable, then the endpoints independently generated from each choreography are also composable, preserving their typability and deadlock-freedom. The usability of our framework is demonstrated by modelling an industrial use case implemented in a tool for Web Services, Jolie.",

author = "Fabrizio Montesi and Nobuko Yoshida",

year = "2013",

doi = "10.1007/978-3-642-40184-8_30",

language = "English",

isbn = "978-3-642-40183-1",

series = "Lecture Notes in Computer Science",

publisher = "Springer Berlin Heidelberg",

pages = "425--439",

booktitle = "CONCUR 2013 – Concurrency Theory",

}

Compositional Choreographies. / Montesi, Fabrizio; Yoshida, Nobuko.

CONCUR 2013 – Concurrency Theory: 24th International Conference, CONCUR 2013, Buenos Aires, Argentina, August 27-30, 2013. Proceedings. Springer Berlin Heidelberg, 2013. p. 425-439 (Lecture Notes in Computer Science; Vol. 8052).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Compositional Choreographies

AU - Montesi, Fabrizio

AU - Yoshida, Nobuko

PY - 2013

Y1 - 2013

N2 - We propose a new programming model that supports a compositionality of choreographies. The key of our approach is the introduction of partial choreographies, which can mix global descriptions with communications among external peers. We prove that if two choreographies are composable, then the endpoints independently generated from each choreography are also composable, preserving their typability and deadlock-freedom. The usability of our framework is demonstrated by modelling an industrial use case implemented in a tool for Web Services, Jolie.

AB - We propose a new programming model that supports a compositionality of choreographies. The key of our approach is the introduction of partial choreographies, which can mix global descriptions with communications among external peers. We prove that if two choreographies are composable, then the endpoints independently generated from each choreography are also composable, preserving their typability and deadlock-freedom. The usability of our framework is demonstrated by modelling an industrial use case implemented in a tool for Web Services, Jolie.

U2 - 10.1007/978-3-642-40184-8_30

DO - 10.1007/978-3-642-40184-8_30

M3 - Conference contribution

SN - 978-3-642-40183-1

T3 - Lecture Notes in Computer Science

SP - 425

EP - 439

BT - CONCUR 2013 – Concurrency Theory

PB - Springer Berlin Heidelberg

ER -

Compositional Choreographies

Abstract

Publication series

Access to Document

Fingerprint

Projects

From Data Types to Session Types - A Basis for Concurrency and Distribution

Cite this