{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:57:46Z","timestamp":1725515866941},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540687450"},{"type":"electronic","value":"9783540687467"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-68746-7_7","type":"book-chapter","created":{"date-parts":[[2008,7,31]],"date-time":"2008-07-31T06:37:54Z","timestamp":1217486274000},"page":"33-51","source":"Crossref","is-referenced-by-count":5,"title":["Decomposition Theorems for Bounded Persistent Petri Nets"],"prefix":"10.1007","author":[{"given":"Eike","family":"Best","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philippe","family":"Darondeau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","first-page":"75","volume":"80","author":"E. Best","year":"2007","unstructured":"Best, E., Darondeau, P., Wimmel, H.: Making Petri Nets Safe and Free of Internal Transitions. Fundamenta Informaticae\u00a080, 75\u201390 (2007)","journal-title":"Fundamenta Informaticae"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-70881-0_1","volume-title":"Perspectives of Systems Informatics","author":"E. Best","year":"2007","unstructured":"Best, E., Esparza, J., Wimmel, H., Wolf, K.: Separability in Conflict-free Petri Nets. In: Virbitskaite, I., Voronkov, A. (eds.) PSI 2006. LNCS, vol.\u00a04378, pp. 1\u201318. Springer, Heidelberg (2007)"},{"issue":"5","key":"7_CR3","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1016\/S0022-0000(71)80013-2","volume":"5","author":"F. Commoner","year":"1971","unstructured":"Commoner, F., Holt, A.W., Even, S., Pnueli, A.: Marked Directed Graphs. J. Comput. Syst. Sci.\u00a05(5), 511\u2013523 (1971)","journal-title":"J. Comput. Syst. Sci."},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/j.ipl.2005.03.002","volume":"94","author":"P. Darondeau","year":"2005","unstructured":"Darondeau, P.: Equality of Languages Coincides with Isomorphism of Reachable State Graphs for Bounded and Persistent Petri Nets. Information Processing Letters\u00a094, 241\u2013245 (2005)","journal-title":"Information Processing Letters"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Desel, J., Esparza, J.: Free Choice Petri Nets. Cambridge Tracts in Theoretical Computer Science, 242 pages (1995) ISBN:0-521-46519-2","DOI":"10.1017\/CBO9780511526558"},{"issue":"1","key":"7_CR6","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/0020-0190(80)90026-5","volume":"11","author":"J. Grabowski","year":"1980","unstructured":"Grabowski, J.: The Decidability of Persistence for Vector Addition Systems. Information Processing Letter\u00a011(1), 20\u201323 (1980)","journal-title":"Information Processing Letter"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1007\/3-540-07135-0_113","volume-title":"Parallel Processing","author":"R.M. Keller","year":"1975","unstructured":"Keller, R.M.: A Fundamental Theorem of Asynchronous Parallel Computation. In: Tse-Yun, F. (ed.) Parallel Processing. LNCS, vol.\u00a024, pp. 102\u2013112. Springer, Heidelberg (1975)"},{"issue":"3","key":"7_CR8","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1145\/322077.322079","volume":"25","author":"L.H. Landweber","year":"1978","unstructured":"Landweber, L.H., Robertson, E.L.: Properties of Conflict-Free and Persistent Petri Nets. JACM\u00a025(3), 352\u2013364 (1978)","journal-title":"JACM"},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/0304-3975(89)90050-9","volume":"64","author":"E.W. Stark","year":"1989","unstructured":"Stark, E.W.: Concurrent Transition Systems. TCS\u00a064, 221\u2013269 (1989)","journal-title":"TCS"},{"issue":"3","key":"7_CR10","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/0020-0190(81)90117-4","volume":"13","author":"H. Yamasaki","year":"1981","unstructured":"Yamasaki, H.: On Weak Persistency of Petri Nets. Information Processing Letters\u00a013(3), 94\u201397 (1981)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Applications and Theory of Petri Nets"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68746-7_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,2]],"date-time":"2019-03-02T11:02:57Z","timestamp":1551524577000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68746-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540687450","9783540687467"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68746-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}