Skip to Main content Skip to Navigation
Reports

On the k-synchronizability of systems

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.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-02272347
Contributor : Cinzia Di Giusto <>
Submitted on : Tuesday, January 21, 2020 - 10:09:23 AM
Last modification on : Monday, October 12, 2020 - 10:30:41 AM

Identifiers

  • HAL Id : hal-02272347, version 2
  • ARXIV : 1909.01627

Collections

Citation

Cinzia Di Giusto, Laetitia Laversa, Etienne Lozes. On the k-synchronizability of systems. [Research Report] Laboratoire I3S. 2019. ⟨hal-02272347v2⟩

Share

Metrics

Record views

103

Files downloads

93