On Verifying Fair Lossy Channel Systems
On Verifying Fair Lossy Channel Systems
复制标题
关于验证公平有损通道系统
DOI:
--
复制
发表时间:
2002
期刊:
影响因子:
--
通讯作者:
P. Schnoebelen
中科院分区:
文献类型:
--
作者:
Benoît Masson;P. Schnoebelen
Lossy channel systems are systems of finite state automata that communicate via unreliable unbounded fifo channels. They are an important computational model because of the role they play in the algorithmic verification of communication protocols.In this paper, we show that fair termination is decidable for a large class of these systems.