{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,12]],"date-time":"2026-09-12T07:44:23Z","timestamp":1789199063407,"version":"build-2803163510"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642401831","type":"print"},{"value":"9783642401848","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40184-8_12","type":"book-chapter","created":{"date-parts":[[2013,7,23]],"date-time":"2013-07-23T01:50:56Z","timestamp":1374544256000},"page":"152-166","source":"Crossref","is-referenced-by-count":4,"title":["Expand, Enlarge, and Check for Branching Vector Addition Systems"],"prefix":"10.1007","author":[{"given":"Rupak","family":"Majumdar","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zilong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Bouajjani, A., Emmi, M.: Analysis of recursively parallel programs. In: POPL, pp. 203\u2013214 (2012)","DOI":"10.1145\/2103621.2103681"},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-642-24288-5_10","volume-title":"Reachability Problems","author":"L. Bozzelli","year":"2011","unstructured":"Bozzelli, L., Ganty, P.: Complexity analysis of the backward coverability algorithm for VASS. In: Delzanno, G., Potapov, I. (eds.) RP 2011. LNCS, vol.\u00a06945, pp. 96\u2013109. Springer, Heidelberg (2011)"},{"issue":"10","key":"12_CR3","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1145\/1103845.1094852","volume":"40","author":"P. Charles","year":"2005","unstructured":"Charles, P., Grothoff, C., Saraswat, V., Donawa, C., Kielstra, A., Ebcioglu, K., von Praun, C., Sarkar, V.: X10: an object-oriented approach to non-uniform cluster computing. SIGPLAN Not.\u00a040(10), 519\u2013538 (2005)","journal-title":"SIGPLAN Not."},{"key":"12_CR4","unstructured":"Cunningham, R.: Eel: Tools for debugging, visualization, and verification of event-driven software. Master\u2019s thesis, UCLA (2005)"},{"issue":"1","key":"12_CR5","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.jcss.2012.04.002","volume":"79","author":"S. Demri","year":"2013","unstructured":"Demri, S., Jurdzinski, M., Lachish, O., Lazic, R.: The covering and boundedness problems for branching vector addition systems. J. Comput. Syst. Sci.\u00a079(1), 23\u201338 (2013)","journal-title":"J. Comput. Syst. Sci."},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Ganty, P., Majumdar, R.: Algorithmic verification of asynchronous programs. In: ACM Transactions on Programming Languages and Systems (2012)","DOI":"10.1145\/2160910.2160915"},{"issue":"1","key":"12_CR7","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1016\/j.jcss.2005.09.001","volume":"72","author":"G. Geeraerts","year":"2006","unstructured":"Geeraerts, G., Raskin, J.-F., Begin, L.V.: Expand, enlarge and check: New algorithms for the coverability problem of wsts. J. Comput. Syst. Sci.\u00a072(1), 180\u2013203 (2006)","journal-title":"J. Comput. Syst. Sci."},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1145\/4472.4478","volume":"7","author":"R.H. Halstead","year":"1985","unstructured":"Halstead, R.H.: Multilisp: a language for concurrent symbolic computation. ACM Transactions on Programming Languages and Systems\u00a07, 501\u2013538 (1985)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Jhala, R., Majumdar, R.: Interprocedural analysis of asynchronous programs. In: POPL 2007, pp. 339\u2013350. ACM Press (2007)","DOI":"10.1145\/1190215.1190266"},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1007\/978-3-642-32940-1_35","volume-title":"CONCUR 2012 \u2013 Concurrency Theory","author":"A. Kaiser","year":"2012","unstructured":"Kaiser, A., Kroening, D., Wahl, T.: Efficient coverability analysis by proof minimization. In: Koutny, M., Ulidowski, I. (eds.) CONCUR 2012. LNCS, vol.\u00a07454, pp. 500\u2013515. Springer, Heidelberg (2012)"},{"issue":"2","key":"12_CR11","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0022-0000(69)80011-5","volume":"3","author":"R. Karp","year":"1969","unstructured":"Karp, R., Miller, R.: Parallel program schemata. Journal of Comput. Syst. Sci.\u00a03(2), 147\u2013195 (1969)","journal-title":"Journal of Comput. Syst. Sci."},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-02138-1_1","volume-title":"Formal Techniques for Distributed Systems","author":"D. Kitchin","year":"2009","unstructured":"Kitchin, D., Quark, A., Cook, W., Misra, J.: The Orc programming language. In: Lee, D., Lopes, A., Poetzsch-Heffter, A. (eds.) FMOODS 2009. LNCS, vol.\u00a05522, pp. 1\u201325. Springer, Heidelberg (2009)"},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-642-39799-8_10","volume-title":"Computer Aided Verification","author":"J. Kloos","year":"2013","unstructured":"Kloos, J., Majumdar, R., Niksic, F., Piskac, R.: Incremental, inductive coverability. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol.\u00a08044, pp. 158\u2013173. Springer, Heidelberg (2013)"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Leijen, D., Schulte, W., Burckhardt, S.: The design of a task parallel library. In: OOPSLA 2009, pp. 227\u2013242. ACM (2009)","DOI":"10.1145\/1639949.1640106"},{"issue":"2","key":"12_CR15","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0304-3975(78)90036-1","volume":"6","author":"C. Rackoff","year":"1978","unstructured":"Rackoff, C.: The covering and boundedness problems for vector addition systems. Theoretical Computer Science\u00a06(2), 223\u2013231 (1978)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"12_CR16","first-page":"217","volume":"7","author":"K. Verma","year":"2005","unstructured":"Verma, K., Goubault-Larrecq, J.: Karp-Miller trees for a branching extension of VASS. Discrete Mathematics & Theoretical Computer Science\u00a07(1), 217\u2013230 (2005)","journal-title":"Discrete Mathematics & Theoretical Computer Science"},{"issue":"6","key":"12_CR17","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1016\/j.ic.2006.12.006","volume":"205","author":"K.N. Verma","year":"2007","unstructured":"Verma, K.N., Goubault-Larrecq, J.: Alternating two-way AC-tree automata. Inf. Comput.\u00a0205(6), 817\u2013869 (2007)","journal-title":"Inf. Comput."}],"container-title":["Lecture Notes in Computer Science","CONCUR 2013 \u2013 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40184-8_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T02:56:19Z","timestamp":1557975379000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40184-8_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642401831","9783642401848"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40184-8_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}