Skip to main content
SpringerLink
Log in

On Verifying Fair Lossy Channel Systems

  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 2002 (MFCS 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2420))

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.

The research described in this paper was conducted while B. Masson was at LSV.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P. A. Abdulla, A. Annichini, and A. Bouajjani. Symbolic verification of lossy channel systems: Application to the bounded retransmission protocol. In Proc. 5th Int. Conf. Tools and Algorithms for the Construction and Analysis of Systems (TACAS’99), LNCS 1579, pages 208–222. Springer, 1999.

    Chapter  Google Scholar 

  2. P. A. Abdulla, A. Bouajjani, and B. Jonsson. On-the-fly analysis of systems with unbounded, lossy FIFO channels. In Proc. 10th Int. Conf. Computer Aided Verification (CAV’98), LNCS 1427, pages 305–318. Springer, 1998.

    Chapter  Google Scholar 

  3. P. A. Abdulla and B. Jonsson. Undecidable verification problems for programs with unreliable channels. Information and Computation, 130(1):71–90, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  4. P. A. Abdulla and B. Jonsson. Verifying programs with unreliable channels. Information and Computation, 127(2):91–101, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  5. P. A. Abdulla and M. Kindahl. Decidability of simulation and bisimulation between lossy channel systems and finite state systems. In Proc. 6th Int. Conf. Theory of Concurrency (CONCUR’95), LNCS 962, pages 333–347. Springer, 1995.

    Google Scholar 

  6. D. Brand and P. Zafiropulo. On communicating finite-state machines. Research Report RZ 1053, IBM Zurich Research Lab., June 1981. A short version appears in J.ACM 30(2):323–342, 1983.

    Google Scholar 

  7. G. Cécé, A. Finkel, and S. Purushothaman Iyer. Unreliable channels are easier to verify than perfect channels. Information and Computation, 124(1):20–31, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  8. A. Finkel. Decidability of the termination problem for completely specificied protocols. Distributed Computing, 7(3):129–135, 1994.

    Article  Google Scholar 

  9. N. Francez. Fairness. Springer, 1986.

    Google Scholar 

  10. R. Mayr. Undecidable problems in unreliable computations. In Proc. 4th Latin American Symposium on Theoretical Informatics (LATIN’2000), LNCS 1776, pages 377–386. Springer, 2000.

    Google Scholar 

  11. Ph. Schnoebelen. Bisimulation and other undecidable equivalences for lossy channel systems. In Proc. 4th Int. Symp. Theoretical Aspects of Computer Software (TACS’2001), LNCS 2215, pages 385–399. Springer, 2001.

    Chapter  Google Scholar 

  12. Ph. Schnoebelen. Verifying lossy channel systems has nonprimitive recursive complexity. Information Processing Letters, 2002. To appear. Available at http://www.lsv.ens-cachan.fr/~phs.

Download references

Author information

Authors and Affiliations

  1. Lab. Spécification & Vérification, ENS de Cachan & CNRS UMR 8643, 61, av. Pdt. Wilson, 94235, Cachan Cedex, France

    Benoît Masson & Ph. Schnoebelen

  2. Dept. Comp. Sci., ENS de Lyon

    Benoît Masson

Authors
  1. Benoît Masson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ph. Schnoebelen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Informatics, Warsaw University, ul. Banacha 2, 02-097, Warszawa, Poland

    Krzysztof Diks  & Wojciech Rytter  & 

  2. Department of Computer Science, Liverpool University, Peach Street, Liverpool, L69 7ZF, UK

    Wojciech Rytter

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Masson, B., Schnoebelen, P. (2002). On Verifying Fair Lossy Channel Systems. In: Diks, K., Rytter, W. (eds) Mathematical Foundations of Computer Science 2002. MFCS 2002. Lecture Notes in Computer Science, vol 2420. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45687-2_45

Download citation

  • DOI: https://doi.org/10.1007/3-540-45687-2_45

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44040-6

  • Online ISBN: 978-3-540-45687-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation