2000 character limit reached
On the k-synchronizability of systems (1909.01627v2)
Published 4 Sep 2019 in cs.FL, cs.CL, cs.SC, and cs.SE
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.