On the k-synchronizability of systems
Formal Languages and Automata Theory
2020-01-22 v2 Computation and Language
Symbolic Computation
Software Engineering
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.
Keywords
Cite
@article{arxiv.1909.01627,
title = {On the k-synchronizability of systems},
author = {Cinzia Di Giusto and Cinzia Giusto and Laetitia Laversa and Etienne Lozes},
journal= {arXiv preprint arXiv:1909.01627},
year = {2020}
}