Constraint-based analysis of broadcast protocols

Giorgio Delzanno, Javier Esparza, Andreas Podelski

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

34 Scopus citations

Abstract

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

Original languageEnglish
Title of host publicationComputer Science Logic - 13th International Workshop, CSL 1999 - 8th Annual Conference of the EACSL, Proceedings
EditorsJörg Flum, Mario Rodriguez-Artalejo
PublisherSpringer Verlag
Pages50-66
Number of pages17
ISBN (Print)3540665366, 9783540665366
DOIs
StatePublished - 1999
Event13th International Workshop on Computer Science Logic, CSL 1999 and held as International Workshops on Computer Science Logic, EACSL 1999 - Madrid, Spain
Duration: 20 Sep 199925 Sep 1999

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1683
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference13th International Workshop on Computer Science Logic, CSL 1999 and held as International Workshops on Computer Science Logic, EACSL 1999
Country/TerritorySpain
CityMadrid
Period20/09/9925/09/99

Fingerprint

Dive into the research topics of 'Constraint-based analysis of broadcast protocols'. Together they form a unique fingerprint.

Cite this