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.
Partially supported by Australian Research Council (ARC) Discovery Grant DP0559927 and Linkage International Grant LX04544639, and the French-Australian Science and Technology programme FR040062.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aziz Abdulla, P., Collomb-Annichini, A., Bouajjani, A., Jonsson, B.: Using Forward Reachability Analysis for Verification of Lossy Channel Systems. Formal Methods in System Design 25(1), 39–65 (2004)
Bardin, S., Finkel, A., Leroux, J.: FASTer Acceleration of Counter Automata in Practice. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol. 2988, pp. 576–590. Springer, Heidelberg (2004)
Barrett, W.A., Couch, J.D.: Compiler Construction: Theory and Practice. Science Research Associates (1979)
Billington, J.: Formal specification of protocols: Protocol Engineering. In: Encyclopedia of Microcomputers, vol. 7, pp. 299–314. Marcel Dekker, New York (1991)
Billington, J., Diaz, M., Rozenberg, G. (eds.): APN 1999. LNCS, vol. 1605. Springer, Heidelberg (1999)
Billington, J., Gallasch, G.E.: How Stop and Wait Protocols Can Fail Over The Internet. In: König, H., Heiner, M., Wolisz, A. (eds.) FORTE 2003. LNCS, vol. 2767, pp. 209–223. Springer, Heidelberg (2003)
Billington, J., Gallasch, G.E.: An Investigation of the Properties of Stop-and-Wait Protocols over Channels which can Re-order messages. Technical Report CSEC-15, Computer Systems Engineering Centre Report Series, University of South Australia (May 2004)
Billington, J., Gallasch, G.E., Han, B.: A Coloured Petri Net Approach to Protocol Verification. In: Desel, J., Reisig, W., Rozenberg, G. (eds.) Lectures on Concurrency and Petri Nets. LNCS, vol. 3098, pp. 210–290. Springer, Heidelberg (2004)
Billington, J., Gallasch, G.E., Petrucci, L.: Transforming Coloured Petri Nets to Counter Systems for Parametric Verification: A Stop-and-Wait Protocol Case Study. In: Proceedings of 2nd International Workshop on Model-Based Methodologies for Pervasive and Embedded Software (MOMPES 2005), Rennes, France, May 2005, vol. 39, pp. 37–55. TUCS General Publication (2005)
FAST - Fast Acceleration of Symbolic Transition systems, http://www.lsv.ens-cachan.fr/fast/ .
FSM Library, AT&T Research Labs, http://www.research.att.com/sw/tools/fsm/
Gallasch, G.E., Billington, J.: Towards the Parametric Verification of the Class of Stop-and-Wait Protocols over Ordered Channels. Technical Report CSEC-21, Computer Systems Engineering Centre Report Series, University of South Australia (March 2005) (revised, June 2005)
Gordon, S.: Verification of the WAP Transaction Layer using Coloured Petri Nets. PhD thesis, Institute for Telecommunications Research and Computer Systems Engineering Centre, School of Electrical and Information Engineering, University of South Australia, Adelaide, Australia (November 2001)
Han, B.: Formal Specification of the TCP Service and Verification of TCP Connection Management. PhD thesis, Computer Systems Engineering Centre, School of Electrical and Information Engineering, University of South Australia, Adelaide, Australia (December 2004)
Jensen, K.: Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use, 2nd edn. Basic Concepts, vol. 1. Springer, Heidelberg (1997)
Jensen, K.: Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use, 2nd edn. Analysis Methods, vol. 2. Springer, Heidelberg (1997)
Jensen, K.: Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use. Practical Use, vol. 3. Springer, Heidelberg (1997)
Kristensen, L.M., Christensen, S., Jensen, K.: The Practitioner’s Guide to Coloured Petri Nets. International Journal on Software Tools for Technology Transfer 2(2), 98–132 (1998)
Liu, L., Billington, J.: Tackling the Infinite State Space of a Multimedia Control Protocol Service Specification. In: Esparza, J., Lakos, C.A. (eds.) ICATPN 2002. LNCS, vol. 2360, pp. 273–293. Springer, Heidelberg (2002)
Ouyang, C.: Formal Specification and Verification of the Internet Open Trading Protocol using Coloured Petri Nets. PhD thesis, Computer Systems Engineering Centre, School of Electrical and Information Engineering, University of South Australia, Adelaide, Australia (June 2004)
Postel, J.: Transmission Control Protocol. RFC 793 (September 1981)
Stallings, W.: Data and Computer Communications, 6th edn. Prentice-Hall, Englewood Cliffs (2000)
Tanenbaum, A.: Computer Networks, 4th edn. Prentice-Hall, Englewood Cliffs (2003)
The TReX Tool, http://www.liafa.jussieu.fr/~sighirea/trex/
Valmari, A.: The State Explosion Problem. In: Reisig, W., Rozenberg, G. (eds.) APN 1998. LNCS, vol. 1491, pp. 429–528. Springer, Heidelberg (1998)
Valmari, A., Kokkarinen, I.: Unbounded Verification Results by Finite-State Compositional Techniques: 10any States and Beyond. In: Proceedings of International Conference on Application of Concurrency to System Design, pp. 75–85. IEEE Computer Society, Los Alamitos (1998)
Villapol, M.E.: Modelling and Analysis of the Resource Reservation Protocol. PhD thesis, Institute for Telecommunications Research and Computer Systems Engineering Centre, School of Electrical and Information Engineering, University of South Australia, Adelaide, Australia (November 2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gallasch, G.E., Billington, J. (2005). Using Parametric Automata for the Verification of the Stop-and-Wait Class of Protocols. In: Peled, D.A., Tsay, YK. (eds) Automated Technology for Verification and Analysis. ATVA 2005. Lecture Notes in Computer Science, vol 3707. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11562948_34
Download citation
DOI: https://doi.org/10.1007/11562948_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29209-8
Online ISBN: 978-3-540-31969-6
eBook Packages: Computer ScienceComputer Science (R0)