Skip to Main content Skip to Navigation
Conference papers

On the k-synchronizability of Systems

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [17 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02883586
Contributor : Etienne Lozes <>
Submitted on : Monday, June 29, 2020 - 11:36:28 AM
Last modification on : Monday, October 12, 2020 - 10:30:41 AM

File

Giusto2020_Chapter_OnTheK-sync...
Publication funded by an institution

Identifiers

Collections

Citation

Cinzia Di Giusto, Laetitia Laversa, Etienne Lozes. On the k-synchronizability of Systems. 23rd International Conference on Foundations of Software Science and Computer Systems (FOSSACS 2020), Apr 2020, Dublin, Ireland. pp.157-176, ⟨10.1007/978-3-030-45231-5_9⟩. ⟨hal-02883586⟩

Share

Metrics

Record views

27

Files downloads

49