Coloured Petri nets (2nd ed.): basic concepts, analysis methods and practical use: volume 1
Coloured Petri nets (2nd ed.): basic concepts, analysis methods and practical use: volume 1
Coloured Petri nets: basic concepts, analysis methods and practical use, volume 3
Coloured Petri nets: basic concepts, analysis methods and practical use, volume 3
Computer Networks
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Tackling the Infinite State Space of a Multimedia Control Protocol Service Specification
ICATPN '02 Proceedings of the 23rd International Conference on Applications and Theory of Petri Nets
Unbounded Verification Results by Finite-State Compositional Techniques: 10^any States and Beyond
CSD '98 Proceedings of the 1998 International Conference on Application of Concurrency to System Design
Using Forward Reachability Analysis for Verification of Lossy Channel Systems
Formal Methods in System Design
Fast verification of the class of stop-and-wait protocols modelled by coloured Petri nets
Nordic Journal of Computing
Data and Computer Communications and Computer Networking with internet Protocols and Technology: Opnet Lab Manual to Accompany the seventh edition and fourth edition
Using parametric automata for the verification of the stop-and-wait class of protocols
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
Model-Based prototyping of an interoperability protocol for mobile ad-hoc networks
IFM'05 Proceedings of the 5th international conference on Integrated Formal Methods
Formalising TCP's Data Transfer Service Language: A Symbolic Automaton and its Properties
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
An investigation of credit-based flow control protocols
Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops
Parametric Language Analysis of the Class of Stop-and-Wait Protocols
PETRI NETS '08 Proceedings of the 29th international conference on Applications and Theory of Petri Nets
Performance Analysis and Functional Verification of the Stop-and-Wait Protocol in HOL
Journal of Automated Reasoning
Recursive Parametric Automata and ε-Removal
FMOODS '09/FORTE '09 Proceedings of the Joint 11th IFIP WG 6.1 International Conference FMOODS '09 and 29th IFIP WG 6.1 International Conference FORTE '09 on Formal Techniques for Distributed Systems
Formalising TCP's Data Transfer Service Language: A Symbolic Automaton and its Properties
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
| Hi-index | 0.00 |
The Stop-and-Wait protocol (SWP) has two (unbounded) parameters: the maximum sequence number (MaxSeqNo) and the maximum number of retransmissions (MaxRetrans). This paper presents an algebraic method for analysis of the SWP for all possible values of these parameters. Model checking such a system requires considering an infinite family of models, one for each combination of parameter values, and thus an infinite family of state spaces (reachability graphs). These reachability graphs are represented symbolically by a set of algebraic formulas in MaxSeqNo and MaxRetrans. This result is significant as it provides a complete characterisation of the infinite set of reachability graphs of our SWP model in both parameters, allowing properties to be verified for the infinite class. Verification of a number of properties is described.