Analysis of the Datagram Congestion Control Protocol’s connection management procedures using the sweep-line method
暂无分享,去创建一个
Jonathan Billington | Guy Edward Gallasch | Somsak Vanit-Anunchai | J. Billington | G. E. Gallasch | S. Vanit-Anunchai
[1] Jonathan Billington,et al. Using Parametric Automata for the Verification of the Stop-and-Wait Class of Protocols , 2005, ATVA.
[2] Lars Michael Kristensen,et al. A Generalised Sweep-Line Method for Safety Properties , 2002, FME.
[3] A. Prasad Sistla,et al. Symmetry and model checking , 1993, Formal Methods Syst. Des..
[4] Lars-Åke Fredlund,et al. Book Review: Design and Validation of Computer Protocols by Gerard J. Holzmann (Prentice Hall, 1991) , 1991, CCRV.
[5] Robin Milner,et al. Definition of standard ML , 1990 .
[6] Lars Michael Kristensen,et al. Efficient Path Finding with the Sweep-Line Method Using External Storage , 2003, ICFEM.
[7] Gerard J. Holzmann,et al. An Analysis of Bitstate Hashing , 1995, Formal Methods Syst. Des..
[8] Pierre Wolper,et al. Partial-Order Methods for Temporal Verification , 1993, CONCUR.
[9] Lars Michael Kristensen,et al. Coloured Petri Nets and CPN Tools for modelling and validation of concurrent systems , 2007, International Journal on Software Tools for Technology Transfer.
[10] Mark Handley,et al. Datagram Congestion Control Protocol (DCCP) , 2006, RFC.
[11] J. Billington,et al. Chattering behaviour in datagram congestion control protocol , 2005 .
[12] Jonathan Billington,et al. Modelling the Datagram Congestion Control Protocol's Connection Management and Synchronization Procedures , 2007, ICATPN.
[13] Doron A. Peled,et al. All from One, One for All: on Model Checking Using Representatives , 1993, CAV.
[14] Lars Michael Kristensen,et al. The practitioner’s guide to coloured Petri nets , 1998, International Journal on Software Tools for Technology Transfer.
[15] Jonathan Billington,et al. Checking safety properties on-the-fly with the sweep-line method , 2007, International Journal on Software Tools for Technology Transfer.
[16] Antti Valmari,et al. The State Explosion Problem , 1996, Petri Nets.
[17] Pierre Wolper,et al. Reliable Hashing without Collosion Detection , 1993, CAV.
[18] Jonathan Billington,et al. Discovering Chatter and Incompleteness in the Datagram Congestion Control Protocol , 2005, FORTE.
[19] Atanas N. Parashkevov,et al. Space Efficient Reachability Analysis Through Use of Pseudo-Root States , 1997, TACAS.
[20] Antti Valmari,et al. A stubborn attack on state explosion , 1990, Formal Methods Syst. Des..
[21] Jonathan Billington,et al. Sweep-Line Analysis of TCP Connection Management , 2005, ICFEM.
[22] Gerard J. Holzmann,et al. State-space caching revisited , 1992, Formal Methods Syst. Des..
[23] Kurt Jensen. Condensed state spaces for symmetrical Coloured Petri Nets , 1996, Formal Methods Syst. Des..
[24] Jonathan Billington,et al. Effect of Sequence Number Wrap on DCCP Connection Establishment , 2006, 14th IEEE International Symposium on Modeling, Analysis, and Simulation.
[25] Jonathan Billington,et al. Verification of a Revised WAP Wireless Transaction Protocol , 2002, ICATPN.
[26] Martin Peschke,et al. Design and Validation of Computer Protocols , 2003 .
[27] Jonathan Billington,et al. Exploiting equivalence reduction and the sweep-line method for detecting terminal states , 2004, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.
[28] Douglas Thorby,et al. 1 – Basic Concepts , 2008 .
[29] Jonathan Billington,et al. Checking Language Inclusion OnThe-Fly with the Sweep-line Method ? , 2005 .
[30] Lars Michael Kristensen,et al. A Sweep-Line Method for State Space Exploration , 2001, TACAS.