Skip to main content
SpringerLink
Log in

Constraint-Based Analysis of Broadcast Protocols

  • Conference paper
  • First Online:
Computer Science Logic (CSL 1999)

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

Included in the following conference series:

Abstract

Broadcast protocols are systems composed of a finite but arbitrarily large number of processes that communicate by rendezvous (two processes exchange a message) or by broadcast (a process sends a message to all other processes). The paper describes an optimized algorithm for the automatic verification of safety properties in broadcast protocols. The algorithm checks whether a property holds for any number of processes.

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. J. Esparza, A. Finkel, and R. Mayr. On the Verification of Broadcast Protocols. In Proc. 14th IEEE Int. Symp. on Logic in Computer Science, 1998.

    Google Scholar 

  2. A. Finkel and Ph. Schnoebelen. Well-structured transition systems everywhere! Technical Report LSV-98-4, Laboratoire Spécification et Vérification, Ecole Normale Supérieure de Cachan. April 1998. To appear in Theoretical Computer Science, 1999.

    Google Scholar 

  3. M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, 1978.

    Google Scholar 

  4. T. A. Henzinger, P.-H. Ho, and H. Wong-Toi. HyTech:a Model Checker for Hybrid Systems. In Orna Grumberg, editor, Proc. 9th Conf. on Computer Aided Verification (CAV’97), LNCS 1254, pp. 460–463. Springer-Verlag, 1997.

    Chapter  Google Scholar 

  5. M. Kindahl. Verification of Infinite State Systems: Decision Problems and Efficient Algorithms. Ph.D. thesis, Department of Computer Systems, Uppsala University, June 1999. Available as report DoCS 110.

    Google Scholar 

  6. R. M. Karp and R. E. Miller. Parallel Program Schemata. Journal of Computer and System Sciences, 3, pp. 147–195, 1969.

    Article  MathSciNet  Google Scholar 

  7. K. McAloon. Petri Nets and Large Finite Sets. Theoretical Computer Science 32, pp. 173–183, 1984.

    Article  MathSciNet  Google Scholar 

  8. D. Srivistava. Subsumption and indexing in constraint query languages with linear arithmetic constraints. In 2nd Int. Symp. on Artificial Intelligence and Mathematics, Fort Lauderdale, 1992.

    Google Scholar 

  9. E. Teruel. Structure Theory ofWeighte d Place/Transition Net Systems: The Equal Conflict Hiatus. Ph.D. Thesis, University of Zaragoza, 1994.

    Google Scholar 

  10. M. Y. Vardi and P. Wolper. Automata-Theoretic Techniques for Modal Logics of Programs. Journal ofComputer and System Sciences. 32(2), pp. 183–221, April, 1986.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Giorgio Delzanno & Andreas Podelski

  2. Technische Universität Munchen, Arcisstr. 21, 80290, München, Germany

    Javier Esparza

Authors
  1. Giorgio Delzanno
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andreas Podelski
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Javier Esparza
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Mathematisches Institut, Universität Freiburg, Eckerstr. 1, D-79104, Freiburg, Germany

    Jörg Flum

  2. Dpto. de Sistemas Informáticos y Programación Edificio Fac. Matemáticas, Universidad Complutense de Madrid, Av. Complutense s/n, E-28040, Madrid, Spain

    Mario Rodriguez-Artalejo

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Delzanno, G., Podelski, A., Esparza, J. (1999). Constraint-Based Analysis of Broadcast Protocols. In: Flum, J., Rodriguez-Artalejo, M. (eds) Computer Science Logic. CSL 1999. Lecture Notes in Computer Science, vol 1683. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48168-0_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-48168-0_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-48168-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation