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.
Highlights
Context Choreographies, models of interactions among software components from a global point of view, have been advocated as a conceptual and practical tool to tackle the complexity of designing, analysing, and implementing modern applications
The work [6] studies whether Message Sequence Charts (MSC) imply unspecified scenarios
generalised multiparty compatibility (GMC) systems form a new class of communicating systems, and we have proved that any system in this class is safe and there exist efficient algorithms to check GMC
Summary
Context Choreographies, models of interactions among software components from a global point of view, have been advocated as a conceptual and practical tool to tackle the complexity of designing, analysing, and implementing modern applications (see e.g., [4, 11, 17, 26]). The ’conform direction’ of testable architectures [4] lacks algorithms to obtain global models when modifying local projections To address this limitation we propose an algorithm to construct choreographies from a set of behavioural specifications of components interacting through asynchronous message passing. Distributed service architectures envisage software as a provision made available (through a public interface that hides implementation details) to be dynamically searched by and composed The choreography of such systems cannot be designed in advance and has to be established and checked at binding-time to attain automatic composition. CFSMs are a conceptually simple model, based on asynchronous FIFO messagepassing communication, and are well-established for analysing properties of distributed systems They are widely used in industry tools and can be seen as end-point specifications. If B wins (that is the message bwin is on top of the queue AB and B consumes it by taking the transition AB?bwin), he
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
