Safe Composition of Systems of Communicating Finite State Machines

The Participants-as-Interfaces (PaI) approach to system composition suggests that participants of a system may be viewed as interfaces.Given a set of systems, one participant per system is chosen to play the role of an interface.When systems are composed, the interface participants are replaced by gateways which communicate to each other by forwarding messages.The PaI-approach for systems of asynchronous communicating finite state machines (CFSMs) has been exploited in the literature for binary composition only, with a (necessarily) unique forwarding policy.In this paper we consider the case of multiple system composition when forwarding gateways are not uniquely determined and their interactions depend on specific connection policies complying with a connection model.We represent connection policies as CFSM systems and prove that a bunch of relevant communication properties (deadlock-freeness, reception-error-freeness, etc.) are preserved by PaI multicomposition, with the proviso that also the used connection policy does enjoy the communication property taken into account.

Authors

Institutions

Publication Details

Journal
Electronic Proceedings in Theoretical Computer Science
Published
2024-12-10
DOI
https://doi.org/10.4204/eptcs.414.3
Primary Topic
Formal Methods in Verification
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Safe Composition of Systems of Communicating Finite State Machines

Franco Barbanera, Rolf Hennicker
Electronic Proceedings in Theoretical Computer Science
Formal Methods in Verification
article

Safe Composition of Systems of Communicating Finite State Machines

Franco Barbanera, Rolf Hennicker
article en

Abstract

The Participants-as-Interfaces (PaI) approach to system composition suggests that participants of a system may be viewed as interfaces.Given a set of systems, one participant per system is chosen to play the role of an interface.When systems are composed, the interface participants are replaced by gateways which communicate to each other by forwarding messages.The PaI-approach for systems of asynchronous communicating finite state machines (CFSMs) has been exploited in the literature for binary composition only, with a (necessarily) unique forwarding policy.In this paper we consider the case of multiple system composition when forwarding gateways are not uniquely determined and their interactions depend on specific connection policies complying with a connection model.We represent connection policies as CFSM systems and prove that a bunch of relevant communication properties (deadlock-freeness, reception-error-freeness, etc.) are preserved by PaI multicomposition, with the proviso that also the used connection policy does enjoy the communication property taken into account.

Electronic Proceedings in Theoretical Computer ScienceVol. 414
LMU Klinikum (DE), University of Catania (IT), Istituto di Matematica Applicata e Tecnologie Informatiche (IT), Ludwig-Maximilians-Universität München (DE)
Openalex Percentile: Top 73%
Formal Methods in Verification
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.