{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T06:41:07Z","timestamp":1698043267370},"reference-count":3,"publisher":"Wiley","issue":"11","license":[{"start":{"date-parts":[[2007,3,21]],"date-time":"2007-03-21T00:00:00Z","timestamp":1174435200000},"content-version":"vor","delay-in-days":6653,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Systems &amp;amp; Computers in Japan"],"published-print":{"date-parts":[[1989,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The number of messages on a communication channel must be bounded. On the other hand, it is known to be undecidable whether or not the given communication protocol satisfies the condition. The communication protocol is modeled in most cases in the form of a communication between two finite\u2010state machines. Yu and Gouda have shown that if the message is of a single type in such a modeled protocol, the boundedness of the channel is decidable. However, it is not known whether or not this problem can be answered in a polynomial time. This paper presents a method of validation for the boundedness of the channel, where the validation time is a cubic order of the number of states. The result is important in the sense that if the channel is bounded in the communication protocol where all messages are transformed into a single type, the channel is also bounded in the original communication protocol.<\/jats:p>","DOI":"10.1002\/scj.4690201106","type":"journal-article","created":{"date-parts":[[2007,7,7]],"date-time":"2007-07-07T17:30:32Z","timestamp":1183829432000},"page":"60-66","source":"Crossref","is-referenced-by-count":0,"title":["A polynomial time validation method for channel boundedness of communication protocols (2 processes)"],"prefix":"10.1002","volume":"20","author":[{"given":"Tomohisa","family":"Suganuma","sequence":"first","affiliation":[]},{"given":"Kaoru","family":"Kurosawa","sequence":"additional","affiliation":[]},{"given":"Ni","family":"Yongmao","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2007,3,21]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(83)90105-9"},{"key":"e_1_2_1_3_2","first-page":"65","article-title":"An improved protocol validation technique","volume":"6","author":"Rubin J.","year":"1982","journal-title":"Computer Networks"},{"key":"e_1_2_1_4_2","volume-title":"The Design and Analysis of Computer Algorithms","author":"Aho A. V.","year":"1976"}],"container-title":["Systems and Computers in Japan"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fscj.4690201106","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/scj.4690201106","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T13:35:52Z","timestamp":1697981752000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/scj.4690201106"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,1]]},"references-count":3,"journal-issue":{"issue":"11","published-print":{"date-parts":[[1989,1]]}},"alternative-id":["10.1002\/scj.4690201106"],"URL":"https:\/\/doi.org\/10.1002\/scj.4690201106","archive":["Portico"],"relation":{},"ISSN":["0882-1666","1520-684X"],"issn-type":[{"value":"0882-1666","type":"print"},{"value":"1520-684X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,1]]}}}