On the k-synchronizability for mailbox systems

Cinzia Di Giusto 1 Laetitia Laversa 1 Etienne Lozes 2
1 C&A - Constraints and Applications
Laboratoire I3S - MDSC - Modèles Discrets pour les Systèmes Complexes
Abstract : 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.
Complete list of metadatas

Cited literature [15 references]  Display  Hide  Download

Contributor : Cinzia Di Giusto <>
Submitted on : Tuesday, August 27, 2019 - 4:34:43 PM
Last modification on : Thursday, September 5, 2019 - 1:19:32 AM


Files produced by the author(s)


  • HAL Id : hal-02272347, version 1
  • ARXIV : 1909.01627



Cinzia Di Giusto, Laetitia Laversa, Etienne Lozes. On the k-synchronizability for mailbox systems. [Research Report] Laboratoire I3S. 2019. ⟨hal-02272347⟩



Record views


Files downloads