On the k-synchronizability of systems
This addresses formal verification challenges for concurrent systems, but it appears incremental as it builds on and corrects previous work.
The paper tackles the problem of k-synchronizability in systems, showing that for mailbox and peer-to-peer automata, the reachability and membership problems are decidable, with proofs that fix issues in prior attempts.
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.