Modelling the Datagram Congestion Control Protocol's Connection Management and Synchronization Procedures
暂无分享,去创建一个
[1] Jonathan Billington,et al. Sweep-Line Analysis of TCP Connection Management , 2005, ICFEM.
[2] Mark Handley,et al. Designing DCCP: congestion control without reliability , 2006, SIGCOMM 2006.
[3] Jonathan Billington,et al. Discovering Chatter and Incompleteness in the Datagram Congestion Control Protocol , 2005, FORTE.
[4] Douglas Thorby,et al. 1 – Basic Concepts , 2008 .
[5] Wolfgang Reisig,et al. Lectures on Concurrency and Petri Nets , 2003, Lecture Notes in Computer Science.
[6] Kurt Jensen,et al. Coloured Petri Nets , 1997, Monographs in Theoretical Computer Science An EATCS Series.
[7] J. Billington,et al. Chattering behaviour in datagram congestion control protocol , 2005 .
[8] Farn Wang. Formal Techniques for Networked and Distributed Systems - FORTE 2005, 25th IFIP WG 6.1 International Conference, Taipei, Taiwan, October 2-5, 2005, Proceedings , 2005, FORTE.
[9] Jonathan Billington,et al. Effect of Sequence Number Wrap on DCCP Connection Establishment , 2006, 14th IEEE International Symposium on Modeling, Analysis, and Simulation.
[10] Kurt Jensen,et al. Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use. Vol. 2, Analysis Methods , 1992 .
[11] Jonathan Billington,et al. Checking safety properties on-the-fly with the sweep-line method , 2007, International Journal on Software Tools for Technology Transfer.
[12] Kurt Jensen,et al. Coloured Petri nets (2nd ed.): basic concepts, analysis methods and practical use: volume 1 , 1996 .
[13] Jonathan Billington,et al. A Coloured Petri Net Approach to Protocol Verification , 2003, Lectures on Concurrency and Petri Nets.