Design and validation of computer protocols
Design and validation of computer protocols
Stubborn sets for reduced state generation
APN 90 Proceedings on Advances in Petri nets 1990
Elements of ML programming (ML97 ed.)
Elements of ML programming (ML97 ed.)
Coloured Petri nets: basic concepts, analysis methods and practical use, volume 3
Coloured Petri nets: basic concepts, analysis methods and practical use, volume 3
IEEE Transactions on Parallel and Distributed Systems
Internetworking with TCP/IP, Volume 1: Principles, Protocols, and Architectures, Fourth Edition
Internetworking with TCP/IP, Volume 1: Principles, Protocols, and Architectures, Fourth Edition
Application of Petri Nets to Communication Networks, Advances in Petri Nets
Application of Petri Nets to Communication Networks, Advances in Petri Nets
Automated protocol verification
Proceedings of the IFIP WG6.1 Fifth International Conference on Protocol Specification, Testing and Verification V
A Sweep-Line Method for State Space Exploration
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Bounded-memory Algorithms for Verification On-the-fly
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
Modelling the WAP Transaction Service using Coloured Petri Nets
MDA '99 Proceedings of the First International Conference on Mobile Data Access
Analysing the WAP class 2 wireless transaction protocol using coloured Petri nets
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
Modelling and analysis of a DANFOSS flowmeter system using coloured Petri nets
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
A Compositional Sweep-Line State Space Exploration Method
FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
A Generalised Sweep-Line Method for Safety Properties
FME '02 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods - Getting IT Right
Implementing Coloured Petri Nets Using a Functional Programming Language
Higher-Order and Symbolic Computation
The Security Hole in WAP: An Analysis of the Network and Business Rationales Underlying a Failure
International Journal of Electronic Commerce
A Game-theoretic Approach to Behavioural Visualisation
Electronic Notes in Theoretical Computer Science (ENTCS)
Sweep-Line analysis of TCP connection management
ICFEM'05 Proceedings of the 7th international conference on Formal Methods and Software Engineering
Applying mobile agent to intrusion response for ad hoc networks
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part II
The sweep-line state space exploration method
Theoretical Computer Science
Model-Based prototyping of an interoperability protocol for mobile ad-hoc networks
IFM'05 Proceedings of the 5th international conference on Integrated Formal Methods
Combining the sweep-line method with the use of an external-memory priority queue
SPIN'12 Proceedings of the 19th international conference on Model Checking Software
Hybrid on-the-fly LTL model checking with the sweep-line method
PETRI NETS'12 Proceedings of the 33rd international conference on Application and Theory of Petri Nets
A Sweep-Line Method for Büchi Automata-based Model Checking
Fundamenta Informaticae - Application and Theory of Petri Nets and Concurrency, 2012
| Hi-index | 0.01 |
The Wireless Transaction Protocol (WTP) is part of the Wireless Application Protocol (WAP) architecture andp rovides a reliable request-response service. The state space methodof Coloured Petri Nets has been usedt o 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 usedin 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.