On the k-synchronizability of systems

Cinzia Di Giusto (1) , Laetitia Laversa (1) , Etienne Lozes (2)

1 C&A - Constraints and Applications
2 I3S - Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis

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.

Domaines: Théorie et langage formel [cs.FL]; Informatique et langage [cs.CL]; Génie logiciel [cs.SE]; Calcul formel [cs.SC]

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