{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T06:52:02Z","timestamp":1725864722004},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319459936"},{"type":"electronic","value":"9783319459943"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-45994-3_4","type":"book-chapter","created":{"date-parts":[[2016,9,12]],"date-time":"2016-09-12T09:41:04Z","timestamp":1473673264000},"page":"51-62","source":"Crossref","is-referenced-by-count":0,"title":["Plain, Bounded, Reversible, Persistent, and k-marked Petri Nets Have Marked Graph Reachability Graphs"],"prefix":"10.1007","author":[{"given":"Eike","family":"Best","sequence":"first","affiliation":[]},{"given":"Harro","family":"Wimmel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,13]]},"reference":[{"issue":"3","key":"4_CR1","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/s00236-009-0095-6","volume":"46","author":"E Best","year":"2009","unstructured":"Best, E., Darondeau, P.: A decomposition theorem for finite persistent transition systems. Acta Informatica 46(3), 237\u2013254 (2009)","journal-title":"Acta Informatica"},{"issue":"3\u20134","key":"4_CR2","doi-asserted-by":"crossref","first-page":"179","DOI":"10.3233\/FI-2011-606","volume":"113","author":"E Best","year":"2011","unstructured":"Best, E., Darondeau, P.: Separability in persistent Petri nets. Fundam. Inform. 113(3\u20134), 179\u2013203 (2011)","journal-title":"Fundam. Inform."},{"key":"4_CR3","unstructured":"Best, E., Devillers, R.: Characterisation of the state spaces of marked graph Petri nets. To be published in Information and Computation (2016). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0890540116300207"},{"issue":"5","key":"4_CR4","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. 5(5), 511\u2013523 (1971)","journal-title":"J. Comput. Syst. Sci."},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/978-3-642-23217-6_4","volume-title":"CONCUR 2011 \u2013 Concurrency Theory","author":"RJ Glabbeek van","year":"2011","unstructured":"van Glabbeek, R.J., Goltz, U., Schicke, J.-W.: On causal semantics of Petri nets. In: Katoen, J.-P., K\u00f6nig, B. (eds.) CONCUR 2011. LNCS, vol. 6901, pp. 43\u201359. Springer, Heidelberg (2011)"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/3-540-44919-1_22","volume-title":"Applications and Theory of Petri Nets 2003","author":"KM Hee van","year":"2003","unstructured":"van Hee, K.M., Sidorova, N., Voorhoeve, M.: Soundness and separability of workflow nets in the stepwise refinement approach. In: van der Aalst, W.M.P., Best, E. (eds.) ICATPN 2003. LNCS, vol. 2679, pp. 337\u2013356. Springer, Heidelberg (2003)"},{"key":"4_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":"RM Keller","year":"1975","unstructured":"Keller, R.M.: A fundamental theorem of asynchronous parallel computation. In: Feng, T.Y. (ed.) Parallel Processing. LNCS, vol. 24, pp. 102\u2013112. Springer, Heidelberg (1975)"},{"issue":"3","key":"4_CR8","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1145\/322077.322079","volume":"25","author":"LH Landweber","year":"1978","unstructured":"Landweber, L.H., Robertson, E.L.: Properties of conflict-free and persistent Petri nets. JACM 25(3), 352\u2013364 (1978)","journal-title":"JACM"},{"issue":"4","key":"4_CR9","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1109\/5.24143","volume":"77","author":"T Murata","year":"1989","unstructured":"Murata, T.: Petri nets: properties, analysis and applications. Proc. IEEE 77(4), 541\u2013580 (1989)","journal-title":"Proc. IEEE"},{"key":"4_CR10","unstructured":"https:\/\/en.wikipedia.org\/wiki\/Shuffle_algebra"}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-45994-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,25]],"date-time":"2020-09-25T23:29:49Z","timestamp":1601076589000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-45994-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319459936","9783319459943"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-45994-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}