Imperial College London
Professor Nobuko Yoshida

ProfessorNobukoYoshida

Faculty of Engineering, Department of Computing

Academic Visitor
 
 
 
//

Contact

 

+44 (0)20 7594 8240n.yoshida Website

 
 
//

Location

 

556Huxley BuildingSouth Kensington Campus

//

Summary

 

Publications

Citation

BibTex format

@inproceedings{Lange:2015:10.1145/2676726.2676964,
author = {Lange, J and Tuosto, E and Yoshida, N},
doi = {10.1145/2676726.2676964},
pages = {221--232},
publisher = {Association for Computing Machinery},
title = {From communicating machines to graphical choreographies},
url = {http://dx.doi.org/10.1145/2676726.2676964},
year = {2015}
}
Download

RIS format (EndNote, RefMan)

TY  - CPAPER
AB  - 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.
AU  - Lange,J
AU  - Tuosto,E
AU  - Yoshida,N
DO  - 10.1145/2676726.2676964
EP  - 232
PB  - Association for Computing Machinery
PY  - 2015///
SN  - 1523-2867
SP  - 221
TI  - From communicating machines to graphical choreographies
UR  - http://dx.doi.org/10.1145/2676726.2676964
UR  - http://hdl.handle.net/10044/1/23365
ER  -
Download