Formal modeling of communication protocols by graph transformation

  • Authors:

  • Zarrin Langari;Richard Trefler

  • Affiliations:

  • David R. Cheriton School of Computer Science, University of Waterloo, Canada;David R. Cheriton School of Computer Science, University of Waterloo, Canada

  • Venue:
  • FM'06 Proceedings of the 14th international conference on Formal Methods
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Formal modeling is a crucial first step in the analysis of safety critical communication protocols such as IP Telephony. These protocols are notoriously resistant to formal modeling due to their sheer size and complexity. We propose using graph transformation, a straight forward, visual approach to do this. In experiments with Distributed Feature Composition (DFC) protocol and its implementation in BoxOs, we find that graph transformation offers several key advantages over naive methods in modeling the dynamic evolution of a reactive communication protocol. The generated model closely follows the way in which communication protocols are typically separated into three levels: the first describing local features or components, the second characterizing interactions among components, and the third showing the evolution of the component set. The graph transformation semantics described here follows this scheme, enabling a clean separation of concerns when describing a protocol. Using DFC semantics one can easily focus on individual telephones, features, and communication structures without reference to components not directly of interest. This separation is a key to being able to deal with even modestly sized communication protocols. Graph transformation is also a powerful formalism, allowing for very expressive and accurate modeling of the systems under study. Finally, the relative ease of using this semantics is demonstrated, and likely avenues for further use are outlined.