Search

Your search keyword '"Laversa, Laetitia"' showing total 4 results
Start Over Author "Laversa, Laetitia" Topic communicating automata
4 results on '"Laversa, Laetitia"'

1. Guessing the Buffer Bound for k-Synchronizability

Author

Di Giusto, Cinzia, Laversa, Laetitia, Lozes, Etienne, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, and Maneth, Sebastian, editor

Published
2021
Full Text
View/download PDF

2. On the k-synchronizability of Systems

Author

Di Giusto, Cinzia, Laversa, Laetitia, Lozes, Etienne, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Goubault-Larrecq, Jean, editor, and König, Barbara, editor

Published
2020
Full Text
View/download PDF

3. Guessing the Buffer Bound for k-Synchronizability.

Author

Di Giusto, Cinzia, Laversa, Laetitia, and Lozes, Etienne

Subjects
*MAILBOXES
Abstract

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 whether a communicating system is k -synchronizable. This result is interesting because the reachability problem can be solved for k -synchronizable systems. However, the decision procedure assumes that the bound k is fixed. In this paper we improve this result and show, for mailbox communication, that it is possible to decide if such a bound k exists. [ABSTRACT FROM AUTHOR]

Published
2023
Full Text
View/download PDF

4. On the k-synchronizability of systems

Author

Di Giusto, Cinzia, Laversa, Laetitia, Lozes, Etienne, Constraints and Applications (C&A), Modèles Discrets pour les Systèmes Complexes (Laboratoire I3S - MDSC), Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), Laboratoire I3S, Jean Goubault-Larrecq, and Barbara König

Subjects
[INFO.INFO-SC]Computer Science [cs]/Symbolic Computation [cs.SC], Theoretical computer science, Membership problem, Reachability problem, Computer science, Verification, 0102 computer and information sciences, 02 engineering and technology, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], Mathematical proof, 01 natural sciences, Article, [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL], Automaton, Communicating automata, Decidability, [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL], 010201 computation theory & mathematics, Communicating Automata, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, A/Synchronous communication
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.

Published
2019

Catalog

Books, media, physical & digital resources
See catalog results