Mixing Lossy and Perfect Fifo Channels

Abstract. We consider asynchronous networks of finite-state systems communicating via a combination of reliable and lossy fifo channels. Depending on the topology, the reachability problem for such networks may be decidable. We provide a complete classification of network topologies according to whether they lead to a decidable reachability problem. Furthermore, this classification can be decided in polynomial-time.

• Type: Conference
• Year: 2008
• Where: CONCUR
• Authors: Pierre Chambart, Ph. Schnoebelen
• Keywords: CONCUR 2008, Decidable Reachability Problem, Distributed And Parallel Computing, Lossy Fifo Channels, Reachability Problem