{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T09:55:41Z","timestamp":1649152541120},"reference-count":23,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2017]]},"DOI":"10.1587\/transinf.2016fop0012","type":"journal-article","created":{"date-parts":[[2017,5,31]],"date-time":"2017-05-31T18:23:09Z","timestamp":1496254989000},"page":"1190-1199","source":"Crossref","is-referenced-by-count":0,"title":["Validating DCCP Simultaneous-Open and Feature Negotiation Procedures"],"prefix":"10.1587","volume":"E100.D","author":[{"given":"Somsak","family":"VANIT-ANUNCHAI","sequence":"first","affiliation":[{"name":"School of Telecommunication Engineering, Suranaree University of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","unstructured":"[1] J. Billington and S. Vanit-Anunchai, \u201cIterative modelling of an evolving Internet standard: the datagram congestion control protocol,\u201d Fundamenta Informaticae, vol.88, no.3, pp.357-385, 2008."},{"key":"2","unstructured":"[2] J. Billington, S. Vanit-Anunchai, and G.E. Gallasch, \u201cParameterised coloured petri net channel models,\u201d Trans. Petri Nets and Other Models of Concurrency III, vol.5800, pp.71-97, 2009."},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] E.M. Clarke, O. Grumberg, M. Minna, and D. Peled, \u201cState Space Reduction using Partial Order Techniques,\u201d International Journal on Software Tools for Technology Transfer, vol.2, no.3, pp.279-287, 1999.","DOI":"10.1007\/s100090050035"},{"key":"4","unstructured":"[4] CPN Tools home page. http:\/\/cpntools.org"},{"key":"5","unstructured":"[5] DCCP home page. http:\/\/www.read.cs.ucla.edu\/dccp\/"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] G. Fairhurst, \u201cDatagram congestion control protocol (DCCP) simultaneous-open technique to FacilitateNAT\/Middlebox traversal,\u201d RFC 5596, Sept. 2009.","DOI":"10.17487\/rfc5596"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] S. Floyd, M. Handley, and E. Kohler, \u201cProblem statement for the datagram congestion control protocol (DCCP),\u201d RFC 4336, March 2006.","DOI":"10.17487\/rfc4336"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] G.E. Gallasch, J. Billington, S. Vanit-Anunchai, and L.M. Kristensen, \u201cChecking Safety Properties On-The-Fly with the Sweep-line Method,\u201d International Journal on Software Tools for Technology Transfer, vol.9, no.3-4, pp.374-391, June 2007.","DOI":"10.1007\/s10009-007-0031-4"},{"key":"9","unstructured":"[9] B. Han, Formal Specification of the TCP Service and Verification of TCP Connection Management, PhD thesis, Computer Systems Engineering Centre, School of Electrical and Information Engineering, University of South Australia, Adelaide, Australia, Dec. 2004."},{"key":"10","unstructured":"[10] G.J. Holzmann, Design and Validation of Computer Protocols, Prentice Hall, 1990."},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] K. Jensen, \u201cCondensed State Spaces for Symmetrical Coloured Petri Nets,\u201d Formal Methods in System Design, vol.9, no.1\/2, pp.7-40, 1996.","DOI":"10.1007\/BF00625967"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] K. Jensen and L.M. Kristensen, Coloured Petri Nets: Modelling and Validation of Concurrent Systems, Springer, Heidelberg, 2009.","DOI":"10.1007\/b95112"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] E. Kohler, M. Handley, and S. Floyd, \u201cDesigning DCCP: Congestion Control Without Reliability,\u201d Proceedings of the 2006 ACM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM'06), pp.27-38, Pisa, Italy, Sept. 2006.","DOI":"10.1145\/1159913.1159918"},{"key":"14","unstructured":"[14] E. Kohler, M. Handley, and S. Floyd, SUBSTANTIVE DIFFERENCES BETWEEN draft-ietf-dccp-spec-11 AND draft-ietf-dccp-spec-12, Dec. 2005."},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] E. Kohler, M. Handley, and S. Floyd, Datagram Congestion Control Protocol, RFC 4340, March 2006.","DOI":"10.17487\/rfc4340"},{"key":"16","unstructured":"[16] E. Kohler, M. Handley, and S. Floyd, SUBSTANTIVE DIFFERENCES BETWEEN draft-ietf-dccp-spec-13 AND RFC 4340, March 2006."},{"key":"17","unstructured":"[17] S. Vanit-Anunchai, \u201cAnalysis of two-layer protocols: DCCP simultaneous-open and hole punching procedures,\u201d Proc. 1st French Singaporean Workshop on Formal Methods and Applications, (FSFMA 2013), pp.3-17, Singapore, July 2013."},{"key":"18","unstructured":"[18] S. Vanit-Anunchai, An Investigation of the Datagram Congestion Control Protocol's Connection Management and Synchronisation Procedures, PhD thesis, Computer Systems Engineering Centre, School of Electrical and Information Engineering, University of South Australia, Adelaide, Australia, Nov. 2007."},{"key":"19","unstructured":"[19] S. Vanit-Anunchai, \u201cValidating DCCP simultaneous feature negotiation procedure,\u201d Trans. Petri Nets and Other Models of Concurrency XI, vol.9930, pp.71-91, 2016."},{"key":"20","doi-asserted-by":"crossref","unstructured":"[20] S. Vanit-Anunchai, \u201cValidating SCTP simultaneous open procedure,\u201d Proceedings of the 5th International Conference on Fundamentals of Software Engineering, FSEN2013, Revised Selected Papers, pp.233-249, Springer, Heidelberg, Tehran, Iran, April 2013.","DOI":"10.1007\/978-3-642-40213-5_15"},{"key":"21","doi-asserted-by":"crossref","unstructured":"[21] S. Vanit-Anunchai and J. Billington, \u201cModelling the datagram congestion control protocol's connection management and synchronisation procedures,\u201d Proc. 28th International Conference on Application and Theory of Petri Nets and other models of concurrency (ICATPN'07), pp.423-444, Springer, Heidelberg, Siedlce, Poland, June 2007.","DOI":"10.1007\/978-3-540-73094-1_25"},{"key":"22","doi-asserted-by":"crossref","unstructured":"[22] S. Vanit-Anunchai, J. Billington, and G.E. Gallasch, \u201cAnalysis of the Datagram Congestion Control Protocol's Connection Management Procedures using the Sweep-line Method,\u201d International Journal on Software Tools for Technology Transfer, vol.10, no.1, pp.29-56, 2008.","DOI":"10.1007\/s10009-007-0050-1"},{"key":"23","unstructured":"[23] S. Vanit-Anunchai, J. Billington, and T. Kongprakaiwoot, \u201cDiscovering Chatter and Incompleteness in the Datagram Congestion Control Protocol,\u201d Proceedings of the 25th International Conference on Formal Techniques for Networked and Distributed Systems (FORTE 2005), vol.3731, pp.143-158, Springer, Heidelberg, Taipei, Taiwan, Oct. 2005."}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E100.D\/6\/E100.D_2016FOP0012\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,25]],"date-time":"2019-09-25T06:01:58Z","timestamp":1569391318000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E100.D\/6\/E100.D_2016FOP0012\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"references-count":23,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2017]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2016fop0012","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}