{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T17:38:54Z","timestamp":1720201134928},"reference-count":7,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1985,1,1]],"date-time":"1985-01-01T00:00:00Z","timestamp":473385600000},"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":10424,"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":[[1985]]},"DOI":"10.1016\/0304-3975(85)90133-1","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T00:04:58Z","timestamp":1052784298000},"page":"107-121","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["On a fast decomposition method in some models of concurrent computations"],"prefix":"10.1016","volume":"39","author":[{"given":"Lutz","family":"Priese","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(85)90133-1_BIB1","series-title":"Tech. Rept. No. 116","article-title":"Asynchronous modular systems","author":"Banning","year":"1973"},{"key":"10.1016\/0304-3975(85)90133-1_BIB2","series-title":"Logic and Machines: Decision Problems and Complexity","first-page":"198","article-title":"Modular decomposition of automata","volume":"171","author":"Br\u00fcggemann","year":"1984"},{"key":"10.1016\/0304-3975(85)90133-1_BIB3","article-title":"Petri net languages","author":"Hack","year":"1975"},{"key":"10.1016\/0304-3975(85)90133-1_BIB4","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/T-C.1974.223773","article-title":"Towards a theory of universal speed-independent modules","volume":"C23","author":"Keller","year":"1974","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0304-3975(85)90133-1_BIB5","series-title":"Parallel Processing Systems","first-page":"339","article-title":"Notes on VLSI computation","author":"Kung","year":"1982"},{"key":"10.1016\/0304-3975(85)90133-1_BIB6","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\/0304-3975(85)90133-1_BIB7","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0304-3975(83)90113-5","article-title":"Automata and concurrency","volume":"25","author":"Priese","year":"1983","journal-title":"Theoret. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397585901331?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397585901331?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T08:52:55Z","timestamp":1553158375000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397585901331"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"references-count":7,"alternative-id":["0304397585901331"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(85)90133-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1985]]}}}