Mixing Lossy and Perfect Fifo Channels
CONCUR 2008 - CONCURRENCY THEORY, PROCEEDINGS(2008)
摘要
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.
更多查看译文
关键词
complete classification,mixing lossy,asynchronous network,perfect fifo channels,reachability problem,lossy fifo channel,finite-state system,decidable reachability problem,network topology,polynomial time
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要