论文信息 - On Verifying Fair Lossy Channel Systems

On Verifying Fair Lossy Channel Systems

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.

Philippe Schnoebelen | Benoît Masson

[1] Parosh Aziz Abdulla,et al. On-the-Fly Analysis of Systems with Unbounded, Lossy FIFO Channels , 1998, CAV.

[2] Parosh Aziz Abdulla,et al. Undecidable Verification Problems for Programs with Unreliable Channels , 1994, Inf. Comput..

[3] Lutz Priese,et al. Fairness , 1988, Bull. EATCS.

[4] Parosh Aziz Abdulla,et al. Symbolic Verification of Lossy Channel Systems: Application to the Bounded Retransmission Protocol , 1999, TACAS.

[5] Philippe Schnoebelen,et al. Verifying lossy channel systems has nonprimitive recursive complexity , 2002, Inf. Process. Lett..

[6] Parosh Aziz Abdulla,et al. Verifying programs with unreliable channels , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[7] Alain Finkel,et al. Unreliable Channels are Easier to Verify Than Perfect Channels , 1996, Inf. Comput..

[8] Daniel Brand,et al. On Communicating Finite-State Machines , 1983, JACM.

[9] Parosh Aziz Abdulla,et al. Decidability of Simulation and Bisimulation between Lossy Channel Systems and Finite State Systems (Extended Abstract) , 1995, CONCUR.

[10] Philippe Schnoebelen. Bisimulation and Other Undecidable Equivalences for Lossy Channel Systems , 2001, TACS.

[11] Richard Mayr. Undecidable problems in unreliable computations , 2003, Theor. Comput. Sci..