Rapport (Rapport De Recherche) Année : 2019

On the k-synchronizability for mailbox systems

Cinzia Di Giusto
Laetitia Laversa
Etienne Lozes

Résumé

Asynchronous bounded or unbounded message passing is ubiquitous in communication-centric systems. When modelling distributed scenarios, it is important to understand whether buffers are bounded or not. In this paper, we work on the notion of k-synchronizability: a system is k-synchronizable if any of its executions, up to reordering causally independent actions, can be divided into a succession of k-bounded interaction phases. We show two results: first, the reachability problem is decidable for k-synchronizable systems; second, the membership problem (whether a given system is k-synchronizable) is decidable as well. Our proofs fix several important issues in previous attempts to prove these two results.

Fichier principal
Vignette du fichier
main.pdf (352.88 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence
Loading...

Dates et versions

hal-02272347 , version 1 (27-08-2019)
hal-02272347 , version 2 (21-01-2020)

Licence

Identifiants

Citer

Cinzia Di Giusto, Laetitia Laversa, Etienne Lozes. On the k-synchronizability for mailbox systems. [Research Report] Laboratoire I3S. 2019. ⟨hal-02272347v1⟩
261 Consultations
339 Téléchargements

Altmetric

Partager

  • More