2019/09/04 by Di Giusto, Cinzia, Giusto, Cinzia, Laversa, Laetitia +1 · 1 citation
#Computation and Language (cs.CL) #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Software Engineering (cs.SE) #Symbolic Computation (cs.SC)
paper · doi:10.48550/arxiv.1909.01627
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.