{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T16:40:03Z","timestamp":1746290403293,"version":"3.40.4"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319077338"},{"type":"electronic","value":"9783319077345"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[[2014]]},"DOI":"10.1007\/978-3-319-07734-5_17","type":"book-chapter","created":{"date-parts":[[2014,7,1]],"date-time":"2014-07-01T13:57:34Z","timestamp":1404223054000},"page":"314-333","source":"Crossref","is-referenced-by-count":5,"title":["A Framework for Classical Petri Net Problems: Conservative Petri Nets as an Application"],"prefix":"10.1007","author":[{"given":"Ernst W.","family":"Mayr","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeremias","family":"Weihmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Cardoza, E., Lipton, R., Meyer, A.R.: Exponential space complete problems for Petri nets and commutative semigroups (preliminary report). In: Proceedings of the 8th ACM Symposium on Theory of Computing (STOC 1976), pp. 50\u201354. ACM (1976)","DOI":"10.1145\/800113.803630"},{"issue":"1","key":"17_CR2","doi-asserted-by":"crossref","first-page":"13","DOI":"10.3233\/FI-1997-3112","volume":"31","author":"J. Esparza","year":"1997","unstructured":"Esparza, J.: Petri nets, commutative context-free grammars, and basic parallel processes. Fundamenta Informaticae\u00a031(1), 13\u201325 (1997)","journal-title":"Fundamenta Informaticae"},{"issue":"3","key":"17_CR3","first-page":"143","volume":"30","author":"J. Esparza","year":"1994","unstructured":"Esparza, J., Nielsen, M.: Decibility issues for Petri nets - a survey. Journal of Information Processing and Cybernetics\u00a030(3), 143\u2013160 (1994)","journal-title":"Journal of Information Processing and Cybernetics"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Hack, M.: The recursive equivalence of the reachability problem and the liveness problem for Petri nets and vector addition systems. In: IEEE Conference Record of the 15th Annual Symposium on Switching and Automata Theory, pp. 156\u2013164 (1974)","DOI":"10.1109\/SWAT.1974.28"},{"issue":"2","key":"17_CR5","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1006\/inco.1993.1055","volume":"106","author":"R.R. Howell","year":"1993","unstructured":"Howell, R.R., Jancar, P., Rosier, L.E.: Completeness results for single-path Petri nets. Information and Computation\u00a0106(2), 253\u2013265 (1993)","journal-title":"Information and Computation"},{"issue":"3","key":"17_CR6","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1016\/0022-0000(88)90013-X","volume":"37","author":"R.R. Howell","year":"1988","unstructured":"Howell, R.R., Rosier, L.E.: Completeness results for conflict-free vector replacement systems. Journal of Computer and System Sciences\u00a037(3), 349\u2013366 (1988)","journal-title":"Journal of Computer and System Sciences"},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/3-540-51498-8_22","volume-title":"Fundamentals of Computation Theory","author":"R.R. Howell","year":"1989","unstructured":"Howell, R.R., Rosier, L.E., Yen, H.C.: Normal and sinkless Petri nets. In: Csirik, J., Demetrovics, J., G\u00e9cseg, F. (eds.) Proceedings of the 1989 International Conference on Fundamentals of Computation Theory (FCT 1989). LNCS, vol.\u00a0380, pp. 234\u2013243. Springer, Heidelberg (1989)"},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/3-540-10003-2_81","volume-title":"Automata, Languages and Programming","author":"D.T. Huynh","year":"1980","unstructured":"Huynh, D.T.: The complexity of semilinear sets. In: de Bakker, J., van Leeuwen, J. (eds.) ICALP 1980. LNCS, vol.\u00a085, pp. 324\u2013337. Springer, Heidelberg (1980)"},{"key":"17_CR9","first-page":"147","volume":"22","author":"D.T. Huynh","year":"1986","unstructured":"Huynh, D.T.: A simple proof for the $\\Sigma_2^p$ upper bound of the inequivalence problem for semilinear sets. Elektronische Informationsverarbeitung und Kybernetik\u00a022, 147\u2013156 (1986)","journal-title":"Elektronische Informationsverarbeitung und Kybernetik"},{"issue":"3","key":"17_CR10","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0304-3975(77)90014-7","volume":"4","author":"N.D. Jones","year":"1977","unstructured":"Jones, N.D., Landweber, L.H., Lien, Y.E.: Complexity of some problems in Petri nets. Theoretical Computer Science\u00a04(3), 277\u2013299 (1977)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"17_CR11","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N. Karmarkar","year":"1984","unstructured":"Karmarkar, N.: A new polynomial-time algorithm for linear programming. Combinatorica\u00a04(4), 373\u2013395 (1984)","journal-title":"Combinatorica"},{"issue":"4","key":"17_CR12","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/0020-0255(76)90054-2","volume":"10","author":"Y.E. Lien","year":"1976","unstructured":"Lien, Y.E.: A note on transition systems. Information Sciences\u00a010(4), 347\u2013362 (1976)","journal-title":"Information Sciences"},{"issue":"2","key":"17_CR13","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1137\/0205020","volume":"5","author":"Y.E. Lien","year":"1976","unstructured":"Lien, Y.E.: Termination properties of generalized Petri nets. SIAM Journal on Computing\u00a05(2), 251\u2013265 (1976)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"17_CR14","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1137\/0213029","volume":"13","author":"E.W. Mayr","year":"1984","unstructured":"Mayr, E.W.: An algorithm for the general Petri net reachability problem. SIAM Journal on Computing\u00a013(3), 441\u2013460 (1984)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"17_CR15","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0001-8708(82)90048-2","volume":"46","author":"E.W. Mayr","year":"1982","unstructured":"Mayr, E.W., Meyer, A.R.: The complexity of the word problems for commutative semigroups and polynomial ideals. Advances in Mathematics\u00a046(3), 305\u2013329 (1982)","journal-title":"Advances in Mathematics"},{"key":"17_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-642-41036-9_19","volume-title":"Reachability Problems","author":"E.W. Mayr","year":"2013","unstructured":"Mayr, E.W., Weihmann, J.: Completeness results for generalized communication-free Petri nets with arbitrary edge multiplicities. In: Abdulla, P.A., Potapov, I. (eds.) RP 2013. LNCS, vol.\u00a08169, pp. 209\u2013221. Springer, Heidelberg (2013)"},{"key":"17_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/3-540-58152-9_27","volume-title":"Application and Theory of Petri Nets 1994","author":"E. Teruel","year":"1994","unstructured":"Teruel, E., Silva, M.: Well-formedness of equal conflict systems. In: Valette, R. (ed.) ICATPN 1994. LNCS, vol.\u00a0815, pp. 491\u2013510. Springer, Heidelberg (1994)"},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"Watanabe, T., Mizobata, Y., Onaga, K.: Legal firing sequence and related problems of Petri nets. In: Proceedings of the 3rd International Workshop on Petri Nets and Performance Models (PNPM 1989), pp. 277\u2013286 (1989)","DOI":"10.1109\/PNPM.1989.68561"},{"key":"17_CR19","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/S0304-3975(96)00147-8","volume":"179","author":"H.C. Yen","year":"1997","unstructured":"Yen, H.C.: On reachability equivalence for BPP-nets. Theoretical Computer Science\u00a0179, 301\u2013317 (1997)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Application and Theory of Petri Nets and Concurrency"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07734-5_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T16:13:34Z","timestamp":1746288814000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07734-5_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319077338","9783319077345"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07734-5_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}