乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,10]],"date-time":"2024-08-10T09:48:07Z","timestamp":1723283287233},"reference-count":22,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2013,7,1]],"date-time":"2013-07-01T00:00:00Z","timestamp":1372636800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2017,7,1]],"date-time":"2017-07-01T00:00:00Z","timestamp":1498867200000},"content-version":"vor","delay-in-days":1461,"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":[[2013,7]]},"DOI":"10.1016\/j.tcs.2013.04.028","type":"journal-article","created":{"date-parts":[[2013,5,14]],"date-time":"2013-05-14T22:01:41Z","timestamp":1368568901000},"page":"66-79","source":"Crossref","is-referenced-by-count":7,"special_numbering":"C","title":["Computing the reveals relation in occurrence nets"],"prefix":"10.1016","volume":"493","author":[{"given":"Stefan","family":"Haar","sequence":"first","affiliation":[]},{"given":"Christian","family":"Kern","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"Schwoon","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2013.04.028_br000005","series-title":"Petri Net Theory and the Modeling of Systems","author":"Peterson","year":"1981"},{"issue":"4","key":"10.1016\/j.tcs.2013.04.028_br000010","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1109\/5.24143","article-title":"Petri nets: properties, analysis and applications","volume":"77","author":"Murata","year":"1989","journal-title":"Proc. IEEE"},{"key":"10.1016\/j.tcs.2013.04.028_br000015","series-title":"Proc. CAV","first-page":"164","article-title":"Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits","volume":"vol. 663","author":"McMillan","year":"1992"},{"issue":"3","key":"10.1016\/j.tcs.2013.04.028_br000020","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1023\/A:1014746130920","article-title":"An improvement of McMillan\u2019s unfolding algorithm","volume":"20","author":"Esparza","year":"2002","journal-title":"Form. Method. Syst. Des."},{"issue":"2","key":"10.1016\/j.tcs.2013.04.028_br000025","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/s00236-003-0122-y","article-title":"Canonical prefixes of Petri net unfoldings","volume":"40","author":"Khomenko","year":"2003","journal-title":"Acta Inform."},{"issue":"3","key":"10.1016\/j.tcs.2013.04.028_br000030","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/s10626-007-0016-1","article-title":"Partial order techniques for distributed discrete event systems: why you cannot avoid using them","volume":"17","author":"Fabre","year":"2007","journal-title":"Discrete Event Dyn. Syst."},{"key":"10.1016\/j.tcs.2013.04.028_br000035","series-title":"Advances in Petri Nets 1986, Part I on Petri Nets: Central Models and their Properties","first-page":"338","article-title":"Synchronic distance","author":"Goltz","year":"1987"},{"key":"10.1016\/j.tcs.2013.04.028_br000040","series-title":"Petri Nets: An Introduction","volume":"vol. 4","author":"Reisig","year":"1985"},{"key":"10.1016\/j.tcs.2013.04.028_br000045","doi-asserted-by":"crossref","unstructured":"W. Zhao, Y. Huang, C.-Y. Yuan, Synchronic distance based workflow logic specification, in: Proc. HPCC, 2008, pp. 819\u2013824.","DOI":"10.1109\/HPCC.2008.48"},{"key":"10.1016\/j.tcs.2013.04.028_br000050","series-title":"Proc. CDC","first-page":"1886","article-title":"Unfold and cover: qualitative diagnosability for Petri nets","author":"Haar","year":"2007"},{"issue":"10","key":"10.1016\/j.tcs.2013.04.028_br000055","doi-asserted-by":"crossref","first-page":"2310","DOI":"10.1109\/TAC.2010.2063490","article-title":"Types of asynchronous diagnosability and the reveals-relation in occurrence nets","volume":"55","author":"Haar","year":"2010","journal-title":"IEEE Trans. Automat. Control"},{"key":"10.1016\/j.tcs.2013.04.028_br000060","series-title":"Proceedings of the 11th International Conference on Application of Concurrency to System Design","first-page":"44","article-title":"Building tight occurrence nets from reveals relations","author":"Balaguer","year":"2011"},{"key":"10.1016\/j.tcs.2013.04.028_br000065","series-title":"Proc. CDC","first-page":"1248","article-title":"Qualitative diagnosability of labeled Petri nets revisited","author":"Haar","year":"2009"},{"issue":"6","key":"10.1016\/j.tcs.2013.04.028_br000070","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1007\/BF01463946","article-title":"Branching processes of Petri nets","volume":"28","author":"Engelfriet","year":"1991","journal-title":"Acta Inform."},{"issue":"7","key":"10.1016\/j.tcs.2013.04.028_br000075","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1016\/j.ic.2009.12.003","article-title":"Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces","volume":"208","author":"Gastin","year":"2010","journal-title":"Inform. Comput."},{"issue":"11","key":"10.1016\/j.tcs.2013.04.028_br000080","doi-asserted-by":"crossref","first-page":"1597","DOI":"10.1016\/j.ic.2006.07.002","article-title":"Pure future local temporal logics are expressively complete for Mazurkiewicz traces","volume":"204","author":"Diekert","year":"2006","journal-title":"Inform. Comput."},{"issue":"1\u20132","key":"10.1016\/j.tcs.2013.04.028_br000085","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1016\/j.tcs.2006.01.035","article-title":"From local to global temporal logics over Mazurkiewicz traces","volume":"356","author":"Diekert","year":"2006","journal-title":"Theoret. Comput. Sci."},{"issue":"5","key":"10.1016\/j.tcs.2013.04.028_br000090","doi-asserted-by":"crossref","first-page":"714","DOI":"10.1109\/TAC.2003.811249","article-title":"Diagnosis of asynchronous discrete-event systems: a net unfolding approach","volume":"48","author":"Benveniste","year":"2003","journal-title":"IEEE Trans. Automat. Control"},{"issue":"1","key":"10.1016\/j.tcs.2013.04.028_br000095","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s10626-005-5238-5","article-title":"Distributed monitoring of concurrent and asynchronous systems","volume":"15","author":"Fabre","year":"2005","journal-title":"Discrete Event Dyn. Syst."},{"key":"10.1016\/j.tcs.2013.04.028_br000100","series-title":"Lectures on Petri Nets I: Basic Models. Advances in Petri Nets","first-page":"374","article-title":"Decidability and complexity of Petri net problems \u2014 an introduction","volume":"vol. 1491","author":"Esparza","year":"1998"},{"key":"10.1016\/j.tcs.2013.04.028_br000105","series-title":"Computer Aided Verification","first-page":"440","article-title":"The PEP tool","volume":"vol. 1254","author":"Grahlmann","year":"1997"},{"key":"10.1016\/j.tcs.2013.04.028_br000110","unstructured":"S. Schwoon, The Mole tool. http:\/\/www.lsv.ens-cachan.fr\/~schwoon\/tools\/mole\/."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397513003368?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397513003368?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,10,16]],"date-time":"2018-10-16T01:23:02Z","timestamp":1539652982000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397513003368"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7]]},"references-count":22,"alternative-id":["S0304397513003368"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2013.04.028","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2013,7]]}}}