{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T09:53:03Z","timestamp":1773654783913,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1981,6,1]],"date-time":"1981-06-01T00:00:00Z","timestamp":360201600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1981,6]]},"DOI":"10.1007\/bf00289268","type":"journal-article","created":{"date-parts":[[2004,10,5]],"date-time":"2004-10-05T03:39:42Z","timestamp":1096947582000},"page":"309-318","source":"Crossref","is-referenced-by-count":54,"title":["Persistence of vector replacement systems is decidable"],"prefix":"10.1007","volume":"15","author":[{"given":"Ernst","family":"Mayr","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0304-3975(77)90059-7","volume":"4","author":"T. Araki","year":"1977","unstructured":"Araki, T., Kasami, T.: Decidable problems on the strong connectivity of Petri net reachability sets. Theor. Comput. Sci 4, 99?119 (1977)","journal-title":"Theor. Comput. Sci"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"413","DOI":"10.2307\/2370405","volume":"35","author":"L.E. Dickson","year":"1913","unstructured":"Dickson, L.E.: Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors. Amer. J. Math. 35, 413?422 (1913)","journal-title":"Amer. J. Math."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1966.16.285","volume":"16","author":"S. Ginsburg","year":"1966","unstructured":"Ginsburg, S., Spanier, E.H.: Semigroups, Presburger formulas, and languages. Pacific J. Math. 16, 285?296 (1966)","journal-title":"Pacific J. Math."},{"key":"CR4","unstructured":"Hack, M.: Decision problems for Petri nets and vector addition systems. M.I.T., Project MAC, MAC-TM 59 (1975)"},{"key":"CR5","unstructured":"Hack, M.: Decidability questions for Petri nets. M.I.T., LCS, TR 161 (1976)"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/S0022-0000(69)80011-5","volume":"3","author":"R.M. Karp","year":"1969","unstructured":"Karp, R.M., Miller, R.E.: Parallel program schemata. J. Comput. System Sci. 3, 147?195 (1969)","journal-title":"J. Comput. System Sci."},{"key":"CR7","unstructured":"Keller, R.M.: Vector replacement systems: A formalism for modelling asynchronous systems. Princeton University, CSL, TR 117 (1972)"},{"key":"CR8","series-title":"Lecture Notes in Computer Sciences, Vol. 24","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1007\/3-540-07135-0_113","volume-title":"Parallel processing","author":"R.M. Keller","year":"1975","unstructured":"Keller, R.M.: A fundamental theorem of asynchronous parallel computation. In: Parallel processing. (T.Y. Feng, ed.) Proceedings Sagamore Computer Conference. Lecture Notes in Computer Sciences, Vol. 24, pp. 102?112. Berlin Heidelberg New York: Springer, 1975"},{"key":"CR9","doi-asserted-by":"crossref","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. J. Assoc. Comput. Mach. 25, 352?364 (1978)","journal-title":"J. Assoc. Comput. Mach."},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"Lipton, R.J., Miller, R.E., Snyder, L.: Synchronization and computing capabilities of linear asynchronous structures. Proc. 16th Ann. Symp. on FOCS. IEEE Computer Society 1975, pp. 19?28","DOI":"10.1109\/SFCS.1975.27"},{"key":"CR11","series-title":"Lecture Notes in Computer Sciences, Vol. 88","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1007\/BFb0022522","volume-title":"Mathematical Foundations of Computer Science 1980","author":"H. M\u00fcller","year":"1980","unstructured":"M\u00fcller, H.: Decidability of reachability in persistent vector replacement systems. In: Mathematical Foundations of Computer Science 1980. Proceedings of the 9th Symposium in Rydzyna. (P. Dembinski, ed.) Lecture Notes in Computer Sciences, Vol. 88, pp. 426?438. Berlin Heidelberg New York: Springer (1980)"},{"key":"CR12","first-page":"204","volume-title":"Proc. Int. Symp. on Theory of Switching","author":"D.E. Muller","year":"1959","unstructured":"Muller, D.E., Bantky, M.S.: A theory of asynchronous circuits. Proc. Int. Symp. on Theory of Switching. Cambridge, MA: Harvard Univ. Press, p. 204?243, 1959"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0022-0000(78)90021-1","volume":"16","author":"D.C. Oppen","year":"1978","unstructured":"Oppen, D.C.: A 318-01 upper bound on the complexity of Presburger arithmetic. J. Comput. System Sci. 16, 323?332 (1978)","journal-title":"J. Comput. System Sci."},{"key":"CR14","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1145\/321356.321364","volume":"13","author":"R.J. Parikh","year":"1966","unstructured":"Parikh, R.J.: On context-free languages. J. Assoc. Comput. Mach. 13, 570?581 (1966)","journal-title":"J. Assoc. Comput. Mach."},{"key":"CR15","unstructured":"Presburger, M.: \u00dcber die Vollst\u00e4ndigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt. Compte-Rendus du I. Congr\u00e8s des Math\u00e9maticiens des pays Slavs, Warsaw, p. 92?101, 1930"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1145\/321738.321750","volume":"20","author":"B. Rosen","year":"1973","unstructured":"Rosen, B.: Tree manipulating systems and Church-Rosser theorems. J. Assoc. Comput. Mach. 20, 160?187 (1973)","journal-title":"J. Assoc. Comput. Mach."}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00289268.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00289268\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00289268","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T21:14:46Z","timestamp":1554758086000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00289268"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,6]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1981,6]]}},"alternative-id":["BF00289268"],"URL":"https:\/\/doi.org\/10.1007\/bf00289268","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1981,6]]}}}