full_version.pdf (4.09 MB)
From Communicating Machines to Graphical Choreographies
conference contribution
posted on 2015-03-27, 15:38 authored by Julien Lange, Emilio Tuosto, Nobuko YoshidaGraphical 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.
History
Citation
POPL '15 Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 221-232Author affiliation
/Organisation/COLLEGE OF SCIENCE AND ENGINEERING/Department of Computer ScienceSource
Symposium on Principles of Programming Languages, POPL 2015, Mumbai, IndiaVersion
- AM (Accepted Manuscript)