Globally governed session semantics

Kouzapas, D. and Yoshida, N. (2014) Globally governed session semantics. Logical Methods in Computer Science, 10(4), pp. 1-45. 20. (doi: 10.2168/LMCS-10(4:20)2014)

Abstract

This paper proposes a bisimulation theory based on multiparty session types where a choreography specification governs the behaviour of session typed processes and their observer. The bisimulation is defined with the observer cooperating with the observed process in order to form complete global session scenarios and usable for proving correctness of optimisations for globally coordinating threads and processes. The induced bisimulation is strictly more fine-grained than the standard session bisimulation. The difference between the governed and standard bisimulations only appears when more than two interleaved multiparty sessions exist. This distinct feature enables to reason real scenarios in the large-scale distributed system where multiple choreographic sessions need to be interleaved. The compositionality of the governed bisimilarity is proved through the soundness and completeness with respect to the governed reduction-based congruence. Finally, its usage is demonstrated by a thread transformation governed under multiple sessions in a real usecase in the large-scale cyberinfrustracture.

• Item Type: Articles
• Status: Published
• Refereed: Yes
• Glasgow Author(s) Enlighten ID: Kouzapas, Mr Dimitrios
• Authors: Kouzapas, D., and Yoshida, N.
• Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
• College/School: College of Science and Engineering > School of Computing Science
• Journal Name: Logical Methods in Computer Science
• Journal Abbr.: LMCS
• Publisher: International Federation of Computational Logic
• ISSN: 1860-5974
• Copyright Holders: Copyright © 2014 The Authors
• First Published: First published in Logical Methods in Computer Science 10(4):20
• Publisher Policy: Reproduced under a Creative Commons License