Guessing the Buffer Bound for k-Synchronizability
| Autor: | Cinzia Di Giusto, Laetitia Laversa, Etienne Lozes |
|---|---|
| Přispěvatelé: | 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) |
| Jazyk: | angličtina |
| Rok vydání: | 2021 |
| Předmět: |
[INFO.INFO-SC]Computer Science [cs]/Symbolic Computation [cs.SC]
Sequence Reachability problem 0102 computer and information sciences 02 engineering and technology [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE] 01 natural sciences [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL] Communicating automata Combinatorics [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL] 010201 computation theory & mathematics 020204 information systems 0202 electrical engineering electronic engineering information engineering [INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM] ComputingMilieux_MISCELLANEOUS Mathematics |
| Zdroj: | 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 |
| DOI: | 10.1007/978-3-030-79121-6_9⟩ |
| Popis: | 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 that it is possible to decide if such a bound k exists. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|