From communicating machines to graphical choreographies

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn 2015-January, Issue , 2015, Pages 221-232

  Lange, Julien ^a   Tuosto, Emilio ^b   Yoshida, Nobuko ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

^b UNIVERSITY OF LEICESTER   (United Kingdom)

Author keywords

Choreography; Communicating finite state machines; Global graphs; Multiparty session types; Theory of regions

Indexed keywords

COMPUTATIONAL LINGUISTICS; GRAPH THEORY; GRAPHIC METHODS; LOGIC CIRCUITS;

CHOREOGRAPHY; COMMUNICATING FINITE STATE MACHINES; GLOBAL GRAPHS; MULTIPARTY SESSIONS; THEORY OF REGIONS;

TRANSLATION (LANGUAGES);

EID: 84939531690     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2676726.2676964     Document Type: Conference Paper

References (33)

1. Business Process Model and Notation. http://www.bpmn.org.
2. Petrify. http://www.lsi.upc.edu/jordicf/petrify/.
3. SAVARA Testable Architecture. http://www.jboss.org/savara.
4. Zero Deviation Lifecycle. http://www.zdlc.co.
5. Full version of this paper. http://www.doc.ic.ac.uk/jlange/papers/lty15.pdf, 2014.
6. GMC-Synthesis. https://bitbucket.org/julien-lange/gmc-synthesis, 2014.
7. R. Alur, K. Etessami, and M. Yannakakis. Inference of Message Sequence Charts. IEEE Trans. Software Eng., 29(7):623-633, 2003.
8. E. Badouel and P. Darondeau. Theory of regions. In Petri Nets, volume 1491 of LNCS, pages 529-586. Springer, 1996.
9. C. Baier, J. Klein, and S. Klüppelholz. Synthesis of reo connectors for strategies and controllers. Fundam. Inform., 130(1):1-20, 2014.
10. S. Basu and T. Bultan. Choreography conformance via synchronizability. In WWW, pages 795-804. ACM, 2011.
11. S. Basu, T. Bultan, and M. Ouederni. Synchronizability for verification of asynchronously communicating systems. In VMCAI, volume 7148 of LNCS. Springer, 2012.
12. S. Basu, T. Bultan, and M. Ouederni. Deciding choreography realizability. In POPL, pages 191-202. ACM, 2012.
13. F. Bonchi and D. Pous. Checking nfa equivalence with bisimulations up to congruence. In POPL, pages 457-468. ACM, 2013.
14. D. Brand and P. Zafiropulo. On communicating finite-state machines. JACM, 30(2):323-342, 1983.
15. A. Bucchiarone, H. Melgratti, and F. Severoni. Testing service composition. In Proceedings of the 8th Argentine Symposium on Software Engineering (ASSE07), 2007.
16. G. Castagna, M. Dezani-Ciancaglini, and L. Padovani. On global types and multi-party session. LMCS, 8(1), 2012.
17. G. Cécé and A. Finkel. Verification of programs with half-duplex communication. I&C, 202(2):166-190, 2005.
18. W. W. W. Consortium. Web services choreography description language version 1.0. http://www.w3.org/TR/ws-cdl-10/2005.
19. J. Cortadella, M. Kishinevsky, L. Lavagno, and A. Yakovlev. Deriving Petri Nets for Finite Transition Systems. IEEE Trans. Computers, 47 (8):859-882, 1998.
20. P. Deniélou and N. Yoshida. Multiparty session types meet communicating automata. In ESOP, volume 7211 of LNCS, pages 194-213. Springer, 2012.
21. P.-M. Deniélou and N. Yoshida. Multiparty compatibility in communicating automata: Characterisation and synthesis of global session types. In ICALP, volume 7966 of LNCS, pages 174-186, 2013.
22. M. Güdemann, G. Salaün, and M. Ouederni. Counterexample guided synthesis of monitors for realizability enforcement. In ATVA, volume 7561 of LNCS, pages 238-253, 2012.
23. S. Hallé and T. Bultan. Realizability analysis for message-based interactions using shared-state projections. In SIGSOFT FSE, pages 27-36. ACM, 2010.
24. K. Honda, N. Yoshida, and M. Carbone. Multiparty asynchronous session types. In POPL, pages 273-284. ACM, 2008.
25. J. Lange and E. Tuosto. Synthesising Choreographies from Local Session Types. In CONCUR, volume 7454 of LNCS, pages 225-239. Springer, 2012.
26. R. Lanotte, A. Maggiolo-Schettini, and A. Troina. Weak bisimulation for probabilistic timed automata. Theor. Comput. Sci., 411(50):4291- 4322, 2010.
27. S. McIlvenna, M. Dumas, and M. T. Wynn. Synthesis of orchestrators from service choreographies. In APCCM, volume 96 of CRPIT, pages 129-138. ACS, 2009.
28. D. Mostrous, N. Yoshida, and K. Honda. Global principal typing in partially commutative asynchronous sessions. In ESOP, volume 5502 of LNCS, pages 316-332. Springer, 2009.
29. M. Mukund, K. N. Kumar, and M. A. Sohoni. Synthesizing distributed finite-state systems from MSCs. In CONCUR, volume 1877 of LNCS, pages 521-535. Springer, 2000.
30. A. Muscholl. Analysis of communicating automata. In LATA, volume 6031 of LNCS, pages 50-57. Springer, 2010.
31. G. Salaün, L. Bordeaux, and M. Schaerf. Describing and reasoning on web services using process algebra. In ICWS, pages 43. IEEE Computer Society, 2004.
32. Y. Wang, A. Nazeem, and R. Swaminathan. On the optimal Petri net representation for service composition. In ICWS, pages 235-242. IEEE Computer Society, 2011.
33. D. M. Yellin and R. E. Strom. Protocol specifications and component adaptors. ACM Trans. Program. Lang. Syst., 19(2):292-333, 1997.