Compiler construction: theory and practice (2nd ed.)
Compiler construction: theory and practice (2nd ed.)
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
Expressing interesting properties of programs in propositional temporal logic
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Coloured Petri Nets and CPN Tools for modelling and validation of concurrent systems
International Journal on Software Tools for Technology Transfer (STTT)
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
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
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
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
| Hi-index | 0.00 |
Model checking a parametric system when one or more of its parameters is unbounded requires considering an infinite family of models. The Stop-and-Wait Protocol (SWP) has two (unbounded) parameters: the maximum sequence number and the maximum number of retransmissions. Previously, we presented a novel method for the parametric analysisof the SWP by developing algebraic formulas in the two parameters that symbolically represent the corresponding infinite class of reachability graphs. Properties were then verified directly from these expressions. This paper extends this analysis to the verification of the SWP using language equivalence. From the algebraic expressions developed previously, a parametric Finite State Automaton (FSA) representing all sequences of user-observable events (i.e. the protocol language) is derived. We then perform determinisation and minimisation directly on the parametric FSA. The result is a simple, non-parametric FSA that is isomorphic to the service language of alternating send and receive events. This result is significant as it verifies conformance of the SWP to its service for all values of the two unbounded parameters.