Using parametric automata for the verification of the stop-and-wait class of protocols
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ISSN: 0302-9743, Vol: 3707 LNCS, Page: 457-473
2005
- 7Citations
- 2Captures
Metric Options: CountsSelecting the 1-year or 3-year option will change the metrics count to percentiles, illustrating how an article or review compares to other articles or reviews within the selected time period in the same journal. Selecting the 1-year option compares the metrics against other articles/reviews that were also published in the same calendar year. Selecting the 3-year option compares the metrics against other articles/reviews that were also published in the same calendar year plus the two years prior.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Conference Paper Description
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. © Springer-Verlag Berlin Heidelberg 2005.
Bibliographic Details
http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=33646192102&origin=inward; http://dx.doi.org/10.1007/11562948_34; http://link.springer.com/10.1007/11562948_34; http://link.springer.com/content/pdf/10.1007/11562948_34.pdf; https://dx.doi.org/10.1007/11562948_34; https://link.springer.com/chapter/10.1007/11562948_34; http://www.springerlink.com/index/10.1007/11562948_34; http://www.springerlink.com/index/pdf/10.1007/11562948_34
Springer Science and Business Media LLC
Provide Feedback
Have ideas for a new metric? Would you like to see something else here?Let us know