Note: This is an archvied version of our old webpage. Some links might be broken. The current one can be found here.
I7 Logo
Chair for Foundations of Software Reliability and Theoretical Computer Science
Informatik Logo TUM Logo
Publications - Constraint-based Analysis of Broadcast Protocols

Reference:

G. Delzanno, J. Esparza, and A. Podelski. Constraint-based analysis of broadcast protocols. In Proceedings of CSL '99, number 1683 in Lecture Notes in Computer Science, pages 50–66, 1999.

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.

Suggested BibTeX entry:

@inproceedings{DEP99,
    author = {G. Delzanno and J. Esparza and A. Podelski},
    booktitle = {Proceedings of CSL '99},
    number = {1683},
    pages = {50--66},
    series = {Lecture Notes in Computer Science},
    title = {Constraint-based Analysis of Broadcast Protocols},
    year = {1999}
}

GZipped PostScript (98 kB)
PDF (271 kB)