Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Laetitia Laversa"'
Publikováno v:
International Journal of Foundations of Computer Science. :1-26
A communicating system is $k$-synchronizable if all of the message sequence charts representing the executions can be divided into slices of $k$ sends followed by $k$ receptions. It was previously shown that, for a fixed given $k$, one could decide w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::23316b0415f6d9802b3e811c334b0f35
https://doi.org/10.1142/s0129054122430018
https://doi.org/10.1142/s0129054122430018
There is a wide variety of message-passing communication models, ranging from synchronous "rendez-vous" communications to fully asynchronous/out-of-order communications. For large-scale distributed systems, the communication model is determined by th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7dee3e53fecebc3d4817101254ad741c
http://arxiv.org/abs/2210.13062
http://arxiv.org/abs/2210.13062
Publikováno v:
Implementation and Application of Automata
Implementation and Application of Automata, 12803, Springer International Publishing, pp.102-114, 2021, Lecture Notes in Computer Science, ⟨10.1007/978-3-030-79121-6_9⟩
Implementation and Application of Automata ISBN: 9783030791209
CIAA
Implementation and Application of Automata, 12803, Springer International Publishing, pp.102-114, 2021, Lecture Notes in Computer Science, ⟨10.1007/978-3-030-79121-6_9⟩
Implementation and Application of Automata ISBN: 9783030791209
CIAA
A communicating system is \(k\)-synchronizable if all of the message sequence charts representing the executions can be divided into slices of k sends followed by k receptions. It was previously shown that, for a fixed given k, one could decide wheth
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4af470189e0ef947c992bdfad3e2323a
https://hal.archives-ouvertes.fr/hal-03508219
https://hal.archives-ouvertes.fr/hal-03508219