On the k-synchronizability of 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 : 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 (both for mailbox and peer-to-peer automata): 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 for mailbox automata.
Complete list of metadatas

Contributor : Cinzia Di Giusto <>
Submitted on : Tuesday, January 21, 2020 - 10:09:23 AM
Last modification on : Wednesday, January 22, 2020 - 1:45:38 AM


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



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



Record views


Files downloads