Multiparty symmetric sum types

Publikation: Bidrag til bog/antologi/rapportKonferencebidrag i proceedingsForskningfagfællebedømt

Dokumenter

  • Lasse Nielsen
  • Nobuko Yoshida
  • Kohei Honda
This paper introduces a new theory of multiparty session types based on symmetric sum types, by which we can type non-deterministic orchestration choice behaviours. While the original branching type in session types can represent a choice made by a single participant and accepted by others determining how the session proceeds, the symmetric sum type represents a choice made by agreement among all the participants of a session. Such behaviour can be found in many practical systems, including collaborative workflow in healthcare systems for clinical practice guidelines (CPGs).
Processes with the symmetric sums can be embedded into the original branching types using conductor processes. We show that this type-driven embedding preserves typability, satisfies semantic soundness and completeness, and meets the encodability criteria adapted to the typed setting. The theory leads to an efficient implementation of a prototypical tool for CPGs which automatically translates the original CPG specifications from a representation called the Process Matrix to symmetric sum types,
type checks programs and executes them.
OriginalsprogEngelsk
TitelProceedings 17th International Workshop on Expressiveness in Concurrency
RedaktørerSibylle Fröschle, Frank D. Valencia
Antal sider15
Vol/bind41
Publikationsdato2010
Sider121-135
DOI
StatusUdgivet - 2010
Begivenhed17th International Workshop on Expressiveness in Concurrency - Paris, Frankrig
Varighed: 30 aug. 201030 aug. 2010
Konferencens nummer: 17

Konference

Konference17th International Workshop on Expressiveness in Concurrency
Nummer17
LandFrankrig
ByParis
Periode30/08/201030/08/2010
NavnElectronic Proceedings in Theoretical Computer Science
ISSN2075-2180

Antal downloads er baseret på statistik fra Google Scholar og www.ku.dk


Ingen data tilgængelig

ID: 172644242