On the k-synchronizability of Systems [chapter]

Cinzia Di Giusto, Laetitia Laversa, Etienne Lozes
2020 Lecture Notes in Computer Science  
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.
doi:10.1007/978-3-030-45231-5_9 fatcat:dibv56v3c5fwfmyfv6aaa26clq