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
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
A parametric state space for the analysis of the infinite class of stop-and-wait protocols
SPIN'06 Proceedings of the 13th international conference on Model Checking Software
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). 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.