Article thumbnail

On verifying fair lossy channel systems

By B. Masson, Ph. Schnoebelen and Lab Spécification

Abstract

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.

Publisher: Springer
Year: 2002
OAI identifier: oai:CiteSeerX.psu:10.1.1.178.9984
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.irisa.fr/distribcom... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.