{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,25]],"date-time":"2026-09-25T18:25:46Z","timestamp":1790360746700,"version":"4.1.0"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319245362","type":"print"},{"value":"9783319245379","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-24537-9_15","type":"book-chapter","created":{"date-parts":[[2015,9,30]],"date-time":"2015-09-30T05:37:02Z","timestamp":1443591422000},"page":"166-178","source":"Crossref","is-referenced-by-count":4,"title":["The Emptiness Problem for Valence Automata or: Another Decidable Extension of Petri Nets"],"prefix":"10.1007","author":[{"given":"Georg","family":"Zetzsche","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,10,1]]},"reference":[{"key":"15_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-663-09367-1","volume-title":"Transductions and Context-Free Languages","author":"J Berstel","year":"1979","unstructured":"Berstel, J.: Transductions and Context-Free Languages. Teubner, Stuttgart (1979)"},{"key":"15_CR2","volume-title":"The Book of Traces","year":"1995","unstructured":"Diekert, V., Rozenberg, G. (eds.): The Book of Traces. World Scientific, Singapore (1995)"},{"key":"15_CR3","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1080\/00927870802243580","volume":"37","author":"M Kambites","year":"2009","unstructured":"Kambites, M.: Formal Languages and Groups as Memory. Commun. Algebra 37, 193\u2013208 (2009)","journal-title":"Commun. Algebra"},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1016\/j.jalgebra.2006.05.020","volume":"309","author":"M Kambites","year":"2007","unstructured":"Kambites, M., Silva, P.V., Steinberg, B.: On the rational subset problem for groups. J. Algebra 309, 622\u2013639 (2007)","journal-title":"J. Algebra"},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/978-3-662-47666-6_26","volume-title":"Automata, Languages, and Programming","author":"J Leroux","year":"2015","unstructured":"Leroux, J., Sutre, G., Totzke, P.: On the coverability problem for pushdown vector addition systems in one dimension. In: Halld\u00f3rsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol. 9135, pp. 324\u2013336. Springer, Heidelberg (2015)"},{"key":"15_CR6","unstructured":"Lohrey, M.: The rational subset membership problem for groups: A survey (to appear)"},{"issue":"2","key":"15_CR7","doi-asserted-by":"publisher","first-page":"728","DOI":"10.1016\/j.jalgebra.2007.08.025","volume":"320","author":"M Lohrey","year":"2008","unstructured":"Lohrey, M., Steinberg, B.: The submonoid and rational subset membership problems for graph groups. J. Algebra 320(2), 728\u2013755 (2008)","journal-title":"J. Algebra"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Reinhardt, K.: Reachability in petri nets with inhibitor arcs. In: Proc. of RP 2008 (2008)","DOI":"10.1016\/j.entcs.2008.12.042"},{"key":"15_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/3-540-06841-4_49","volume-title":"Automata, Languages and Programming","author":"J Leeuwen van","year":"1974","unstructured":"van Leeuwen, J.: A generalisation of Parikh\u2019s theorem in formal language theory. In: Loeckx, J. (ed.) Automata, Languages and Programming. LNCS, vol. 14, pp. 17\u201326. Springer, Heidelberg (1974)"},{"issue":"1","key":"15_CR10","first-page":"17","volume":"16","author":"ES Wolk","year":"1965","unstructured":"Wolk, E.S.: A Note on \u2018The Comparability Graph of a Tree\u2019. P. Am. Math. Soc. 16(1), 17\u201320 (1965)","journal-title":"P. Am. Math. Soc."},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Zetzsche, G.: Computing downward closures for stacked counter automata. In: Proc. of STACS 2015 (2015)","DOI":"10.1007\/978-3-662-47666-6_35"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1007\/978-3-642-39212-2_39","volume-title":"Automata, Languages, and Programming","author":"G Zetzsche","year":"2013","unstructured":"Zetzsche, G.: Silent transitions in automata with storage. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part II. LNCS, vol. 7966, pp. 434\u2013445. Springer, Heidelberg (2013)"}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-24537-9_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T22:55:27Z","timestamp":1559256927000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-24537-9_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319245362","9783319245379"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-24537-9_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}