On Composing Communicating Systems

DOI10.4204/EPTCS.365.4MaRDI QIDQ6122641zbMATH OpenFDO

Authors Franco Barbanera, Ivan Lanese, Emilio Tuosto

Publication date 1 March 2024

Published in Electronic Proceedings in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2208.04634

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Abstract: Communication is an essential element of modern software, yet programming and analysing communicating systems are difficult tasks. A reason for this difficulty is the lack of compositional mechanisms that preserve relevant communication properties. This problem has been recently addressed for the well-known model of communicating systems, that is sets of components consisting of finite-state machines capable of exchanging messages. The main idea of this approach is to take two systems, select a participant from each of them, and derive from those participants a pair of coupled gateways connecting the two systems. More precisely, a message directed to one of the gateways is forwarded to the gateway in the other system, which sends it to the other system. It has been shown that, under some suitable compatibility conditions between gateways, this composition mechanism preserves deadlock freedom for asynchronous as well as symmetric synchronous communications (where sender and receiver play the same part in determining which message to exchange). This paper considers the case of asymmetric synchronous communications where senders decide independently which message should be exchanged. We show here that preservation of lock freedom requires sequentiality of gateways, while this is not needed for preservation of either deadlock freedom or strong lock freedom.

Cites work

• A calculus of communicating systems
• A semantic deconstruction of session types
• Composition and decomposition of multiparty sessions
• Connecting open systems of communicating finite state machines
• Contract-based discovery of Web services modulo simple orchestrators
• From communicating machines to graphical choreographies
• On Communicating Finite-State Machines
• Programming languages with applications to biology and security. Essays dedicated to Pierpaolo Degano on the occasion of his 65th birthday
• Sub-behaviour relations for session-based client/server systems
• Synthesis of orchestrations and choreographies: bridging the gap between supervisory control and coordination of services
• Verification of programs with half-duplex communication

Cited in

(4)

• Research Challenges in Orchestration Synthesis
• Advancing orchestration synthesis for contract automata
• Safe composition of systems of communicating finite state machines
• Safe orchestrated multicomposition of systems of communicating finite state machines

This page was built for publication: On Composing Communicating Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6122641)