{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:48:13Z","timestamp":1725662893014},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540133452"},{"type":"electronic","value":"9783540388869"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1984]]},"DOI":"10.1007\/3-540-13345-3_19","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T13:02:07Z","timestamp":1330174927000},"page":"209-221","source":"Crossref","is-referenced-by-count":1,"title":["Communicating finite state machines with priority channels"],"prefix":"10.1007","author":[{"given":"M. G.","family":"Gouda","sequence":"first","affiliation":[]},{"given":"L. E.","family":"Rosier","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"key":"19_CR1","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":"19_CR2","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":"19_CR3","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":"19_CR4","doi-asserted-by":"crossref","unstructured":"Gouda, M., Manning, E. and Yu, Y., On the Progress of Communication between Two Finite State Machines, University of Texas, Department of Computer Sciences, Tech. Rep. No. 200, May 1982, revised August 1983.","DOI":"10.1016\/S0019-9958(84)80014-5"},{"key":"19_CR5","unstructured":"Gouda, M. and Rosier, L., Priority Networks for Communicating Finite State Machines, Technical Report TR 83-10, Dept. of Computer Sciences, Univ. of Texas at Austin, August 1983. Submitted for publication."},{"key":"19_CR6","unstructured":"Hack, M., Decidability Questions for Petri Nets, Ph.D. dissertation, Department of Electrical Engineering, MIT, 1975."},{"key":"19_CR7","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."},{"issue":"1","key":"19_CR8","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/322047.322058","volume":"25","author":"O. Ibarra","year":"1978","unstructured":"Ibarra, O., Reversal-Bounded Multicounter Machines and their Decision Problems, J. ACM, Vol. 25, No. 1, 1978, pp. 116\u2013133.","journal-title":"J. ACM"},{"key":"19_CR9","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/BF01752400","volume":"14","author":"O. Ibarra","year":"1981","unstructured":"Ibarra, O. and Rosier, L., On Restricted One-Counter Machines, Math. Systems Theory, Vol. 14, 1981, pp. 241\u2013245.","journal-title":"Math. Systems Theory"},{"issue":"2","key":"19_CR10","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"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Kosaraju, S., Decidability of Reachability in Vector Addition Systems, Proc. of the 14th Annual ACM Symp. on the Theory of Computing, 1982, pp. 267\u2013281.","DOI":"10.1145\/800070.802201"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Mayr, E., An Algorithm for the General Petri Net Reachability Problem, Proc. of the 13th Annual ACM Symp. on the Theory of Computing, 1981, pp. 238\u2013246.","DOI":"10.1145\/800076.802477"},{"key":"19_CR13","unstructured":"Merlin, P. and Bochmann, G., On the Construction of Communication Protocols and Module Specification, Pub. 352, Dept. dinformatique de recherche op' erationnelle, Universit'e de Montreal, January 1980."},{"key":"19_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."},{"key":"19_CR15","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":"19_CR16","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":"19_CR17","unstructured":"Rosier, L. and Gouda, M., On Deciding Progress for a Class of Communication Protocols, in Proc. of the Eighteenth Annual Conference on Information Sciences and Systems, Princeton Univ., 1984."},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"Sacerdote, G. and Tenney, R., The Decidability of the Reachability Problem for Vector Addition Systems, Proc. of the 9th Annual ACM Symp. on Theory of Computing, 1977, pp. 61\u201376.","DOI":"10.1145\/800105.803396"},{"issue":"2","key":"19_CR19","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"},{"key":"19_CR20","volume-title":"Computer Networks","author":"A. Tannenbaum","year":"1981","unstructured":"Tannenbaum, A., \"Computer Networks\", Prentice Hall, Englewood Cliffs, NJ, 1981."},{"key":"19_CR21","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"},{"issue":"12","key":"19_CR22","first-page":"2514","volume":"COM-30","author":"Y. Yu","year":"1982","unstructured":"Yu, Y. and Gouda, M., Deadlock Detection for a Class of Communicating Finite State Machines, IEEE Trans. on Comm., Vol. COM-30, No. 12, December 1982, pp. 2514\u20132518.","journal-title":"IEEE Trans. on Comm."},{"key":"19_CR23","unstructured":"Yu. Y. and Gouda, M., Unboundedness Detection for a Class of Communicating Finite State Machines, to appear in Information Processing Letters."},{"issue":"4","key":"19_CR24","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","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-13345-3_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:07:13Z","timestamp":1605625633000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-13345-3_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984]]},"ISBN":["9783540133452","9783540388869"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-13345-3_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1984]]}}}