Invisible Safety of Distributed Protocols

  • Ittai Balaban
  • Amir Pnueli
  • Lenore D. Zuck
Conference paper

DOI: 10.1007/11787006_45

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4052)
Cite this paper as:
Balaban I., Pnueli A., Zuck L.D. (2006) Invisible Safety of Distributed Protocols. In: Bugliesi M., Preneel B., Sassone V., Wegener I. (eds) Automata, Languages and Programming. ICALP 2006. Lecture Notes in Computer Science, vol 4052. Springer, Berlin, Heidelberg

Abstract

The method of “Invisible Invariants” has been applied successfully to protocols that assume a “symmetric” underlying topology, be it cliques, stars, or rings. In this paper we show how the method can be applied to proving safety properties of distributed protocols running under arbitrary topologies. Many safety properties of such protocols have reachability predicates, which, at first glance, are beyond the scope of the Invisible Invariants method. To overcome this difficulty, we present a technique, called “coloring,” that allows, in many instances, to replace the second order reachability predicates by first order predicates, resulting in properties that are amenable to Invisible Invariants.We demonstrate our techniques on several distributed protocols, including a variant on Luby’s Maximal Independent Set protocol, the Leader Election protocol used in the IEEE 1394 (Firewire) distributed bus protocol, and various distributed spanning tree algorithms. All examples have been tested using the symbolic model checker tlv.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Ittai Balaban
    • 1
  • Amir Pnueli
    • 1
  • Lenore D. Zuck
    • 2
  1. 1.New York UniversityNew York
  2. 2.University of Illinois at Chicago 

Personalised recommendations