{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:09:01Z","timestamp":1760202541459},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540730934"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73094-1_19","type":"book-chapter","created":{"date-parts":[[2007,6,30]],"date-time":"2007-06-30T05:53:56Z","timestamp":1183182836000},"page":"301-320","source":"Crossref","is-referenced-by-count":16,"title":["Nets with Tokens Which Carry Data"],"prefix":"10.1007","author":[{"given":"Ranko","family":"Lazi\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tom","family":"Newcomb","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jo\u00ebl","family":"Ouaknine","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. W.","family":"Roscoe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James","family":"Worrell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-69968-9","volume-title":"Petri Nets: An Introduction","author":"W. Reisig","year":"1985","unstructured":"Reisig, W.: Petri Nets: An Introduction. Springer, Heidelberg (1985)"},{"volume-title":"Petri Nets for Systems Engineering","year":"2003","key":"19_CR2","unstructured":"Girault, C., Valk, R. (eds.): Petri Nets for Systems Engineering. Springer, Heidelberg (2003)"},{"key":"19_CR3","first-page":"244","volume":"52","author":"J. Esparza","year":"1994","unstructured":"Esparza, J., Nielsen, M.: Decidability issues for Petri nets \u2013 a survey. Bull. EATCS\u00a052, 244\u2013262 (1994)","journal-title":"Bull. EATCS"},{"key":"19_CR4","unstructured":"Lipton, R.J.: The reachability problem requires exponential space. Technical Report\u00a062, Yale University (1976)"},{"key":"19_CR5","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. Theor. Comput. Sci.\u00a06, 223\u2013231 (1978)","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20132","key":"19_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ic.2004.01.005","volume":"195","author":"A. Finkel","year":"2004","unstructured":"Finkel, A., McKenzie, P., Picaronny, C.: A well-structured framework for analysing Petri net extensions. Inf. Comput.\u00a0195(1\u20132), 1\u201329 (2004)","journal-title":"Inf. Comput."},{"issue":"5","key":"19_CR7","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0020-0190(01)00337-4","volume":"83","author":"P. Schnoebelen","year":"2002","unstructured":"Schnoebelen, P.: Verifying lossy channel systems has nonprimitive recursive complexity. Inf. Proc. Lett.\u00a083(5), 251\u2013261 (2002)","journal-title":"Inf. Proc. Lett."},{"key":"19_CR8","volume-title":"Classical Recursion Theory II","author":"P. Odifreddi","year":"1999","unstructured":"Odifreddi, P.: Classical Recursion Theory II. Elsevier, Amsterdam (1999)"},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/BFb0055044","volume-title":"Automata, Languages and Programming","author":"C. Dufourd","year":"1998","unstructured":"Dufourd, C., Finkel, A., Schnoebelen, P.: Reset nets between decidability and undecidability. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol.\u00a01443, pp. 103\u2013115. Springer, Heidelberg (1998)"},{"key":"19_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/3-540-45740-2_5","volume-title":"Applications and Theory of Petri Nets 2001","author":"P.A. Abdulla","year":"2001","unstructured":"Abdulla, P.A., Nyl\u00e9n, A.: Timed Petri nets and BQOs. In: Colom, J.-M., Koutny, M. (eds.) ICATPN 2001. LNCS, vol.\u00a02075, pp. 53\u201370. Springer, Heidelberg (2001)"},{"key":"19_CR11","unstructured":"Delzanno, G.: Constraint multiset rewriting. Technical Report DISI-TR-05-08, Universit\u00e0 di Genova Extends [22\u201324] (2005)"},{"key":"19_CR12","unstructured":"Abdulla, P.A., Delzanno, G.: Constrained multiset rewriting. In: AVIS. ENTCS 2006 (to appear 2006)"},{"key":"19_CR13","unstructured":"Rosa Velardo, F., de Frutos Escrig, D., Marroqu\u00edn Alonso, O.: On the expressiveness of mobile synchronizing Petri nets. In: SECCO. ENTCS 2005 (to appear 2005)"},{"issue":"1","key":"19_CR14","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/S0304-3975(01)00330-9","volume":"290","author":"P.A. Abdulla","year":"2003","unstructured":"Abdulla, P.A., Jonsson, B.: Model checking of systems with many identical timed processes. Theor. Comput. Sci.\u00a0290(1), 241\u2013264 (2003)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"19_CR15","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1006\/inco.1996.0053","volume":"127","author":"P.A. Abdulla","year":"1996","unstructured":"Abdulla, P.A., Jonsson, B.: Verifying programs with unreliable channels. Inf. Comput.\u00a0127(2), 91\u2013101 (1996)","journal-title":"Inf. Comput."},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Lazi\u0107, R., Newcomb, T.C., Roscoe, A.W.: Polymorphic systems with arrays, 2-counter machines and multiset rewriting. In: Infinity \u201904, ENTCS, vol. 138, pp. 61\u201386 (2005)","DOI":"10.1016\/j.entcs.2005.02.064"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Lazi\u0107, R.: Decidability of reachability for polymorphic systems with arrays: A complete classification. In: Infinity \u201904, ENTCS, vol. 138, pp. 3\u201319 ( 2005)","DOI":"10.1016\/j.entcs.2005.08.001"},{"issue":"1\u20132","key":"19_CR18","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0304-3975(00)00102-X","volume":"256","author":"A. Finkel","year":"2001","unstructured":"Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere? Theor. Comput. Sci.\u00a0256(1\u20132), 63\u201392 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR19","series-title":"Lect. Not. Math","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/BFb0064872","volume-title":"Logic colloquium \u201972\u201373","author":"A.R. Meyer","year":"1975","unstructured":"Meyer, A.R.: Weak monadic second-order theory of successor is not elementary-recursive. In: Logic colloquium \u201972\u201373. Lect. Not. Math, vol.\u00a0453, pp. 132\u2013154. Springer, Heidelberg (1975)"},{"issue":"7","key":"19_CR20","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1112\/plms\/s3-2.1.326","volume":"2","author":"G. Higman","year":"1952","unstructured":"Higman, G.: Ordering by divisibility in abstract algebras. Proc. London Math. Soc.\u00a0(3) 2(7), 326\u2013336 (1952)","journal-title":"Proc. London Math. Soc."},{"key":"19_CR21","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/BF00289715","volume":"21","author":"R. Valk","year":"1985","unstructured":"Valk, R., Jantzen, M.: The residue of vector sets with applications to decidability problems in Petri nets. Acta Inf.\u00a021, 643\u2013674 (1985)","journal-title":"Acta Inf."},{"key":"19_CR22","doi-asserted-by":"crossref","unstructured":"Delzanno, G.: An assertional language for systems parametric in several dimensions. In: VEPAS, ENTCS, vol. 50 (2001)","DOI":"10.1016\/S1571-0661(04)00189-6"},{"key":"19_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/3-540-46002-0_16","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"M. Bozzano","year":"2002","unstructured":"Bozzano, M., Delzanno, G.: Beyond parameterized verification. In: Katoen, J.-P., Stevens, P. (eds.) ETAPS 2002 and TACAS 2002. LNCS, vol.\u00a02280, pp. 221\u2013235. Springer, Heidelberg (2002)"},{"key":"19_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/3-540-45657-0_22","volume-title":"Computer Aided Verification","author":"M. Bozzano","year":"2002","unstructured":"Bozzano, M., Delzanno, G.: Automatic verification of invalidation-based protocols. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, pp. 295\u2013308. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Petri Nets and Other Models of Concurrency \u2013 ICATPN 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73094-1_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:11:46Z","timestamp":1605762706000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73094-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540730934"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73094-1_19","relation":{},"subject":[]}}