{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T05:25:23Z","timestamp":1767677123677},"reference-count":30,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3827,"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":[[2003,3]]},"DOI":"10.1016\/s0304-3975(02)00646-1","type":"journal-article","created":{"date-parts":[[2003,3,25]],"date-time":"2003-03-25T11:52:06Z","timestamp":1048593126000},"page":"337-354","source":"Crossref","is-referenced-by-count":58,"title":["Undecidable problems in unreliable computations"],"prefix":"10.1016","volume":"297","author":[{"given":"Richard","family":"Mayr","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(02)00646-1_BIB1","series-title":"10th Internat. Conf. on Computer Aided Verification (CAV\u201998)","article-title":"On-the-fly analysis of systems with unbounded, lossy fifo channels","volume":"Vol. 1427","author":"Abdulla","year":"1998"},{"key":"10.1016\/S0304-3975(02)00646-1_BIB2","doi-asserted-by":"crossref","unstructured":"P. Abdulla, B. Jonsson, Verifying programs with unreliable channels, in: LICS\u201993, IEEE, New York, 1993.","DOI":"10.1109\/LICS.1993.287591"},{"issue":"1","key":"10.1016\/S0304-3975(02)00646-1_BIB3","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1006\/inco.1996.0083","article-title":"Undecidable verification problems for programs with unreliable channels","volume":"130","author":"Abdulla","year":"1996","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(02)00646-1_BIB4","doi-asserted-by":"crossref","unstructured":"A. Bouajjani, P. Habermehl, Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations, in: Proc. ICALP\u201997, Lecture Notes in Computer Science, Vol. 1256, Springer, Berlin, 1997.","DOI":"10.1007\/3-540-63165-8_211"},{"key":"10.1016\/S0304-3975(02)00646-1_BIB5","doi-asserted-by":"crossref","unstructured":"A. Bouajjani, R. Mayr, Model checking lossy vector addition systems, in: Proc. STACS\u201999, Lecture Notes in Computer Science, Vol. 1563, Springer, Berlin, 1999.","DOI":"10.1007\/3-540-49116-3_30"},{"issue":"1","key":"10.1016\/S0304-3975(02)00646-1_BIB6","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1006\/inco.1996.0003","article-title":"Unreliable channels are easier to verify than perfect channels","volume":"124","author":"C\u00e9c\u00e9","year":"1996","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(02)00646-1_BIB7","unstructured":"S. Christensen, Decidability and decomposition in process algebras, Ph.D. Thesis, Edinburgh University, 1993."},{"key":"10.1016\/S0304-3975(02)00646-1_BIB8","series-title":"Proc. CONCUR 93","article-title":"Bisimulation equivalence is decidable for basic parallel processes","volume":"Vol. 715","author":"Christensen","year":"1993"},{"key":"10.1016\/S0304-3975(02)00646-1_BIB9","first-page":"52","article-title":"Design and Synthesis of Synchronization Skeletons Using Branching Time Temporal Logic","volume":"Vol. 131","author":"Clarke","year":"1981"},{"key":"10.1016\/S0304-3975(02)00646-1_BIB10","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(02)00646-1_BIB11","unstructured":"C. Dufourd, R\u00e9seaux de Petri avec Reset\/Transfert: D\u00e9cidabilit\u00e9 et ind\u00e9cidabilit\u00e9, Ph.D. Thesis, ENS de Cachan, 1998."},{"key":"10.1016\/S0304-3975(02)00646-1_BIB12","doi-asserted-by":"crossref","unstructured":"C. Dufourd, A. Finkel, Ph. Schnoebelen, Reset nets between decidability and undecidability, in: Proc. ICALP\u201998, Lecture Notes in Computer Science, Vol. 1443, Springer, Berlin, 1998.","DOI":"10.1007\/BFb0055044"},{"key":"10.1016\/S0304-3975(02)00646-1_BIB13","doi-asserted-by":"crossref","unstructured":"C. Dufourd, P. Jan\u010dar, Ph. Schnoebelen, Boundedness of reset P\/T nets, in: Proc. ICALP\u201999, Lecture Notes in Computer Science, Vol. 1644, Springer, Berlin, 1999.","DOI":"10.1007\/3-540-48523-6_27"},{"key":"10.1016\/S0304-3975(02)00646-1_BIB14","unstructured":"E.A. Emerson, Temporal and modal logic, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science : Vol. B, Formal Models and Semantics, Elsevier, Amsterdam, 1994."},{"key":"10.1016\/S0304-3975(02)00646-1_BIB15","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/s002360050074","article-title":"Decidability of model checking for infinite-state concurrent systems","volume":"34","author":"Esparza","year":"1997","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(02)00646-1_BIB16","doi-asserted-by":"crossref","unstructured":"J. Esparza, A. Finkel, R. Mayr, On the verification of broadcast protocols, in: Proc. LICS\u201999, IEEE, New York, 1999.","DOI":"10.1109\/LICS.1999.782630"},{"key":"10.1016\/S0304-3975(02)00646-1_BIB17","doi-asserted-by":"crossref","unstructured":"J. Esparza, A. Kiehn, On the model checking problem for branching time logics and basic parallel processes, in: CAV\u201995, Lecture Notes in Computer Science, Vol. 939, Springer, Berlin, 1995, pp. 353\u2013366.","DOI":"10.1007\/3-540-60045-0_62"},{"key":"10.1016\/S0304-3975(02)00646-1_BIB18","doi-asserted-by":"crossref","unstructured":"M. Hennessy, R. Milner, On Observing Nondeterminism and Concurrency, Lecture Notes in Computer Science, Vol. 85, 1980, pp. 295\u2013309.","DOI":"10.1007\/3-540-10003-2_79"},{"key":"10.1016\/S0304-3975(02)00646-1_BIB19","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1145\/2455.2460","article-title":"Algebraic laws for nondeterminism and concurrency","volume":"32","author":"Hennessy","year":"1985","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0304-3975(02)00646-1_BIB20","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1017\/S0960129500000992","article-title":"A polynomial-time algorithm for deciding bisimulation equivalence of normed basic parallel processes","volume":"6","author":"Hirshfeld","year":"1996","journal-title":"J. Math. Struct. Comput. Sci."},{"key":"10.1016\/S0304-3975(02)00646-1_BIB21","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","article-title":"Results on the propositional \u03bc-calculus","volume":"27","author":"Kozen","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(02)00646-1_BIB22","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1137\/0213029","article-title":"An algorithm for the general Petri net reachability problem","volume":"13","author":"Mayr","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(02)00646-1_BIB23","doi-asserted-by":"crossref","unstructured":"R. Mayr, Weak bisimulation and model checking for basic parallel processes, in: Foundations of Software Technology and Theoretical Computer Science (FST& TCS\u201996) Lecture Notes in Computer Science, Vol. 1180, Springer, Berlin, 1996.","DOI":"10.1007\/3-540-62034-6_40"},{"key":"10.1016\/S0304-3975(02)00646-1_BIB24","doi-asserted-by":"crossref","unstructured":"R. Mayr, On the complexity of bisimulation problems for basic parallel processes, in: Proc. ICALP 2000, Lecture Notes in Computer Science, Vol. 1853, Springer, Berlin, 2000.","DOI":"10.1007\/3-540-45022-X_29"},{"key":"10.1016\/S0304-3975(02)00646-1_BIB25","series-title":"Computation: Finite and Infinite Machines","author":"Minsky","year":"1967"},{"key":"10.1016\/S0304-3975(02)00646-1_BIB26","doi-asserted-by":"crossref","unstructured":"F. Moller, Infinite results, in: U. Montanari, V. Sassone (Eds.), Proc. CONCUR\u201996, Lecture Notes in Computer Science, Vol. 1119, Springer, Berlin, 1996.","DOI":"10.1007\/3-540-61604-7_56"},{"key":"10.1016\/S0304-3975(02)00646-1_BIB27","series-title":"Petri Net Theory and the Modeling of Systems","author":"Peterson","year":"1981"},{"key":"10.1016\/S0304-3975(02)00646-1_BIB28","doi-asserted-by":"crossref","unstructured":"A. Pnueli, The temporal logic of programs, in: FOCS\u201977, IEEE, New York, 1977.","DOI":"10.1109\/SFCS.1977.32"},{"key":"10.1016\/S0304-3975(02)00646-1_BIB29","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/BF00290732","article-title":"On some variants of Post's correspondence problem","volume":"19","author":"Ruohonen","year":"1983","journal-title":"Acta Inform"},{"issue":"1","key":"10.1016\/S0304-3975(02)00646-1_BIB30","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0890-5401(92)90059-O","article-title":"A unified approach for deciding the existence of certain Petri net paths","volume":"96","author":"Yen","year":"1992","journal-title":"Inform. and Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502006461?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502006461?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T05:29:19Z","timestamp":1553664559000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397502006461"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":30,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["S0304397502006461"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00646-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}