Decidable Topologies for Communicating Automata with FIFO and Bag Channels
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.
Unable to display preview. Download preview PDF.
- 11.Heußner, A., Leroux, J., Muscholl, A., Sutre, G.: Reachability analysis of communicating pushdown systems. LMCS 8(3), 1–20 (2012)Google Scholar
- 13.Kosaraju, S.R.: Decidability of reachability in vector addition systems. In: Proc. STOC 1982, pp. 267–281 (1982) (preliminary version)Google Scholar
- 16.Mayr, E.: An algorithm for the general petri net reachability problem. In: Proc. STOC 1981, pp. 238–246 (1981)Google Scholar
- 17.Milner, R.: Communication and Concurrency. Prentice-Hall (1989)Google Scholar
- 18.Pachl, J.K.: Reachability problems for communicating finite state machines. Research Report CS-82-12, University of Waterloo (May 1982)Google Scholar
- 20.West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice-Hall (2001)Google Scholar