Please use this identifier to cite or link to this item:
Title: From Communicating Machines to Graphical Choreographies
Authors: Lange, Julien
Tuosto, Emilio
Yoshida, Nobuko
First Published: 17-Jan-2015
Presented at: Symposium on Principles of Programming Languages, POPL 2015, Mumbai, India
Start Date: 15-Jan-2015
End Date: 17-Jan-2015
Publisher: Association for Computing Machinery (ACM)
Citation: POPL '15 Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 221-232
Abstract: Graphical choreographies, or global graphs, are general multiparty session specifications featuring expressive constructs such as forking, merging, and joining for representing application-level protocols. Global graphs can be directly translated into modelling notations such as BPMN and UML. This paper presents an algorithm whereby a global graph can be constructed from asynchronous interactions represented by communicating finite-state machines (CFSMs). Our results include: a sound and complete characterisation of a subset of safe CFSMs from which global graphs can be constructed; an algorithm to translate CFSMs to global graphs; a time complexity analysis; and an implementation of our theory, as well as an experimental evaluation.
DOI Link: 10.1145/2676726.2676964
ISBN: 978-1-4503-3300-9
Version: Post-print
Status: Peer-reviewed
Type: Conference Paper
Rights: Copyright © 2015, ACM. Deposited with reference to the publisher’s open access archiving policy.
Appears in Collections:Conference Papers & Presentations, Dept. of Computer Science

Files in This Item:
File Description SizeFormat 
full_version.pdfPost-review (final submitted)4.19 MBAdobe PDFView/Open

Items in LRA are protected by copyright, with all rights reserved, unless otherwise indicated.