{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T13:50:05Z","timestamp":1754488205119},"reference-count":28,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1986,1,1]],"date-time":"1986-01-01T00:00:00Z","timestamp":504921600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":10059,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1986]]},"DOI":"10.1016\/0304-3975(86)90110-6","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T06:09:04Z","timestamp":1051250944000},"page":"69-105","source":"Crossref","is-referenced-by-count":20,"special_numbering":"C","title":["Boundedness, empty channel detection, and synchronization for communicating finite automata"],"prefix":"10.1016","volume":"44","author":[{"given":"Louis E.","family":"Rosier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hsu-Chun","family":"Yen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(86)90110-6_BIB1","series-title":"Proc. First Ann. Symp. on Computer Architecture","first-page":"81","article-title":"Comments on capabilities, limitations and \u201ccorrectness\u201d of Petri nets","author":"Agerwala","year":"1973"},{"issue":"12","key":"10.1016\/0304-3975(86)90110-6_BIB2","doi-asserted-by":"crossref","first-page":"2497","DOI":"10.1109\/TCOM.1982.1095452","article-title":"Petri nets theory for the correctness of protocols","volume":"COM-30","author":"Berthelot","year":"1982","journal-title":"IEEE Trans. Comm."},{"key":"10.1016\/0304-3975(86)90110-6_BIB3","first-page":"361","article-title":"Finite state description of communication protocols","volume":"2","author":"Bochmann","year":"1978","journal-title":"Comput. Networks"},{"issue":"2","key":"10.1016\/0304-3975(86)90110-6_BIB4","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1145\/322374.322380","article-title":"On communicating finite-state machines","volume":"30","author":"Brand","year":"1983","journal-title":"J. ACM"},{"issue":"1","key":"10.1016\/0304-3975(86)90110-6_BIB5","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1145\/321623.321625","article-title":"Characterizations of pushdown machines in terms of time-bounded computers","volume":"18","author":"Cook","year":"1971","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(86)90110-6_BIB6","series-title":"Proc. Second Internat. Conf. on Distributed Computing Systems","first-page":"433","article-title":"A synchronization calculus for message oriented programming","author":"Cunha","year":"1981"},{"issue":"3","key":"10.1016\/0304-3975(86)90110-6_BIB7","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1137\/0214042","article-title":"Priority networks of communicating finite state machines","volume":"14","author":"Gouda","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(86)90110-6_BIB8","article-title":"Decidability questions for Petri nets","author":"Hack","year":"1975"},{"key":"10.1016\/0304-3975(86)90110-6_BIB9","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0304-3975(79)90041-0","article-title":"On the reachability problem for 5-dimensional vector addition systems","volume":"8","author":"Hopcroft","year":"1979","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(86)90110-6_BIB10","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0304-3975(86)90110-6_BIB11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01683259","article-title":"New problems complete for nondeterministic log space","volume":"10","author":"Jones","year":"1976","journal-title":"Math. Systems Theory"},{"issue":"2","key":"10.1016\/0304-3975(86)90110-6_BIB12","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/S0022-0000(69)80011-5","article-title":"Parallel program schemata","volume":"3","author":"Karp","year":"1969","journal-title":"J. Comput. System Sci."},{"issue":"4","key":"10.1016\/0304-3975(86)90110-6_BIB13","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1145\/957195.808062","article-title":"Limitations of Dijkstra's semaphore primitives and Petri nets","volume":"7","author":"Kosaraju","year":"1973","journal-title":"Oper. Systems Rev."},{"issue":"7","key":"10.1016\/0304-3975(86)90110-6_BIB14","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1145\/359545.359563","article-title":"Time, clocks, and the ordering of events in a distributed system","volume":"21","author":"Lamport","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(86)90110-6_BIB15","series-title":"Computation: Finite and Infinite Machines","author":"Minsky","year":"1967"},{"issue":"3","key":"10.1016\/0304-3975(86)90110-6_BIB16","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1145\/360680.360709","article-title":"On a solution to the cigarette smoker's problem (without conditional statements)","volume":"18","author":"Parnas","year":"1975","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(86)90110-6_BIB17","article-title":"Limitations and capabilities of Dijkstra's semaphore primitives for coordination among processes","author":"Patil","year":"1971"},{"key":"10.1016\/0304-3975(86)90110-6_BIB18","series-title":"Petri Net Theory and the Modeling of Systems","author":"Peterson","year":"1981"},{"key":"10.1016\/0304-3975(86)90110-6_BIB19","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0304-3975(78)90036-1","article-title":"The covering and boundedness problems for vector addition systems","volume":"6","author":"Rackoff","year":"1978","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"10.1016\/0304-3975(86)90110-6_BIB20","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0020-0190(85)90033-X","article-title":"Exposure to deadlock for communicating processes is hard to detect","volume":"21","author":"Raeuchle","year":"1985","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(86)90110-6_BIB21","series-title":"Proc. Eighteenth Ann. Conf. on Information Sciences and Systems","first-page":"663","article-title":"On deciding progress for a class of communicating protocols","author":"Rosier","year":"1984"},{"issue":"2","key":"10.1016\/0304-3975(86)90110-6_BIB22","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","article-title":"Relationships between nondeterministic and deterministic tape complexities","volume":"4","author":"Savitch","year":"1970","journal-title":"J. Comput. System Sci."},{"issue":"1","key":"10.1016\/0304-3975(86)90110-6_BIB23","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/S0022-0000(75)80014-6","article-title":"On tape-bounded complexity classes and multihead finite automata","volume":"10","author":"Sudborough","year":"1975","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(86)90110-6_BIB24","article-title":"Formal modelling of communication protocols","author":"Sunshine","year":"1981"},{"key":"10.1016\/0304-3975(86)90110-6_BIB25","series-title":"Computer Networks","author":"Tannenbaum","year":"1981"},{"issue":"3","key":"10.1016\/0304-3975(86)90110-6_BIB26","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1016\/S0022-0000(75)80005-5","article-title":"Deterministic one-counter automata","volume":"10","author":"Valiant","year":"1975","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(86)90110-6_BIB27","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0020-0190(83)90105-9","article-title":"Unboundedness detection for a class of communicating finite state machines","volume":"17","author":"Yu","year":"1983","journal-title":"Inform. Process. Lett."},{"issue":"4","key":"10.1016\/0304-3975(86)90110-6_BIB28","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1109\/TCOM.1980.1094687","article-title":"Towards analyzing and synthesizing protocols","volume":"COM-28","author":"Zafiropulo","year":"1980","journal-title":"IEEE Trans. Comm."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397586901106?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397586901106?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T16:53:35Z","timestamp":1553187215000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397586901106"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"references-count":28,"alternative-id":["0304397586901106"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(86)90110-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1986]]}}}