{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T06:14:44Z","timestamp":1784528084623,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540647812","type":"print"},{"value":"9783540686811","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0055044","type":"book-chapter","created":{"date-parts":[[2006,8,1]],"date-time":"2006-08-01T12:08:05Z","timestamp":1154434085000},"page":"103-115","source":"Crossref","is-referenced-by-count":133,"title":["Reset nets between decidability and undecidability"],"prefix":"10.1007","author":[{"given":"C.","family":"Dufourd","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"A.","family":"Finkel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ph.","family":"Schnoebelen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2006,5,26]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"P. A. Abdulla, K. \u010der\u0101ns, B. Jonsson, and T. Yih-Kuen. General decidability theorems for infinite-state systems. In Proc. 11th IEEE Symp. Logic in Computer Science (LICS'96), New Brunswick, NJ, USA, July 1996, pages 313\u2013321, 1996.","DOI":"10.1109\/LICS.1996.561359"},{"issue":"1","key":"9_CR2","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0304-3975(76)90067-0","volume":"3","author":"T. Araki","year":"1977","unstructured":"T. Araki and T. Kasami. Some decision problems related to the reachability problem for Petri nets. Theoretical Computer Science, 3(1):85\u2013104, 1977.","journal-title":"Theoretical Computer Science"},{"key":"9_CR3","series-title":"Tech. Report No.222","volume-title":"PhD thesis","author":"J. Billington","year":"1991","unstructured":"J. Billington. Extensions to coloured Petri nets and their applications to protocols. PhD thesis, University of Cambridge, UK, May 1991. Available as Tech. Report No.222."},{"key":"9_CR4","first-page":"179","volume-title":"volume 815 of Lecture Notes in Computer Science","author":"G. Ciardo","year":"1994","unstructured":"G. Ciardo. Petri nets with marking-dependent arc cardinality: Properties and analysis. In Proc. 15th Int. Conf. Applications and Theory of Petri Nets, Zaragoza, Spain, June 1994, volume 815 of Lecture Notes in Computer Science, pages 179\u2013198. Springer-Verlag, 1994."},{"issue":"2","key":"9_CR5","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/0890-5401(90)90009-7","volume":"89","author":"A. Finkel","year":"1990","unstructured":"A. Finkel. Reduction and covering of infinite reachability trees. Information and Computation, 89(2):144\u2013179, 1990.","journal-title":"Information and Computation"},{"key":"9_CR6","volume-title":"volume 1380 of Lecture Notes in Computer Science","author":"A. Finkel","year":"1998","unstructured":"A. Finkel and Ph. Schnoebelen. Fundamental structures in well-structured infinite transition systems. In Proc. 3rd Latin American Theoretical Informatics Symposium (LATIN'98), Campinas, Brazil, Apr. 1998, volume 1380 of Lecture Notes in Computer Science. Springer-Verlag, 1998."},{"key":"9_CR7","unstructured":"M. Hack. Decidability questions for Petri nets. PhD Thesis MIT\/LCS\/TR-161, Massachusetts Institute of Technology, Lab. for Computer Science, June 1976."},{"key":"9_CR8","first-page":"328","volume-title":"volume 1248 of Lecture Notes in Computer Science","author":"M. Kishinevsky","year":"1997","unstructured":"M. Kishinevsky, J. Cortadella, A. Kondratyev, L. Lavagno, A. Taubin, and A. Yakovlev. Coupling asynchrony and interrupts: Place chart nets. In Proc. 18th Int. Conf. Application and Theory of Petri Nets, Toulouse, France, June 1997, volume 1248 of Lecture Notes in Computer Science, pages 328\u2013347. Springer-Verlag, 1997."},{"issue":"2","key":"9_CR9","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/S0022-0000(69)80011-5","volume":"3","author":"R. M. Karp","year":"1969","unstructured":"R. M. Karp and R. E. Miller. Parallel program schemata. Journal of Computer and System Sciences, 3(2):147\u2013195, 1969.","journal-title":"Journal of Computer and System Sciences"},{"key":"9_CR10","first-page":"338","volume-title":"volume 815 of Lecture Notes in Computer Science","author":"C. Lakos","year":"1994","unstructured":"C. Lakos and S. Christensen. A general approach to arc extensions for coloured Petri nets. In Proc. 15th Int. Conf. Applications and Theory of Petri Nets, Zaragoza, Spain, June 1994, volume 815 of Lecture Notes in Computer Science, pages 338\u2013357. Springer-Verlag, 1994."},{"key":"9_CR11","unstructured":"J. L. Peterson. Petri Net Theory and the Modeling of Systems. Prentice Hall Int., 1981."},{"issue":"2","key":"9_CR12","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0304-3975(78)90036-1","volume":"6","author":"C. Rackoff","year":"1978","unstructured":"C. Rackoff. The covering and boundedness problems for vector addition systems. Theoretical Computer Science, 6(2):223\u2013231, 1978.","journal-title":"Theoretical Computer Science"},{"key":"9_CR13","unstructured":"K. Reinhardt. Reachability in Petri nets with inhibitor arcs, November 1995. Unpublished manuscript. See www-fs.informatik.uni-tuebingen.de\/~reinhard."},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"R. Valk. On the computational power of extended Petri nets. In Proc. 7th Symp. Math. Found. Comp. Sci. (MFCS'78), Zakopane, Poland, Sep. 1978, volume 64 of Lecture Notes in Computer Science, pages 526\u2013535, 1978.","DOI":"10.1007\/3-540-08921-7_101"},{"key":"9_CR15","first-page":"464","volume-title":"volume 62 of Lecture Notes in Computer Science","author":"R. Valk","year":"1978","unstructured":"R. Valk. Self-modifying nets, a natural extension of Petri nets. In Proc. 5th Int. Coll. Automata, Languages, and Programming (ICALP'78), Udine, Italy, Jul. 1978, volume 62 of Lecture Notes in Computer Science, pages 464\u2013476. Springer-Verlag, 1978."},{"key":"9_CR16","first-page":"508","volume-title":"volume 1295 of Lecture Notes in Computer Science","author":"W. Vogler","year":"1997","unstructured":"W. Vogler. Partial order semantics and read arcs. In Proc. 22nd Int. Symp. Math. Found. Comp. Sci. (MFCS'97), Bratislava, Slovakia, Aug. 1997, volume 1295 of Lecture Notes in Computer Science, pages 508\u2013517. Springer-Verlag, 1997."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0055044","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T07:59:38Z","timestamp":1736495978000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0055044"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540647812","9783540686811"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/bfb0055044","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998]]}}}