{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:14:09Z","timestamp":1725455649567},"publisher-location":"Berlin\/Heidelberg","reference-count":27,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540139125"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0024017","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T05:44:22Z","timestamp":1132379062000},"page":"287-298","source":"Crossref","is-referenced-by-count":1,"title":["Boundedness, empty channel detection and synchronization for communicating finite state machines"],"prefix":"10.1007","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":"297","reference":[{"key":"29_CR1","doi-asserted-by":"crossref","first-page":"81","DOI":"10.2172\/4390007","volume-title":"Comments on Capabilities, Limitations, and \u2018Correctness\u2019 of Petri Nets","author":"T. Agerwala","year":"1973","unstructured":"Agerwala, T. and Flynn, M., Comments on Capabilities, Limitations, and \u2018Correctness\u2019 of Petri Nets, Proceedings of the First Annual Symposium on Computer Architectures, New York: ACM, 1973, pp. 81\u201386."},{"issue":"12","key":"29_CR2","doi-asserted-by":"crossref","first-page":"2497","DOI":"10.1109\/TCOM.1982.1095452","volume":"COM-30","author":"G. Berthelot","year":"1982","unstructured":"Berthelot, G. and Terrat, R., Petri Net Theory for the Correctness of Protocols, IEEE Trans. on Comm., Vol. COM-30, No. 12, December 1982, pp. 2497\u20132505.","journal-title":"IEEE Trans. on Comm."},{"key":"29_CR3","first-page":"361","volume":"2","author":"G. Bochmann","year":"1978","unstructured":"Bochmann, G., Finite State Description of Communication Protocols, Computer Networks, Vol. 2, 1978, pp.361\u2013371.","journal-title":"Computer Networks"},{"issue":"2","key":"29_CR4","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1145\/322374.322380","volume":"30","author":"D. Brand","year":"1983","unstructured":"Brand, D. and Zafiropulo, P., On Communicating Finite-State Machines, J. ACM, Vol. 30, No. 2, April 1983, pp. 323\u2013342.","journal-title":"J. ACM"},{"key":"29_CR5","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1145\/321623.321625","volume":"18","author":"S. Cook","year":"1971","unstructured":"Cook, S., Characterizations of Pushdown Machines in Terms of Time Bounded Computers, J. ACM, Vol. 18, 1971, pp. 4\u201318.","journal-title":"J. ACM"},{"key":"29_CR6","unstructured":"Cunha, P. and Maibaum, T., A Synchronization Calculus for Message-Oriented Programming, Proc. 2nd International Conf. on Distributed Computing Systems, April 1981, pp. 433\u2013445."},{"key":"29_CR7","unstructured":"Gouda, M. and Rosier, L., Priority Networks of Communicating Finite State Machines, accepted for publication in the SIAM Journal on Computing."},{"key":"29_CR8","unstructured":"Hack, M., Decidability Questions for Petri Nets, Ph.D. dissertation, Department of Electrical Engineering, MIT, 1975."},{"key":"29_CR9","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0304-3975(79)90041-0","volume":"8","author":"J. Hopcroft","year":"1979","unstructured":"Hopcroft, J. and Pansiot, J. On the Reachability Problem for 5-Dimensional Vector Addition Systems, Theor. Computer Science, Vol. 8, 1979, pp. 135\u2013159.","journal-title":"Theor. Computer Science"},{"key":"29_CR10","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J. Hopcroft","year":"1979","unstructured":"Hopcroft, J. and Ullman, J., \"Introduction to Automata Theory, Languages, and Computation\", Addison-Wesley, Reading, Mass., 1979."},{"key":"29_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01683259","volume":"10","author":"N. Jones","year":"1976","unstructured":"Jones, N., Lien, Y. and Laaser, W., New Problems Complete for Nondeterministic Logspace, Math. Systems Theory, Vol. 10, 1976, pp. 1\u201317.","journal-title":"Math. Systems Theory"},{"issue":"2","key":"29_CR12","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/S0022-0000(69)80011-5","volume":"3","author":"R. Karp","year":"1969","unstructured":"Karp, R. and Miller, R., Parallel Program Schemata, J. of Computer and System Sciences, Vol. 3, No.2, 1969, pp.147\u2013195.","journal-title":"J. of Computer and System Sciences"},{"issue":"4","key":"29_CR13","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1145\/957195.808062","volume":"7","author":"S. Kosaraju","year":"1973","unstructured":"Kosaraju, S., Limitations of Dijkstra's Semaphore Primitives and Petri Nets, Operating Systems Review, Vol. 7, No. 4, Oct. 1973, pp. 122\u2013126.","journal-title":"Operating Systems Review"},{"key":"29_CR14","volume-title":"Computation: Finite and Infinite Machines","author":"M. Minsky","year":"1967","unstructured":"Minsky, M., \"Computation: Finite and Infinite Machines\", Prentice Hall, Englewood Cliffs, NJ, 1967."},{"issue":"3","key":"29_CR15","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1145\/360680.360709","volume":"18","author":"D. Parnas","year":"1975","unstructured":"Parnas, D., On a Solution to the Cigarette Smokers' Problem (Without Conditional Statements), Communications of the ACM, Vol. 18, No. 3, March 1975, pp. 181\u2013183.","journal-title":"Communications of the ACM"},{"key":"29_CR16","unstructured":"Patil, S., Limitations and Capabilities of Dijkstra's Semaphore Primitives for Coordination Among Processes, Group Memo 57, Project MAC, MIT, February 1971, 18 pages."},{"key":"29_CR17","volume-title":"Petri Net Theory and the Modeling of Systems","author":"J. Peterson","year":"1981","unstructured":"Peterson, J., \"Petri Net Theory and the Modeling of Systems\", Prentice Hall, Englewood Cliffs, NJ, 1981."},{"key":"29_CR18","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0304-3975(78)90036-1","volume":"6","author":"C. Rackoff","year":"1978","unstructured":"Rackoff, C., The Covering and Boundedness Problems for Vector Addition Systems, Theor. Comput. Sci., Vol. 6, 1978, pp. 223\u2013231.","journal-title":"Theor. Comput. Sci."},{"key":"29_CR19","unstructured":"Rosier, L. and Gouda, M., On Deciding Progress for a Class of Communication Protocols, in the Proceedings of the Eighteen Annual Conference on Information Sciences and Systems, Princeton Univ., 1984."},{"key":"29_CR20","unstructured":"Raeuchle, T. and Toueg, S., Exposure to Deadlock for Communicating Processes is Hard to Detect, Tech. Rep. No. 83-555, Cornell University, Department of Computer Science."},{"issue":"2","key":"29_CR21","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","volume":"4","author":"W. Savitch","year":"1970","unstructured":"Savitch, W., Relationships between Nondeterministic and Deterministic Tape Complexities, J. of Computer and System Sciences, Vol. 4, No. 2, 1970, pp. 177\u2013192.","journal-title":"J. of Computer and System Sciences"},{"issue":"1","key":"29_CR22","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/S0022-0000(75)80014-6","volume":"10","author":"I. Sudborough","year":"1975","unstructured":"Sudborough, I., On Tape-Bounded Complexity Classes and Multihead Finite Automata, J. Computer and Systems Sciences, Vol. 10, No. 1, 1975, pp. 62\u201376.","journal-title":"J. Computer and Systems Sciences"},{"key":"29_CR23","doi-asserted-by":"crossref","unstructured":"Sunshine, C., Formal Modeling of Communication Protocols, USC\/Inform. Sc. Institute, Research Report 81\u201389, March 1981.","DOI":"10.1007\/978-3-642-67978-0_24"},{"key":"29_CR24","volume-title":"Computer Networks","author":"A. Tannenbaum","year":"1981","unstructured":"Tannenbaum, A., \"Computer Networks\", Prentice Hall, Englewood Cliffs, NJ, 1981."},{"key":"29_CR25","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1016\/S0022-0000(75)80005-5","volume":"10","author":"L. Valiant","year":"1975","unstructured":"Valiant, L. and Paterson, M., Deterministic One-Counter Automata, J. of Computer and System Sciences, Vol. 10, 1975, pp. 340\u2013350.","journal-title":"J. of Computer and System Sciences"},{"key":"29_CR26","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0020-0190(83)90105-9","volume":"17","author":"Y. Yu","year":"1983","unstructured":"Yu. Y. and Gouda, M., Unboundedness Detection for a Class of Communicating Finite State Machines, Information Processing Letters, 17, December 1983, pp. 235\u2013240.","journal-title":"Information Processing Letters"},{"issue":"4","key":"29_CR27","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1109\/TCOM.1980.1094687","volume":"COM-28","author":"P. Zafiropulo","year":"1980","unstructured":"Zafiropulo, P., et. al., Towards Analyzing and Synthesizing Protocols, IEEE Trans. on Comm., Vol. COM-28, No. 4, April 1980, pp. 651\u2013661.","journal-title":"IEEE Trans. on Comm."}],"container-title":["Lecture Notes in Computer Science","STACS 85"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0024017.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:51:31Z","timestamp":1607550691000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0024017"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540139125"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/bfb0024017","relation":{},"subject":[]}}