Skip to main content
SpringerLink
Log in

Model Checking Communication Protocols

  • Conference paper
  • First Online:
SOFSEM 2001: Theory and Practice of Informatics (SOFSEM 2001)

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

Abstract

Brand and Zafiropulo [1] introduced the model of communicating finite-state machines to represent a distributed system connected with FIFO channels. Several different communication protocols can be specified with this simple model. In this paper we address the problem of automatically validating protocols by verifying properties such as well-formedness and absence of deadlock. Our method is based on a representation of communicating finite-state machines in terms of logic programs. This leads to efficient verification algorithms based on the ground and non-ground semantics of logic programming.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. D. Brand and P. Zafiropulo. On communicating finite-state machines. JACM, 30(2):323–342, April 1983.

    Article  MATH  MathSciNet  Google Scholar 

  2. W. Charatonik and A. Podelski. Set-based analysis of reactive infinite-state systems.InB. Steffen, editor, Proceedings of the First International Conference onTools and Algorithms for the Construction and Analysis of Systems. Springer-Verlag, March–April 1998. To appear.

    Google Scholar 

  3. G. Delzanno and A. Podelski. Model checking infinite-state concurrent systemsin clp. Technical Report MPI-I-98-2-012, Max Planck Institut fuer Informatik, Saarbruecken, July 1998.

    Google Scholar 

  4. M. Falaschi, G. Levi, M. Martelli, and C. Palamidessi. Declarative Modeling of theOperational Behaviour of LogicLanguages. Theoretical Comput. Sci., 69(3):289–318, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  5. L. Fribourg and M. V. Peixoto. Concurrent constraint automata. Technical report, Laboratoire d’Informatique Ecole Nationale Superieure, Paris, May 1993.

    Google Scholar 

  6. G. J. Holzmann. Design and Validation of Computer Protocols. Prentice Hall, November 1991.

    Google Scholar 

  7. Y. S. Ramakrishna, C. R. Ramakrishnan, I. V. Ramakrishnan, S. A. Smolka, T. Swift, and D. S. Warren. Efficient model checking using tabled resolution. InO. Grumberg, editor, Proceedings of the 9th International Conference on ComputerAided Verification (CAV’ 97), LNCS 1254. Springer, Haifa, Israel, July 1997.

    Google Scholar 

  8. H. Rudin, C. H. West, and P. Zafiropulo. Automated protocol validation: Onechain of development. In Proc Computer Network Protocols, pages F4–1–F4–6, February 1978.

    Google Scholar 

  9. C. H. West. General technique for communications protocol validation. IBM Journal of Res. and Dev., 22(4):393–404, July 1978.

    Article  Google Scholar 

  10. C. H. West. Protocol validation in complex systems. In Proceedings of 8th ACMSymposium on Principles of Distributed Computing, pages 303–312, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IRCyN, 1 rue de la Noë, BP 92101, 44321 Nantes (F)

    Pablo Argón

  2. Max-Planck-Institut für Informatik, Im Stadtwald, 66123, Saarbrücken, Germany

    Giorgio Delzanno, Supratik Mukhopadhyay & Andreas Podelski

Authors
  1. Pablo Argón
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Giorgio Delzanno
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Supratik Mukhopadhyay
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Andreas Podelski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Computer Science, University of Wroclaw, Przesmyckiego 20, 51-151, Wroclaw, Poland

    Leszek Pacholski

  2. Fac. of Mathematics, Physics, and Informatics, Inst. of Informatics, Comenius Univ., Mlynská dolina, 84248, Bratislava, Slovakia

    Peter Ružička

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Argón, P., Delzanno, G., Mukhopadhyay, S., Podelski, A. (2001). Model Checking Communication Protocols. In: Pacholski, L., Ružička, P. (eds) SOFSEM 2001: Theory and Practice of Informatics. SOFSEM 2001. Lecture Notes in Computer Science, vol 2234. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45627-9_13

Download citation

  • DOI: https://doi.org/10.1007/3-540-45627-9_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42912-8

  • Online ISBN: 978-3-540-45627-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation