Decidable Topologies for Communicating Automata with FIFO and Bag Channels

Abstract : We study the reachability problem for networks of finite-state automata communicating over unbounded perfect channels. We consider communication topologies comprising both ordinary FIFO channels and bag channels, i.e., channels where messages can be freely reordered. It is well-known that when only FIFO channels are considered, the reachability problem is decidable if, and only if, there is no undirected cycle in the topology. On the other side, when only bag channels are allowed, the reachability problem is decidable for any topology by a simple reduction to Petri nets. In this paper, we study the more complex case where the topology contains both FIFO and bag channels, and we provide a complete characterisation of the decidable topologies in this generalised setting.
Type de document :
Communication dans un congrès
CONCUR 2014 - 25th International Conference on Concurrency Theory, Sep 2014, Rome, Italy. Springer, 8704, pp.281-296, 2014, LNCS. <10.1007/978-3-662-44584-6_20>
Liste complète des métadonnées


https://hal.archives-ouvertes.fr/hal-01023456
Contributeur : Grégoire Sutre <>
Soumis le : dimanche 13 juillet 2014 - 02:23:30
Dernière modification le : lundi 2 février 2015 - 00:16:09
Document(s) archivé(s) le : lundi 13 octobre 2014 - 10:36:13

Fichier

CfsmFifoBag.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Lorenzo Clemente, Frédéric Herbreteau, Grégoire Sutre. Decidable Topologies for Communicating Automata with FIFO and Bag Channels. CONCUR 2014 - 25th International Conference on Concurrency Theory, Sep 2014, Rome, Italy. Springer, 8704, pp.281-296, 2014, LNCS. <10.1007/978-3-662-44584-6_20>. <hal-01023456>

Partager

Métriques

Consultations de
la notice

309

Téléchargements du document

156