{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:21:59Z","timestamp":1740097319357,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662534007"},{"type":"electronic","value":"9783662534014"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-53401-4_4","type":"book-chapter","created":{"date-parts":[[2016,9,2]],"date-time":"2016-09-02T11:34:52Z","timestamp":1472816092000},"page":"71-91","source":"Crossref","is-referenced-by-count":2,"title":["Validating DCCP Simultaneous Feature Negotiation Procedure"],"prefix":"10.1007","author":[{"given":"Somsak","family":"Vanit-Anunchai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,9,2]]},"reference":[{"issue":"1","key":"4_CR1","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1109\/COMST.2002.5341329","volume":"4","author":"F Babich","year":"2002","unstructured":"Babich, F., Deotto, L.: Formal methods for the specification, analysis of communication protocols. IEEE Commun. Surv. 4(1), 2\u201320 (2002). Third Quarter","journal-title":"IEEE Commun. Surv."},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","volume-title":"Application of Petri Nets to Communication Networks","year":"1999","unstructured":"Billington, J., Diaz, M., Rozenberg, G. (eds.): Application of Petri Nets to Communication Networks. LNCS, vol. 1605. Springer, Heidelberg (1999)"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1007\/978-3-540-27755-2_6","volume-title":"Lectures on Concurrency and Petri Nets","author":"J Billington","year":"2004","unstructured":"Billington, J., Gallasch, G.E., Han, B.: A Coloured Petri Net approach to protocol verification. In: Desel, J., Reisig, W., Rozenberg, G. (eds.) Lectures on Concurrency and Petri Nets. LNCS, vol. 3098, pp. 210\u2013290. Springer, Heidelberg (2004)"},{"key":"4_CR4","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/978-3-642-04856-2_4","volume":"3","author":"J Billington","year":"2009","unstructured":"Billington, J., Vanit-Anunchai, S., Gallasch, G.E.: Parameterised Coloured Petri Net channel models. Trans. Petri Nets Other Models Concurrency 3, 71\u201397 (2009)","journal-title":"Trans. Petri Nets Other Models Concurrency"},{"key":"4_CR5","unstructured":"CPN Tools home page. http:\/\/cpntools.org"},{"key":"4_CR6","unstructured":"Figueiredo, J.C.A., Kristensen, L.M.: Using Coloured Petri Nets to investigate behavioural and performance issues of TCP protocols. In: Second Workshop and Tutorial on Practical Use of Coloured Petri Nets and Design\/CPN, DAIMI PB-541, pp. 21\u201340. Department of Computer Science, University of Aarhus, 11\u201315 October 1999"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Floyd, S., Handley, M., Kohler, E.: Problem statement for the Datagram Congestion Control Protocol (DCCP), RFC 4336, March 2006. http:\/\/www.rfc-editor.org\/rfc\/rfc4336.txt","DOI":"10.17487\/rfc4336"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Floyd, S., Kohler, E., Profile for Datagram Congestion Control Protocol (DCCP) congestion control ID 2: TCP-like congestion control, RFC 4341, March 2006. http:\/\/www.rfc-editor.org\/rfc\/rfc4341.txt","DOI":"10.17487\/rfc4341"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Floyd, S., Kohler, E.: Profile for Datagram Congestion Control Protocol (DCCP) congestion control ID 4: TCP-Friendly Rate Control for Small Packets (TFRC-SP), RFC 5622, August 2009. http:\/\/www.rfc-editor.org\/rfc\/rfc5622.txt","DOI":"10.17487\/rfc5622"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Floyd, S., Kohler, E., Padhye, J., Profile for Datagram Congestion Control Protocol (DCCP) congestion control ID 3: TCP-Friendly Rate Control (TFRC), RFC 4342, March 2006. http:\/\/www.rfc-editor.org\/rfc\/rfc4342.txt","DOI":"10.17487\/rfc4342"},{"key":"4_CR11","unstructured":"Gordon, S.: Verification of the WAP transaction layer using Coloured Petri Nets. Ph.D. thesis, Institute for Telecommunications Research and Computer Systems Engineering Centre, School of Electrical and Information Engineering, University of South Australia, Adelaide, Australia, November 2001"},{"key":"4_CR12","unstructured":"Han, B.: Formal specification of the TCP service and verification of TCP connection management. Ph.D. thesis, Computer Systems Engineering Centre, School of Electrical and Information Engineering, University of South Australia, Adelaide, Australia, December 2004"},{"issue":"6","key":"4_CR13","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1145\/2663340","volume":"58","author":"K Jensen","year":"2015","unstructured":"Jensen, K., Kristensen, L.M.: Colored Petri Nets: a graphical language for formal modeling and validation of concurrent systems. Commun. ACM 58(6), 61\u201370 (2015)","journal-title":"Commun. ACM"},{"key":"4_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/b95112","volume-title":"Coloured Petri Nets: Modelling and Validation of Concurrent Systems","author":"K Jensen","year":"2009","unstructured":"Jensen, K., Kristensen, L.M.: Coloured Petri Nets: Modelling and Validation of Concurrent Systems. Springer, Heidelberg (2009)"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Kohler, E., Handley, M., Floyd, S.: Designing DCCP: congestion control without reliability. In: Proceedings of the 2006 ACM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM 2006), pp. 27\u201338, Pisa, Italy, 11\u201315 September 2006","DOI":"10.1145\/1159913.1159918"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Kohler, E., Handley, M., Floyd, S.: Datagram Congestion Control Protocol, RFC 4340, March 2006. http:\/\/www.rfc-editor.org\/rfc\/rfc4340.txt","DOI":"10.17487\/rfc4340"},{"key":"4_CR17","first-page":"56","volume":"7","author":"LM Kristensen","year":"2013","unstructured":"Kristensen, L.M., Inge, K., Simonsen, F.: Applications of Coloured Petri Nets for functional validation of protocol designs. Trans. Petri Nets Other Models Concurrency 7, 56\u2013115 (2013)","journal-title":"Trans. Petri Nets Other Models Concurrency"},{"key":"4_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1007\/978-3-540-27755-2_18","volume-title":"Lectures on Concurrency and Petri Nets","author":"LM Kristensen","year":"2004","unstructured":"Kristensen, L.M., J\u00f8rgensen, J.B., Jensen, K.: Application of Coloured Petri Nets in system development. In: Desel, J., Reisig, W., Rozenberg, G. (eds.) Lectures on Concurrency and Petri Nets. LNCS, vol. 3098, pp. 626\u2013685. Springer, Heidelberg (2004)"},{"key":"4_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1007\/3-540-45614-7_31","volume-title":"FME 2002: Formal Methods - Getting IT Right","author":"LM Kristensen","year":"2002","unstructured":"Kristensen, L.M., Mailund, T.: A generalised sweep-line method for safety properties. In: Eriksson, L.-H., Lindsay, P.A. (eds.) FME 2002. LNCS, vol. 2391, pp. 549\u2013567. Springer, Heidelberg (2002)"},{"key":"4_CR20","unstructured":"University of Aberdeen, Electronics Research Group, School of Engineering: Background on Feature Negotiation. http:\/\/www.erg.abdn.ac.uk\/users\/gerrit\/dccp\/notes\/feature_negotiation\/background.html"},{"key":"4_CR21","unstructured":"University of Aberdeen, Electronics Research Group, School of Engineering: Why feature negotiation and protocol state machine are not independent. http:\/\/www.erg.abdn.ac.uk\/users\/gerrit\/dccp\/notes\/feature_negotiation\/dependencies.html"},{"key":"4_CR22","unstructured":"Vanit-Anunchai, S.: An investigation of the datagram congestion control protocol\u2019s connection management and synchronisation procedures. Ph.D. thesis, Computer Systems Engineering Centre, School of Electrical and Information Engineering, University of South Australia, Adelaide, Australia, November 2007"},{"key":"4_CR23","series-title":"OpenAccess Series in Informatics (OASIcs)","first-page":"3","volume-title":"1st French Singaporean Workshop on Formal Methods and Applications (FSFMA 2013)","author":"S Vanit-Anunchai","year":"2013","unstructured":"Vanit-Anunchai, S.: Analysis of two-layer protocols: DCCP simultaneous-open and hole punching procedures. In: Choppy, C., Sun, J. (eds.) 1st French Singaporean Workshop on Formal Methods and Applications (FSFMA 2013). OpenAccess Series in Informatics (OASIcs), vol. 31, pp. 3\u201317. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2013)"},{"key":"4_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/978-3-642-40213-5_15","volume-title":"Fundamentals of Software Engineering","author":"S Vanit-Anunchai","year":"2013","unstructured":"Vanit-Anunchai, S.: Validating SCTP simultaneous open procedure. In: Arbab, F., Sirjani, M. (eds.) FSEN 2013. LNCS, vol. 8161, pp. 233\u2013249. Springer, Heidelberg (2013)"},{"issue":"1","key":"4_CR25","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/s10009-007-0050-1","volume":"10","author":"S Vanit-Anunchai","year":"2008","unstructured":"Vanit-Anunchai, S., Billington, J., Gallasch, G.E.: Analysis of the datagram congestion control protocol\u2019s connection management procedures using the sweep-line method. Int. J. Softw. Tools Technol. Transfer 10(1), 29\u201356 (2008). http:\/\/dx.doi.org\/10.1007\/s10009-007-0050-1","journal-title":"Int. J. Softw. Tools Technol. Transfer"},{"key":"4_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/11562436_12","volume-title":"Formal Techniques for Networked and Distributed Systems - FORTE 2005","author":"S Vanit-Anunchai","year":"2005","unstructured":"Vanit-Anunchai, S., Billington, J., Kongprakaiwoot, T.: Discovering chatter and incompleteness in the datagram congestion control protocol. In: Wang, F. (ed.) FORTE 2005. LNCS, vol. 3731, pp. 143\u2013158. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Transactions on Petri Nets and Other Models of Concurrency XI"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53401-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,13]],"date-time":"2019-09-13T00:48:13Z","timestamp":1568335693000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53401-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662534007","9783662534014"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53401-4_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}