In: Doron A. Peled, Yih-Kuen Tsay (Eds.): Lecture Notes in Computer Science, 3707: Automated Technology for Verification and Analysis: Third International Symposium, ATVA 2005, Taipei, Taiwan, October 4-7, 2005., pages 457-473. Springer-Verlag, October 2005. URL: http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/1156294834,.
Abstract: The Stop-and-Wait protocol (SWP) has two (unbounded) parameters: the maximum sequence number (MaxSeqNo) and the maximum number of retransmissions (MaxRetrans). Our aim is to verify this protocol for all possible values of these parameters. Model checking such a system requires considering an infinite family of state spaces (reachability graphs). We firstly show that the size of these state spaces is linear in MaxSeqNo and quartic in MaxRetrans. This leads us to develop a symbolic representation for the reachability graphs which can be viewed as a symbolic Finite State Automaton (FSA). We apply automata reduction techniques directly to the symbolic FSA to obtain a language equivalent FSA representing the sequences of externally visible events. This FSA is independent of the parameters. We confirm that this is language equivalent to the Stop-and-Wait service of alternating send and receive events. The results are significant as we have: 1. a novel algebraic representation of the infinite set of reachability graphs and their related FSAs of our SWP model; and 2. verified conformance of the SWP to its service, for all values of the unbounded MaxSeqNo parameter.
Keywords: Stop and Wait Protocols, Symbolic Reachability Graphs, Symbolic Automata, Coloured Petri Nets, Language Equivalence, Parametric Verification.
Back to the Petri Nets Bibliography