Abstract
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.
Cite
CITATION STYLE
APA
Masson, B., & Schnoebelen, P. (2002). On verifying fair lossy channel systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2420, pp. 543–555). Springer Verlag. https://doi.org/10.1007/3-540-45687-2_45
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free