Decidable Topologies for Communicating Automata with FIFO and Bag Channels - Archive ouverte HAL Access content directly
Conference Papers Year : 2014

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.
Fichier principal
Vignette du fichier
CfsmFifoBag.pdf (413.34 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01023456 , version 1 (13-07-2014)

Identifiers

Cite

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. pp.281-296, ⟨10.1007/978-3-662-44584-6_20⟩. ⟨hal-01023456⟩

Collections

CNRS
249 View
353 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More