Abstract
The Wireless Transaction Protocol (WTP) is part of the Wireless Application Protocol (WAP) architecture and provides a reliable request-response service. The state space method of Coloured Petri Nets has been used to analyse a revised version of WTP, to gain a high level of confidence in the correctness of the design. Full state space analysis allows us to prove properties of the protocol for maximum values of the retransmission counters used in GSM networks (values are 4). However, the size of the state space grows rapidly as the maximum counter values are increased. We apply the sweep-line method to take advantage of the progress present in the protocol, notably the progression through major states of the protocol entities, and the increasing nature of the retransmission counters. The sweep-line method allows us to prove properties of the protocol for larger counter values, including those used in Internet Protocol (IP) networks (where the maximum values are 8). As a result, verification of WTP can be performed for the two most important networks (GSM and IP), the ones for which the WAP standard gives recommended maximum values for the retransmission counters.
The work of Lars M. Kristensen and Jonathan Billington has been supported by an Australian Research Council (ARC) Discovery Grant (DP0210524).
Supported by the Danish Natural Science Research Council.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
AT&T. FSM Library. Web site: http://www.research.att.com/sw/tools/fsm.
J. Billington, M. Diaz, and G. Rozenberg (Eds.) Application of Petri Nets to Communication Networks. LNCS 1605. Springer-Verlag, 1999.
J. Billington, M. C. Wilbur-Ham, and M. Y. Bearman. In Protocol Specification, Verification and Testing V, pages 59–70. Elsevier Science Publishers, Amsterdam, New York, Oxford, 1986.
J. Billington. Formal Specification of Protocols: Protocol Engineering. In Encyclopedia of Microcomputers, pages 299–314. Marcel Dekker, New York, NY, 1991.
S. Christensen, L. M. Kristensen, and T. Mailund. Design/CPN Sweep-Line Method Library. Department of Computer Science, Aarhus University, Aarhus, Denmark, 2001. To appear, http://www.daimi.au.dk/designCPN/.
S. Christensen, L. M. Kristensen, and T. Mailund. A Sweep-Line Method for State Space Exploration. In Proc. of TACAS 2001, pages 450–464, LNCS 2031, Springer-Verlag, 2001
CPN Group. Design/CPN Online. http://www.daimi.au.dk/designCPN/.
D. E. Comer. Internetworking with TCP/IP. Prentice Hall, Upper Saddle River, NJ, fourth edition, 2000.
S. Gordon and J. Billington. Modelling the WAP Transaction Service using Coloured Petri nets. In Proc. of MDA 1999, pages 105–114. LNCS 1748, Springer-Verlag, 1999.
S. Gordon and J. Billington. Analysing the WAP Class 2 Wireless Transaction Protocol using Coloured Petri nets. In Proc. of ICATPN 2000, pages 207–226, LNCS 1825. Springer-Verlag, 2000.
S. D. Gordon. Verification of the WAP Transaction Layer using Coloured Petri Nets. PhD thesis, University of South Australia, Australia, Nov. 2001.
G. J. Holzmann. Design and Validation of Computer Protocols. Prentice-Hall, Englewood Cliffs, NJ, 1991.
ITU. Information Technology—Open Systems Interconnection—Basic reference model: The basic model. ITU-T Recommendation X.200, July 1994.
C. Jard and T. Jeron. Bounded-memory Algorithms for Verification On-the-fly. In Proc. of CAV’91, pages 192–202, LNCS 575. Springer-Verlag, 1991.
K. Jensen. Coloured Petri Nets. Basic Concepts, Analysis Methods and Practical Use. Volumes 1 to 3. Monographs in Theoretical Computer Science. Springer-Verlag, Berlin, 1997.
J. B. Jørgensen and L. M. Kristensen. Computer Aided Verification of Lamport’s Fast Mutual Exclusion Algorithm using Coloured Petri nets and Occurrence Graphs with Symmetries. IEEE Trans. Parallel and Dist. Sys., 10(7):714–732, July 1999.
L. Lorentsen and L. Kristensen. Modelling and analysis of a Danfoss Flowmeter System. In Proc. of ICATPN’2000, pages 346–366, LNCS 1825. Springer-Verlag, 2000.
J. D. Ullman. Elements of ML Programming. Prentice Hall, Englewood Cliffs, NJ, 2nd edition, 1998.
A. Valmari. Stubborn Sets for Reduced State Space Generation. In Advances in Petri Nets 1990, pages 491–515, LNCS 424. Springer-Verlag, 1990.
A. Valmari. Stubborn Sets of Coloured Petri Nets. In G. Rozenberg, editor, Proc. of ICATPN’91, pages 102–121, 1991.
WAP Forum. Wireless Application Protocol. Specifications available via: http://www.wapforum.org/.
WAP Forum. WAP Wireless Transaction Protocol Specification. June 2000 Conformance Release. Available via: http://www.wapforum.org/, 19 Feb. 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gordon, S., Kristensen, L.M., Billington, J. (2002). Verification of a Revised WAP Wireless Transaction Protocol. In: Esparza, J., Lakos, C. (eds) Application and Theory of Petri Nets 2002. ICATPN 2002. Lecture Notes in Computer Science, vol 2360. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48068-4_12
Download citation
DOI: https://doi.org/10.1007/3-540-48068-4_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43787-1
Online ISBN: 978-3-540-48068-6
eBook Packages: Springer Book Archive