{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T19:25:16Z","timestamp":1766085916726},"reference-count":52,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,4,1]],"date-time":"2001-04-01T00:00:00Z","timestamp":986083200000},"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":4490,"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":[[2001,4]]},"DOI":"10.1016\/s0304-3975(00)00099-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:51:54Z","timestamp":1027619514000},"page":"3-21","source":"Crossref","is-referenced-by-count":8,"title":["Pushdown automata, multiset automata, and Petri nets"],"prefix":"10.1016","volume":"256","author":[{"given":"Yoram","family":"Hirshfeld","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Faron","family":"Moller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00099-2_BIB1","first-page":"94","volume":"vol. 259","author":"Baeten","year":"1987"},{"key":"10.1016\/S0304-3975(00)00099-2_BIB2","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1145\/174130.174141","article-title":"Decidability of bisimulation equivalence for processes generating context-free languages","volume":"40","author":"Baeten","year":"1993","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(00)00099-2_BIB3","first-page":"143","article-title":"On formal properties of simple phrase structure grammars","volume":"14","author":"Bar-Hillel","year":"1961","journal-title":"Z. Phonetik, Sprachwissenschaft Kommunikationsforschung"},{"key":"10.1016\/S0304-3975(00)00099-2_BIB4","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0304-3975(85)90088-X","article-title":"Algebra of communicating processes with abstraction","volume":"37","author":"Bergstra","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00099-2_BIB5","first-page":"423","volume":"vol. 969","author":"Burkart","year":"1995"},{"key":"10.1016\/S0304-3975(00)00099-2_BIB6","first-page":"247","volume":"vol. 1119","author":"Burkart","year":"1996"},{"key":"10.1016\/S0304-3975(00)00099-2_BIB7","doi-asserted-by":"crossref","unstructured":"O. Burkart, Javier Esparza, More infinite results, Proc. Infinity\u201997, Electronic Notes in Theoretical Computer Science, vol. 5, 1997.","DOI":"10.1016\/S1571-0661(05)80680-2"},{"issue":"4","key":"10.1016\/S0304-3975(00)00099-2_BIB8","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1051\/ita\/1990240403391","article-title":"Graphes canoniques des graphes alg\u00e9briques","volume":"24","author":"Caucal","year":"1990","journal-title":"Inform. Th\u00e9or. Appl. (RAIRO)"},{"key":"10.1016\/S0304-3975(00)00099-2_BIB9","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0304-3975(92)90278-N","article-title":"On the regular structure of prefix rewriting","volume":"106","author":"Caucal","year":"1992","journal-title":"J. Theoret. Comput. Sci."},{"issue":"1","key":"10.1016\/S0304-3975(00)00099-2_BIB10","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1051\/ita\/1993270100231","article-title":"A fast algorithm to decide on the equivalence of stateless DPDA","volume":"27","author":"Caucal","year":"1993","journal-title":"Inform. Th\u00e9or. Appl. (RAIRO)"},{"key":"10.1016\/S0304-3975(00)00099-2_BIB11","first-page":"311","volume":"vol. 484","author":"Caucal","year":"1990"},{"key":"10.1016\/S0304-3975(00)00099-2_BIB12","unstructured":"S. Christensen, Decidability and decomposition in process algebras, Ph.D. Thesis ECS-LFCS-93-278, Department of Computer Science, University of Edinburgh, 1993."},{"key":"10.1016\/S0304-3975(00)00099-2_BIB13","doi-asserted-by":"crossref","unstructured":"S. Christensen, Y. Hirshfeld, F. Moller, Decomposability, decidability and axiomatisability for bisimulation equivalence on basic parallel processes, Proc. LICS\u201993, 1993, pp. 386\u2013396.","DOI":"10.1109\/LICS.1993.287569"},{"key":"10.1016\/S0304-3975(00)00099-2_BIB14","first-page":"143","volume":"vol. 715","author":"Christensen","year":"1993"},{"key":"10.1016\/S0304-3975(00)00099-2_BIB15","first-page":"138","volume":"vol. 630","author":"Christensen","year":"1992"},{"issue":"2","key":"10.1016\/S0304-3975(00)00099-2_BIB16","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1006\/inco.1995.1129","article-title":"Bisimulation equivalence is decidable for all context-free processes","volume":"121","author":"Christensen","year":"1995","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(00)00099-2_BIB17","doi-asserted-by":"crossref","first-page":"413","DOI":"10.2307\/2370405","article-title":"Finiteness of the odd perfect and primitive abundant numbers with distinct factors","volume":"35","author":"Dickson","year":"1913","journal-title":"Amer. J. Math."},{"key":"10.1016\/S0304-3975(00)00099-2_BIB18","first-page":"278","volume":"vol. 458","author":"van Glabbeek","year":"1990"},{"key":"10.1016\/S0304-3975(00)00099-2_BIB19","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0020-0190(92)90142-I","article-title":"A short proof of the decidability of bisimulation for normed BPA processes","volume":"42","author":"Groote","year":"1991","journal-title":"Inform. Process. Lett."},{"issue":"2","key":"10.1016\/S0304-3975(00)00099-2_BIB20","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1006\/inco.1994.1101","article-title":"Undecidable equivalences for basic process algebra","volume":"115","author":"Groote","year":"1994","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(00)00099-2_BIB21","first-page":"165","volume":"vol. 832","author":"Hirshfeld","year":"1993"},{"key":"10.1016\/S0304-3975(00)00099-2_BIB22","doi-asserted-by":"crossref","unstructured":"Y. Hirshfeld, Unpublished, 1998.","DOI":"10.1176\/ajp.155.11.1619a"},{"key":"10.1016\/S0304-3975(00)00099-2_BIB23","doi-asserted-by":"crossref","unstructured":"Y. Hirshfeld, M. Jerrum, F. Moller, A polynomial-time algorithm for deciding equivalence of normed context-free processes, Proc. FOCS\u201994 1994, pp. 623\u2013631.","DOI":"10.1109\/SFCS.1994.365729"},{"key":"10.1016\/S0304-3975(00)00099-2_BIB24","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0304-3975(95)00064-X","article-title":"A polynomial algorithm for deciding bisimilarity of normed context-free processes","volume":"158","author":"Hirshfeld","year":"1996","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00099-2_BIB25","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1017\/S0960129500000992","article-title":"A polynomial algorithm for deciding bisimulation equivalence of normed basic parallel processes","volume":"6","author":"Hirshfeld","year":"1996","journal-title":"Math. Struct. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00099-2_BIB26","first-page":"48","volume":"vol. 836","author":"Hirshfeld","year":"1994"},{"key":"10.1016\/S0304-3975(00)00099-2_BIB27","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/S0304-3975(00)00099-2_BIB28","first-page":"454","volume":"vol. 789","author":"H\u00fcttel","year":"1994"},{"key":"10.1016\/S0304-3975(00)00099-2_BIB29","doi-asserted-by":"crossref","unstructured":"H. H\u00fcttel, C. Stirling, Actions speak louder than words: proving bisimilarity for context-free processes, Proc. LICS\u201991 1991, pp. 376\u2013386.","DOI":"10.1109\/LICS.1991.151661"},{"key":"10.1016\/S0304-3975(00)00099-2_BIB30","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0304-3975(92)00078-6","article-title":"Deciding bisimilarity of normed context-free processes is in \u03a32P","volume":"123","author":"Huynh","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00099-2_BIB31","first-page":"581","volume":"vol. 775","author":"Jan\u010dar","year":"1993"},{"key":"10.1016\/S0304-3975(00)00099-2_BIB32","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0304-3975(95)00037-W","article-title":"Undecidability of bisimilarity for Petri nets and related problems","volume":"148","author":"Jan\u010dar","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00099-2_BIB33","first-page":"478","volume":"vol. 1099","author":"Jan\u010dar","year":"1996"},{"key":"10.1016\/S0304-3975(00)00099-2_BIB34","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1006\/jcss.1999.1643","article-title":"Petri nets and regular processes","volume":"59","author":"Jan\u010dar","year":"1999","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(00)00099-2_BIB35","doi-asserted-by":"crossref","unstructured":"P. Jan\u010dar, F. Moller, Checking regular properties of Petri nets, Proc. CONCUR\u201995, Lecture Notes in Computer Science, vol. 962, 1995, pp. 348\u2013362.","DOI":"10.1007\/3-540-60218-6_26"},{"key":"10.1016\/S0304-3975(00)00099-2_BIB36","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0890-5401(90)90025-D","article-title":"CCS expressions, finite-state processes and three problems of equivalence","volume":"86","author":"Kanellakis","year":"1990","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(00)00099-2_BIB37","doi-asserted-by":"crossref","unstructured":"A. Korenjak, J. Hopcroft, Simple deterministic languages, Proc. 7th IEEE Switching and Automata Theory Conference, 1966, pp. 36\u201346.","DOI":"10.1109\/SWAT.1966.22"},{"key":"10.1016\/S0304-3975(00)00099-2_BIB38","doi-asserted-by":"crossref","unstructured":"R. Milner, A Calculus of Communicating Systems, Lecture Notes in Computer Science, vol. 92, 1980.","DOI":"10.1007\/3-540-10235-3"},{"key":"10.1016\/S0304-3975(00)00099-2_BIB39","series-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"key":"10.1016\/S0304-3975(00)00099-2_BIB40","first-page":"226","article-title":"Unique decomposition of processes","volume":"41","author":"Milner","year":"1990","journal-title":"Bull. European Assoc. Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00099-2_BIB41","article-title":"Unique decomposition of processes","volume":"107","author":"Milner","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00099-2_BIB42","first-page":"195","volume":"vol. 1119","author":"Moller","year":"1996"},{"key":"10.1016\/S0304-3975(00)00099-2_BIB43","doi-asserted-by":"crossref","unstructured":"E.F. Moore, Gedanken experiments on sequential machines, in: Automata Studies, C.E. Shannon, J.McCarthy (eds), Princeton University Press, 1956, pp. 129\u2013153.","DOI":"10.1515\/9781400882618-006"},{"key":"10.1016\/S0304-3975(00)00099-2_BIB44","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0304-3975(85)90087-8","article-title":"The theory of ends, pushdown automata and second order logic","volume":"37","author":"Muller","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00099-2_BIB45","doi-asserted-by":"crossref","first-page":"937","DOI":"10.1137\/0216062","article-title":"Three partition refinement algorithms","volume":"16","author":"Paige","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(00)00099-2_BIB46","first-page":"168","volume":"vol. 104","author":"Park","year":"1981"},{"key":"10.1016\/S0304-3975(00)00099-2_BIB47","series-title":"Petri Net Theory and the Modelling of Systems","author":"Peterson","year":"1981"},{"key":"10.1016\/S0304-3975(00)00099-2_BIB48","doi-asserted-by":"crossref","unstructured":"G. S\u00e9nizergues, The equivalence problem for deterministic pushdown automata is decidable, Proc. ICALP\u201997, Lecture Notes in Computer Science, vol. 1256, Springer, Berlin, 1997, pp. 671\u2013681.","DOI":"10.1007\/3-540-63165-8_221"},{"key":"10.1016\/S0304-3975(00)00099-2_BIB49","unstructured":"G. S\u00e9nizergues, L(A)=L(B)? Technical Report, LaBRI, Universit\u00e9 Bordeaux I, Report Nr.1161-97, 1997."},{"key":"10.1016\/S0304-3975(00)00099-2_BIB50","first-page":"1","volume":"vol. 962","author":"Stirling","year":"1995"},{"key":"10.1016\/S0304-3975(00)00099-2_BIB51","first-page":"217","volume":"vol. 1119","author":"Stirling","year":"1996"},{"issue":"3","key":"10.1016\/S0304-3975(00)00099-2_BIB52","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/0022-0000(81)90067-2","article-title":"Petri nets and regular languages","volume":"23","author":"Valk","year":"1981","journal-title":"J. Comput. System Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500000992?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500000992?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,28]],"date-time":"2020-01-28T13:14:00Z","timestamp":1580217240000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500000992"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,4]]},"references-count":52,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,4]]}},"alternative-id":["S0304397500000992"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00099-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,4]]}}}