{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T22:02:21Z","timestamp":1794348141088,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540708803","type":"print"},{"value":"9783540708810","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70881-0_1","type":"book-chapter","created":{"date-parts":[[2007,8,3]],"date-time":"2007-08-03T16:07:32Z","timestamp":1186157252000},"page":"1-18","source":"Crossref","is-referenced-by-count":7,"title":["Separability in Conflict-Free Petri Nets"],"prefix":"10.1007","author":[{"given":"Eike","family":"Best","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Javier","family":"Esparza","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Harro","family":"Wimmel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Karsten","family":"Wolf","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"5","key":"1_CR1","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., et al.: Marked Directed Graphs. J. Comput. Syst. Sci.\u00a05(5), 511\u2013523 (1971)","journal-title":"J. Comput. Syst. Sci."},{"key":"1_CR2","series-title":"Cambridge Tracts in Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511526558","volume-title":"Free Choice Petri Nets","author":"J. Desel","year":"1995","unstructured":"Desel, J., Esparza, J.: Free Choice Petri Nets. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge (1995)"},{"issue":"2","key":"1_CR3","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1023\/A:1008743212620","volume":"16","author":"J. Esparza","year":"2000","unstructured":"Esparza, J., Melzer, S.: Verification of Safety Properties Using Integer Programming: Beyond the State Equation. Formal Methods in System Design\u00a016(2), 159\u2013189 (2000)","journal-title":"Formal Methods in System Design"},{"key":"1_CR4","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/BF00264027","volume":"2","author":"H.J. Genrich","year":"1973","unstructured":"Genrich, H.J., Lautenbach, K.: Synchronisationsgraphen. Acta Inf.\u00a02, 143\u2013161 (1973)","journal-title":"Acta Inf."},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1007\/978-3-540-47919-2_12","volume-title":"Advances in Petri Nets 1986. Proceedings of an Advanced Course","author":"U. Goltz","year":"1987","unstructured":"Goltz, U.: Synchronic Distance. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) APN 1986. LNCS, vol.\u00a0254, pp. 338\u2013358. Springer, Heidelberg (1987)"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/3-540-44919-1_22","volume-title":"Applications and Theory of Petri Nets 2003","author":"K. Hee van","year":"2003","unstructured":"van Hee, K., Sidorova, N., Voorhove, 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.\u00a02679, pp. 337\u2013356. Springer, Heidelberg (2003)"},{"issue":"3","key":"1_CR7","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":"1_CR8","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley, Chichester (1986)"},{"issue":"5","key":"1_CR9","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1007\/BF02679458","volume":"30","author":"H.C. Yen","year":"1997","unstructured":"Yen, H.C., Wang, B.Y., Yang, M.S.: Deciding a Class of Path Formulas for Conflict-Free Petri Nets. Theory of Computing Systems\u00a030(5), 475\u2013494 (1997)","journal-title":"Theory of Computing Systems"}],"container-title":["Lecture Notes in Computer Science","Perspectives of Systems Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70881-0_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:10:59Z","timestamp":1605744659000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70881-0_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540708803","9783540708810"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70881-0_1","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-540-70881-0","asserted-by":"object"}]},"subject":[]}}