{“状态”:“确定”,“消息类型”:“工作”,“信息版本”:“1.0.0”,“邮件”:{“索引”:{-“日期-部件”:[[2023,2,20]],“日期-时间”:“2023-02-20T11:30:21Z”,“时间戳”:1676892621177},“引用-计数”:10,“发布者”:“爱思唯尔BV”,“许可证”:[{“开始”:{“日期-零件”:[[1986,1]],”“日期-时刻”:“1986-01-01T00:00:00Z“,”timestamp“:504921600000},”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”:10059,“URL“https:\\/www.elssevier.com/open-access\/user”许可证\/1.0\/“}],”内容域“:{”域“:[],“crossmark-restriction”:false},“short-container-title”:[“Theoryal Computer Science”],“published-print”:{“date-parts”:[[1986]]},”DOI“:”10.1016\/0304-3975(86)90169-6“,”type“:”journal-article“,”created“:“交叉参考”,“is-referenced-by-count”:17,“title”:[“On the finited containment problem for Petri nets”],“prefix”:“10.1016”,“volume”:“43”,“author”:[{“given”:”P.“,“family”:“Clote”,“sequence”:“first”,“affiliation”:[]}],“member”:“78”,“reference”:[[{”key“10.1016\/0304-3975(86)90169-6_bib1”,“series-timele”:“IEEE计算机科学基础研讨会”,“首页”:“81”,“文章-标题”:“丢番图复杂性”,“作者”:“Adleman”,“年份”:“1976”},{“关键”:“10.1016\/0304-3975(86)90169-6_bib2”,“首页面”:“425”,“论文-标题”:“HNN群、向量加法系统和Peano算术子系统决策问题之间的可约性”,“卷”:“89”,“作家”:“Anshel”,“年”:“1983”}、{“键”:“10.1016\/0304-3975(86)90169-6_bib3”,“series-title”:“拉姆齐理论”,“author”:“Graham”,“year”:“1980”},{“key”:“10.101-/0304-2975(86:“2”,“作者”:“黑客”,“年份”:“1976”,“journal-title”:“Theoret.Compute.Sci.”},{“issue”:“2”,“key”:“10.1016\/0304-3975(86)90169-6_bib5”,“doi-asserted-by”:“crossref”,“first page”:”147“,“doi”:“101016\/S0022-0000(69)80011-5”,”article-title“:”并行程序模式:并行计算的数学模型“,”volume“:”3“,”author“:”Karp“,”“year”:“1969“,”新闻标题“:”J。计算。系统科学。“},{”issue“:”2“,”key“:”10.1016\/0304-3975(86)90169-6_bib6“,”doi-asserted-by“:”crossref“,”first-page“:”267“,”doi“:”10.2307\/2006985“,”article-title“:”Ramsey函数快速增长“,”volume“:“113”,“author”:“Ketonen”,“year”:“1981”,“journal-title”:“Ann.of Math.”},”{“key”:“10.1016\/030 4-3975(86)90169-6_bib7“,”doi-asserted-by“:”crossref“,”第一页“:”173“,”DOI“:”10.1016\/0304-3975(84)90029-X“,”article-title“:”Petri网和大型有限集“,”volume“:”32“,”author“:”McAloon“,”year“:”1984“,”journal-title”:“Theoret。计算。科学。“},{”issue“:”3“,”key“:”10.1016\/0304-3975(86)90169-6_bib8“,”doi-asserted-by“:”crossref“,”first page“:“561”,”doi“:”101145\/32261.322271“,”article-title“:”Petri网有限包容问题的复杂性“,”volume“::”28“,”author“:”Mayr“,”year“:”1981“,”journal-title:“J.ACM”},“key”:“10.1016\/0304-3975(86)90169-6_bib9“,”series-title“:”程序。《代数与算术模型理论》,“首页”:“312”,“文章标题”:“算术模型中的切割层次”,“卷”:“834”,“作者”:“巴黎”,“年份”:“1980”},{“键”:“10.1016\/0304-3975(86)90169-6_bib10”,“doi-asserted-by”:“crossref”,“首版”:“223”,“doi”:“1016\/030-3975(78)90036-1”,“论文标题”:向量加法系统的覆盖和有界问题”,“卷”:“6”,“作者”:“Rackoff”,“年份”:“1978”,“期刊标题”:“理论。计算。科学。“}],”container-title“:[”Theoryal Computer Science“],”original-title”:[],”language“:”en“,”link“:[{”URL“:”https:\\/api.elsevier.com/content\/article\/PII:0304397586901696?httpAccept=text\/xml“,”content-type“:”text\/xml“,”content-version“:”vor“,”intended-application“:”text-mining“},”{“URL”:“”https:\/\/api.elsevier.com/content\/article\/PII:0304397586901696?httpAccept=text\/plain“,”content-type“:”text\/prain“,“content-version”:“vor”,“intended-application”:“text-mining”}],“deposed”:{“date-parts”:[[2019,3,21]],“date-time”:“2019-03-21T12:53:09Z”,“timestamp”:1553172789000},“score”:1,“resource”:{primary“URL”:“https:\\/linkinghub.elsevier.com/retrieve\/piii\/03043979 586901696“}},”副标题“:[],”shorttitle“:[],”issued“:{”date-parts“:[[1986]]},”references-count“:10,”alternative-id“:[”0304397586901696“],”URL“:”http://\/dx.doi.org\/10.1016\/0304-3975(86)90169-6“,”relationship“:{},“ISSN”:[“0304-3975”],“ISSN-type”:[{“value”:“0304-975”,“type”:“print”}],“subject”:【】,“已发布”:{“日期-部分”:[[1986]]}}