On the k-synchronizability of Systems
Résumé
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.
Fichier principal
Giusto2020_Chapter_OnTheK-synchronizabilityOfSyst.pdf (4.8 Mo)
Télécharger le fichier
Origine | Publication financée par une institution |
---|
Loading...