On the k-synchronizability of Systems

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 d...

Descripción completa

Detalles Bibliográficos
Autores principales: Di Giusto, Cinzia, Laversa, Laetitia, Lozes, Etienne
Formato: Online Artículo Texto
Lenguaje:English
Publicado: 2020
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7788629/
http://dx.doi.org/10.1007/978-3-030-45231-5_9