{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:49:11Z","timestamp":1759063751324},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662534007"},{"type":"electronic","value":"9783662534014"}],"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-662-53401-4_7","type":"book-chapter","created":{"date-parts":[[2016,9,2]],"date-time":"2016-09-02T15:34:52Z","timestamp":1472830492000},"page":"137-159","source":"Crossref","is-referenced-by-count":5,"title":["Conditions for Petri Net Solvable Binary Words"],"prefix":"10.1007","author":[{"given":"Kamila","family":"Barylska","sequence":"first","affiliation":[]},{"given":"Eike","family":"Best","sequence":"additional","affiliation":[]},{"given":"Evgeny","family":"Erofeev","sequence":"additional","affiliation":[]},{"given":"\u0141ukasz","family":"Mikulski","sequence":"additional","affiliation":[]},{"given":"Marcin","family":"Pi\u0105tkowski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,2]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Badouel, \u00c9., Darondeau, P.: Petri Net Synthesis, 339 p. Springer, Heidelberg (2015). ISBN 978-3-662-47966-7","DOI":"10.1007\/978-3-662-47967-4"},{"key":"7_CR2","unstructured":"Barylska, K., Best, E., Erofeev, E., Mikulski, \u0141., Pi\u0105tkowski, M.: On binary words being Petri net solvable. In: Carmona, J., Bergenthum, R., van der Aalst, W. (eds.) Proceedings of the ATAED 2015, pp. 1\u201315 (2015). http:\/\/ceur-ws.org\/Vol-1371"},{"key":"7_CR3","doi-asserted-by":"publisher","unstructured":"Best, E., Devillers, R.: Synthesis of bounded choice-free Petri nets. In: Aceto, L., Frutos Escrig, D. (eds.) Proceedings of the 26th International Conference on Concurrency Theory (CONCUR 2015), LIPICS 2015 (2015). doi: 10.4230\/LIPIcs.CONCUR.2015.128 , Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, 128\u2013141","DOI":"10.4230\/LIPIcs.CONCUR.2015.128"},{"key":"7_CR4","unstructured":"Best, E., Devillers, R.: Characterisation of the state spaces of marked graph Petri nets. In: Dediu, A.H., et al. (eds) Selected Extended Papers of LATA 2014, To appear in Information and Computation, 20 p. (2015)"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-319-39086-4_4","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"E Best","year":"2016","unstructured":"Best, E., Erofeev, E., Schlachter, U., Wimmel, H.: Characterising Petri net solvable binary words. In: Kordon, F., Moldt, D. (eds.) PETRI NETS 2016. LNCS, vol. 9698, pp. 39\u201358. Springer, Heidelberg (2016). doi: 10.1007\/978-3-319-39086-4_4"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Best, E., Schlachter, U.: Analysis of Petri nets and transition systems. In: Knight, S., Lanese, I., Lafuente, A.L., Vieira, H.T. (eds.) Proceedings of the 8th Interaction and Concurrency Experience, Electronic Proceedings in Theoretical Computer Science, vol. 189, pp. 53\u201367, June 2015. http:\/\/eptcs.web.cse.unsw.edu.au\/paper.cgi?ICE2015.6","DOI":"10.4204\/EPTCS.189.6"},{"issue":"5","key":"7_CR7","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":"7_CR8","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. The MIT Press, Cambridge (2009)","edition":"3"},{"key":"7_CR9","unstructured":"Erofeev, E., Barylska, K., Mikulski, \u0141., Pi\u0105tkowski, M.: Generating all minimal Petri net unsolvable binary words (2016). http:\/\/folco.mat.umk.pl\/papers\/generating-binary-muws.pdf"},{"key":"7_CR10","unstructured":"Karmarkar, N.: https:\/\/en.wikipedia.org\/wiki\/Karmarkar\u2019s_algorithm"},{"issue":"4","key":"7_CR11","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"},{"issue":"3","key":"7_CR12","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"},{"key":"7_CR13","unstructured":"Pi\u0105tkowski, M., et al.: http:\/\/folco.mat.umk.pl\/unsolvable-words (2015)"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Reisig, W.: Understanding Petri Nets: Modeling Techniques, Analysis Methods, Case Studies, 211 p. Springer, Hiedelberg (2013). ISBN 978-3-642-33278-4","DOI":"10.1007\/978-3-642-33278-4"},{"key":"7_CR15","unstructured":"Schlachter, U., et al.: https:\/\/github.com\/CvO-Theory\/apt (2013)"}],"container-title":["Lecture Notes in Computer Science","Transactions on Petri Nets and Other Models of Concurrency XI"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53401-4_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T21:53:19Z","timestamp":1498341199000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53401-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662534007","9783662534014"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53401-4_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}