Safe Composition of Systems of Communicating Finite State Machines

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Barbanera, Franco, Hennicker, Rolf
Format: Preprint
Veröffentlicht: 2024
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866929624669224960
author Barbanera, Franco
Hennicker, Rolf
author_facet Barbanera, Franco
Hennicker, Rolf
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2412_08234
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Safe Composition of Systems of Communicating Finite State Machines
Barbanera, Franco
Hennicker, Rolf
Logic in Computer Science
F.3.1
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.
title Safe Composition of Systems of Communicating Finite State Machines
topic Logic in Computer Science
F.3.1
url https://arxiv.org/abs/2412.08234