On the k-synchronizability of Systems

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

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

We study 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.

Mots clés: A/Synchronous communication; Verification; Communicating Automata

Domaines: Théorie et langage formel [cs.FL]

Cinzia Di Giusto, Laetitia Laversa, Etienne Lozes. On the k-synchronizability of Systems. 23rd International Conference on Foundations of Software Science and Computer Systems (FOSSACS 2020), Apr 2020, Dublin, Ireland. pp.157-176, ⟨10.1007/978-3-030-45231-5_9⟩. ⟨hal-02883586⟩