{"id":"https://openalex.org/W1971933926","doi":"https://doi.org/10.1002/scj.4690201106","title":"A polynomial time validation method for channel boundedness of communication protocols (2 processes)","display_name":"A polynomial time validation method for channel boundedness of communication protocols (2 processes)","publication_year":1989,"publication_date":"1989-01-01","ids":{"openalex":"https://openalex.org/W1971933926","doi":"https://doi.org/10.1002/scj.4690201106","mag":"1971933926"},"language":"en","primary_location":{"id":"doi:10.1002/scj.4690201106","is_oa":false,"landing_page_url":"https://doi.org/10.1002/scj.4690201106","pdf_url":null,"source":{"id":"https://openalex.org/S58208175","display_name":"Systems and Computers in Japan","issn_l":"0882-1666","issn":["0882-1666","1520-684X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Systems and Computers in Japan","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5044930997","display_name":"Tomohisa Suganuma","orcid":null},"institutions":[{"id":"https://openalex.org/I114531698","display_name":"Tokyo Institute of Technology","ror":"https://ror.org/0112mx960","country_code":"JP","type":"education","lineage":["https://openalex.org/I114531698"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Tomohisa Suganuma","raw_affiliation_strings":["The Graduate School at Nagatsuta, Tokyo Institute of Technology, Yokohama, Japan 227","Tomohisa Suganuma graduated in 1985 from Dept. of Elect. Elect. Eng., Fac. Eng., Tokyo Institute of Technology, obtained a Master's degree from there in 1987, and affiliated with NTT. In graduate school, he engaged in research on validation of communication protocol. Presently, he is with Inf. Comm. Proc. Lab"],"affiliations":[{"raw_affiliation_string":"The Graduate School at Nagatsuta, Tokyo Institute of Technology, Yokohama, Japan 227","institution_ids":["https://openalex.org/I114531698"]},{"raw_affiliation_string":"Tomohisa Suganuma graduated in 1985 from Dept. of Elect. Elect. Eng., Fac. Eng., Tokyo Institute of Technology, obtained a Master's degree from there in 1987, and affiliated with NTT. In graduate school, he engaged in research on validation of communication protocol. Presently, he is with Inf. Comm. Proc. Lab","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110190606","display_name":"Kaoru Kurosawa","orcid":null},"institutions":[{"id":"https://openalex.org/I114531698","display_name":"Tokyo Institute of Technology","ror":"https://ror.org/0112mx960","country_code":"JP","type":"education","lineage":["https://openalex.org/I114531698"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Kaoru Kurosawa","raw_affiliation_strings":["Kaoru Kurosawa graduated in 1977 from the Dept. Electronic Eng., Fac. Eng., Tokyo Institute of Technology, and obtained a Dr. of Eng. degree from there in 1982. He was appointed Assistant in 1982 and a Lecturer in 1985 at the Tokyo Institute of Technology. He is engaged in research on multicommodity flow problems, digital signal processing, cryptography and communication protocol. He received the Paper Award in 1980 from I.E.C.E., Japan, and the Shinohara Mem. Prize in 1985 of I.E.C.E., Japan","The Graduate School at Nagatsuta, Tokyo Institute of Technology, Yokohama, Japan 227"],"affiliations":[{"raw_affiliation_string":"Kaoru Kurosawa graduated in 1977 from the Dept. Electronic Eng., Fac. Eng., Tokyo Institute of Technology, and obtained a Dr. of Eng. degree from there in 1982. He was appointed Assistant in 1982 and a Lecturer in 1985 at the Tokyo Institute of Technology. He is engaged in research on multicommodity flow problems, digital signal processing, cryptography and communication protocol. He received the Paper Award in 1980 from I.E.C.E., Japan, and the Shinohara Mem. Prize in 1985 of I.E.C.E., Japan","institution_ids":[]},{"raw_affiliation_string":"The Graduate School at Nagatsuta, Tokyo Institute of Technology, Yokohama, Japan 227","institution_ids":["https://openalex.org/I114531698"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027950221","display_name":"Yongmao Ni","orcid":null},"institutions":[{"id":"https://openalex.org/I114531698","display_name":"Tokyo Institute of Technology","ror":"https://ror.org/0112mx960","country_code":"JP","type":"education","lineage":["https://openalex.org/I114531698"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Ni Yongmao","raw_affiliation_strings":["Faculty of Engineering, Tokyo Institute of Technology, Tokyo, Japan 152","Ni Yongmao graduated in 1985 from the Dept. Electronic Eng., Fac. Eng., Utsunomiya University, and obtained a Master's degree from there in 1987. He is presently in the doctoral program at Tokyo Institute of Technology. He is engaged in research on communication protocol"],"affiliations":[{"raw_affiliation_string":"Faculty of Engineering, Tokyo Institute of Technology, Tokyo, Japan 152","institution_ids":["https://openalex.org/I114531698"]},{"raw_affiliation_string":"Ni Yongmao graduated in 1985 from the Dept. Electronic Eng., Fac. Eng., Utsunomiya University, and obtained a Master's degree from there in 1987. He is presently in the doctoral program at Tokyo Institute of Technology. He is engaged in research on communication protocol","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5044930997"],"corresponding_institution_ids":["https://openalex.org/I114531698"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.03534445,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"20","issue":"11","first_page":"60","last_page":"66"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},"topics":[{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.8487311601638794},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.737554132938385},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.6999787092208862},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.6938760280609131},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.667878270149231},{"id":"https://openalex.org/keywords/protocol","display_name":"Protocol (science)","score":0.6550374031066895},{"id":"https://openalex.org/keywords/communications-protocol","display_name":"Communications protocol","score":0.5408436059951782},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5187932848930359},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4412746727466583},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.44109222292900085},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.4231628179550171},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33752506971359253},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3159027099609375},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.26604413986206055},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.25515204668045044}],"concepts":[{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.8487311601638794},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.737554132938385},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.6999787092208862},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.6938760280609131},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.667878270149231},{"id":"https://openalex.org/C2780385302","wikidata":"https://www.wikidata.org/wiki/Q367158","display_name":"Protocol (science)","level":3,"score":0.6550374031066895},{"id":"https://openalex.org/C12269588","wikidata":"https://www.wikidata.org/wiki/Q132364","display_name":"Communications protocol","level":2,"score":0.5408436059951782},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5187932848930359},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4412746727466583},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.44109222292900085},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.4231628179550171},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33752506971359253},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3159027099609375},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26604413986206055},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.25515204668045044},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"id":"https://openalex.org/C142724271","wikidata":"https://www.wikidata.org/wiki/Q7208","display_name":"Pathology","level":1,"score":0.0},{"id":"https://openalex.org/C204787440","wikidata":"https://www.wikidata.org/wiki/Q188504","display_name":"Alternative medicine","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/scj.4690201106","is_oa":false,"landing_page_url":"https://doi.org/10.1002/scj.4690201106","pdf_url":null,"source":{"id":"https://openalex.org/S58208175","display_name":"Systems and Computers in Japan","issn_l":"0882-1666","issn":["0882-1666","1520-684X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Systems and Computers in Japan","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1655990431","https://openalex.org/W1979799094","https://openalex.org/W1990154918","https://openalex.org/W6645275246"],"related_works":["https://openalex.org/W2972379433","https://openalex.org/W1501430220","https://openalex.org/W2989332944","https://openalex.org/W2021891065","https://openalex.org/W2583549044","https://openalex.org/W2119045600","https://openalex.org/W2584984136","https://openalex.org/W2962928105","https://openalex.org/W2170336571","https://openalex.org/W2020140696"],"abstract_inverted_index":{"Abstract":[0],"The":[1,32,119],"number":[2,116],"of":[3,43,60,71,98,103,114,117],"messages":[4,138],"on":[5],"a":[6,44,61,66,90,96,111,142],"communication":[7,27,33,45,134,153],"channel":[8,73,129,146],"must":[9],"be":[10,20,87],"bounded.":[11],"On":[12],"the":[13,25,30,41,57,69,72,101,104,107,115,124,128,133,145,151],"other":[14],"hand,":[15],"it":[16,77],"is":[17,35,59,74,78,110,121,130,147],"known":[18,80],"to":[19],"undecidable":[21],"whether":[22,81],"or":[23,82],"not":[24,79,83],"given":[26],"protocol":[28,34,135],"satisfies":[29],"condition.":[31],"modeled":[36,67],"in":[37,40,64,89,123,132,150],"most":[38],"cases":[39],"form":[42],"between":[46],"two":[47],"finite\u2010state":[48],"machines.":[49],"Yu":[50],"and":[51],"Gouda":[52],"have":[53],"shown":[54],"that":[55,126],"if":[56,127],"message":[58],"single":[62,143],"type":[63],"such":[65],"protocol,":[68],"boundedness":[70,102],"decidable.":[75],"However,":[76],"this":[84],"problem":[85],"can":[86],"answered":[88],"polynomial":[91],"time.":[92],"This":[93],"paper":[94],"presents":[95],"method":[97],"validation":[99,108],"for":[100],"channel,":[105],"where":[106,136],"time":[109],"cubic":[112],"order":[113],"states.":[118],"result":[120],"important":[122],"sense":[125],"bounded":[131,149],"all":[137],"are":[139],"transformed":[140],"into":[141],"type,":[144],"also":[148],"original":[152],"protocol.":[154]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}