{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,22]],"date-time":"2025-05-22T09:30:22Z","timestamp":1747906222566},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"6-7","license":[{"start":{"date-parts":[[1992,6,1]],"date-time":"1992-06-01T00:00:00Z","timestamp":707356800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1992,6]]},"DOI":"10.1007\/bf01185558","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T16:12:06Z","timestamp":1108743126000},"page":"499-522","source":"Crossref","is-referenced-by-count":24,"title":["Analysis of a class of communicating finite state machines"],"prefix":"10.1007","volume":"29","author":[{"given":"Wuxu","family":"Peng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Purushothaman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"CR1","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1145\/322374.322380","volume":"30","author":"D. Brand","year":"1983","unstructured":"Brand, D., Zafiropulo, P.: On communicating finite-state machines. JACM30(2), 323?342 (1983)","journal-title":"JACM"},{"key":"CR2","unstructured":"Cunha, P.R., Maibaum, T.: A synchronization calculus for message oriented programming. In Proceedings of II International Conference on Distributed Computing Systems. April 1981, pp. 433?445"},{"issue":"3","key":"CR3","first-page":"209","volume":"6","author":"M. Gouda","year":"1987","unstructured":"Gouda, M., Gurari, E., Lai, T.-H., Rosier, L.E.: On deadlock detection in systems of communicating finite state machines. Comput. Artif. Intell.6(3), 209?228 (1987)","journal-title":"Comput. Artif. Intell."},{"key":"CR4","volume-title":"Introduction to automata theory, languages and computation","author":"J. Hopcroft","year":"1979","unstructured":"Hopcroft, J., Ullman, J.: Introduction to automata theory, languages and computation. Reading: Addison-Wesley 1979"},{"key":"CR5","first-page":"291","volume":"18","author":"D. Huynh","year":"1982","unstructured":"Huynh, D.: The complexity of semi-linear sets. Elekron. Informationsverarb. Kybernet.18, 291?338 (1982)","journal-title":"Elekron. Informationsverarb. Kybernet."},{"key":"CR6","first-page":"405","volume":"17","author":"D. Huynh","year":"1985","unstructured":"Huynh, D.: The complexity of the equivalence problem for commutative semigroups and symmetric vector addition systems. STOC17, 405?412 (1985)","journal-title":"STOC"},{"issue":"3","key":"CR7","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1145\/322077.322079","volume":"25","author":"L. Landweber","year":"1978","unstructured":"Landweber, L., Robertson, E.: Properties of conflict-free and persistant Petri nets. JACM25(3), 352?364 (1978)","journal-title":"JACM"},{"key":"CR8","unstructured":"Lipton, R.: The reachability problem requires exponential space. Research Report 62, Department of Computer Science, Yale University, January 1976"},{"key":"CR9","unstructured":"Pachl, J.: Reachability problems for CFSMs. Research Report CS-82-12, University of Waterloo, 1982"},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"Peng, W., Purushothaman, S.: Data flow analysis of communicating finite state machines. ACM TOPLAS, July 1991","DOI":"10.1145\/117009.117015"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0020-0190(85)90033-X","volume":"21","author":"T. R\u00e4uchle","year":"1985","unstructured":"R\u00e4uchle, T., Toueg, S.: Exposure to deadlock for communicating processes is hard to detect. Inf. Process. Lett.21, 63?68 (1985)","journal-title":"Inf. Process. Lett."},{"key":"CR12","volume-title":"Petri nets: An introduction","author":"W. Reisig","year":"1982","unstructured":"Reisig, W.: Petri nets: An introduction. Berlin Heidelberg New York Springer 1982"},{"issue":"12","key":"CR13","doi-asserted-by":"crossref","first-page":"2514","DOI":"10.1109\/TCOM.1982.1095450","volume":"30","author":"Y.T. Yu","year":"1982","unstructured":"Yu, Y.T., Gouda, M.G.: Deadlock detection for a class of communicating finite-state machines. IEEE Trans. Commun. COM-30(12), 2514?2518 (1982)","journal-title":"IEEE Trans. Commun. COM"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0020-0190(83)90105-9","volume":"17","author":"Y.T. Yu","year":"1983","unstructured":"Yu, Y.T., Gouda, M.G.: Unboundedness detection for a class of communicating finite state machines. Inf. Process. Lett.17, 235?240 (1983)","journal-title":"Inf. Process. Lett."}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01185558.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01185558\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01185558","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T21:15:39Z","timestamp":1586121339000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01185558"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,6]]},"references-count":14,"journal-issue":{"issue":"6-7","published-print":{"date-parts":[[1992,6]]}},"alternative-id":["BF01185558"],"URL":"https:\/\/doi.org\/10.1007\/bf01185558","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,6]]}}}