{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T13:08:09Z","timestamp":1762520889703},"reference-count":14,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1983,8,1]],"date-time":"1983-08-01T00:00:00Z","timestamp":428544000000},"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":10943,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1983,8]]},"DOI":"10.1016\/0022-0000(83)90029-6","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T07:01:00Z","timestamp":1070521260000},"page":"51-76","source":"Crossref","is-referenced-by-count":218,"title":["A method for stepwise refinement and abstraction of Petri nets"],"prefix":"10.1016","volume":"27","author":[{"given":"Ichiro","family":"Suzuki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tadao","family":"Murata","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"No. 12","key":"10.1016\/0022-0000(83)90029-6_BIB1","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1109\/MC.1979.1658580","article-title":"Putting Petri nets to work","volume":"12","author":"Agerwala","year":"1979","journal-title":"Computer"},{"key":"10.1016\/0022-0000(83)90029-6_BIB2","series-title":"Proc. of 15th Design Automation Conf.","first-page":"305","article-title":"A synthesis rule for concurrent systems.","author":"Agerwala","year":"1978"},{"key":"10.1016\/0022-0000(83)90029-6_BIB3","series-title":"Net Theory and Applications","year":"1980"},{"key":"10.1016\/0022-0000(83)90029-6_BIB4","series-title":"Decidability Questions for Petri Nets","author":"Hack","year":"1976"},{"key":"10.1016\/0022-0000(83)90029-6_BIB5","series-title":"Procs. of the 17th Allerton Conf. on Comm., Control and Computing","first-page":"387","article-title":"Additional transformations of live and safe marked graphs","author":"Johnsonbaugh","year":"1979"},{"key":"10.1016\/0022-0000(83)90029-6_BIB6","series-title":"Procs. of the 1980 IEEE International Symposium on Circuits and Systems","first-page":"342","article-title":"Analysis of resource requirements in marked graph computation models","author":"Johnsonbaugh","year":"1980"},{"key":"10.1016\/0022-0000(83)90029-6_BIB7","series-title":"Proc. of the 14th Annual ACM Symp. on Theory of Computing","first-page":"267","article-title":"Decidability of reachability in vector addition systems","author":"Kosaraju","year":"1982"},{"key":"10.1016\/0022-0000(83)90029-6_BIB8","series-title":"Procs. of the 13th Annual ACM Symp. on Theory of Computing","first-page":"238","article-title":"An algorithm for the general Petri net reachability problem","author":"Mayr","year":"1981"},{"issue":"No. 1","key":"10.1016\/0022-0000(83)90029-6_BIB9","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0016-0032(80)90060-5","article-title":"Relevance of network theory to models of distributed\/parallel processing","volume":"310","author":"Murata","year":"1980","journal-title":"J. Franklin Inst."},{"issue":"No. 6","key":"10.1016\/0022-0000(83)90029-6_BIB10","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1109\/TSE.1980.230802","article-title":"Synthesis of decision-free concurrent systems for prescribed resources and performance","volume":"SE-6","author":"Murata","year":"1980","journal-title":"IEEE Trans. Software Engrg."},{"issue":"No. 1","key":"10.1016\/0022-0000(83)90029-6_BIB11","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1109\/TCS.1980.1084711","article-title":"Reduction and expansion of live and safe marked graphs","volume":"CAS-27","author":"Murata","year":"1980","journal-title":"IEEE Trans. Circuits and Systems"},{"issue":"No. 3","key":"10.1016\/0022-0000(83)90029-6_BIB12","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1145\/356698.356702","article-title":"Petri nets","volume":"9","author":"Peterson","year":"1977","journal-title":"Comput. Surveys"},{"key":"10.1016\/0022-0000(83)90029-6_BIB13","series-title":"Proc. of the 18th Allerton Conf. on Comm., Control and Computing","first-page":"497","article-title":"Marked graph transformations by stepwise transition refinements","author":"Suzuki","year":"1980"},{"key":"10.1016\/0022-0000(83)90029-6_BIB14","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0022-0000(79)90050-3","article-title":"Analysis of Petri nets by stepwise refinements","volume":"18","author":"Valette","year":"1979","journal-title":"J. Comput. System Sci."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000083900296?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000083900296?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T08:51:00Z","timestamp":1550307060000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000083900296"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,8]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1983,8]]}},"alternative-id":["0022000083900296"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(83)90029-6","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1983,8]]}}}