{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T18:39:08Z","timestamp":1742927948877,"version":"3.40.3"},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319519623"},{"type":"electronic","value":"9783319519630"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-51963-0_13","type":"book-chapter","created":{"date-parts":[[2017,1,10]],"date-time":"2017-01-10T06:17:39Z","timestamp":1484029059000},"page":"163-175","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Graph-Theoretical Characterisation of State Separation"],"prefix":"10.1007","author":[{"given":"Eike","family":"Best","sequence":"first","affiliation":[]},{"given":"Raymond","family":"Devillers","sequence":"additional","affiliation":[]},{"given":"Uli","family":"Schlachter","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,1,11]]},"reference":[{"key":"13_CR1","unstructured":"Badouel, \u00c9., Bernardinello, L., Darondeau, P.: Petri Net Synthesis. Texts in Theoretical Computer Science, 339 pages. Springer, Heidelberg (2015). ISBN 978-3-662-47967-4"},{"key":"13_CR2","unstructured":"Berge, C.: Graphs and Hypergraphs. North Holland Mathematical Library, Vol. 6, 528 pages. Elsevier, Oxford (1973)"},{"key":"13_CR3","doi-asserted-by":"publisher","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, 237\u2013254 (2009)","journal-title":"Acta Informatica"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-319-39086-4_5","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"E Best","year":"2016","unstructured":"Best, E., Devillers, R.: The power of prime cycles. In: Kordon, F., Moldt, D. (eds.) PETRI NETS 2016. LNCS, vol. 9698, pp. 59\u201378. Springer, Heidelberg (2016). doi: 10.1007\/978-3-319-39086-4_5"},{"key":"13_CR5","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. Inf. Process. Lett. 94, 241\u2013245 (2005)","journal-title":"Inf. Process. Lett."},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Erofeev, E., Barylska, K., Mikulski, \u0141., Pi\u0105tkowski, M.: Generating all minimal petri net unsolvable binary words. In: Proceedings of Stringology 2016. http:\/\/www.stringology.org\/event\/","DOI":"10.1007\/978-3-662-53401-4_7"},{"issue":"1","key":"13_CR7","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF02421317","volume":"27","author":"I Fredholm","year":"1903","unstructured":"Fredholm, I.: Sur une classe d\u2019\u00e9quations fonctionelles. Acta Math. 27(1), 365\u2013390 (1903)","journal-title":"Acta Math."},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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. (ed.) Parallel Processing. LNCS, vol. 24, pp. 102\u2013112. Springer, Heidelberg (1975). doi: 10.1007\/3-540-07135-0_113"},{"key":"13_CR9","unstructured":"Reisig, W.: Petri Nets. EATCS Monographs on Theoretical Computer Science, vol. 4. Springer, Heidelberg (1985)"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2017: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-51963-0_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,21]],"date-time":"2022-07-21T03:27:22Z","timestamp":1658374042000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-51963-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319519623","9783319519630"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-51963-0_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"11 January 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Limerick","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ireland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 January 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 January 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"43","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}