{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T22:15:44Z","timestamp":1725747344544},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642410352"},{"type":"electronic","value":"9783642410369"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41036-9_19","type":"book-chapter","created":{"date-parts":[[2013,9,3]],"date-time":"2013-09-03T09:49:49Z","timestamp":1378201789000},"page":"209-221","source":"Crossref","is-referenced-by-count":2,"title":["Completeness Results for Generalized Communication-Free Petri Nets with Arbitrary Edge Multiplicities"],"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":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/BFb0084789","volume-title":"CONCUR \u201992","author":"S. Christensen","year":"1992","unstructured":"Christensen, S.: Distributed bisimularity is decidable for a class of infinite state-space systems. In: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol.\u00a0630, pp. 148\u2013161. Springer, Heidelberg (1992)"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/3-540-57208-2_11","volume-title":"CONCUR\u201993","author":"S. Christensen","year":"1993","unstructured":"Christensen, S., Hirshfeld, Y., Moller, F.: Bisimulation equivalence is decidable for basic parallel processes. In: Best, E. (ed.) CONCUR 1993. LNCS, vol.\u00a0715, pp. 143\u2013157. Springer, Heidelberg (1993)"},{"issue":"1","key":"19_CR3","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":"19_CR4","first-page":"143","volume":"30","author":"J. Esparza","year":"1994","unstructured":"Esparza, J., Nielsen, M.: Decibility issues for Petri nets - a survey. Journal of Informatik Processing and Cybernetics\u00a030(3), 143\u2013160 (1994)","journal-title":"Journal of Informatik Processing and Cybernetics"},{"key":"19_CR5","unstructured":"Ha, L.M., Trung, P.V., Duong, P.T.H.: A polynomial-time algorithm for reachability problem of a subclass of Petri net and chip firing games. In: 2012 IEEE RIVF International Conference on Computing and Communication Technologies, Research, Innovation, and Vision for the Future (RIVF), pp. 1\u20136 (2012)"},{"issue":"2","key":"19_CR6","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":"19_CR7","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":"19_CR8","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.A., Demetrovics, J. (eds.) FCT 1989. LNCS, vol.\u00a0380, pp. 234\u2013243. Springer, Heidelberg (1989)"},{"key":"19_CR9","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.W., van Leeuwen, J. (eds.) ICALP 1980. LNCS, vol.\u00a085, pp. 324\u2013337. Springer, Heidelberg (1980)"},{"issue":"1","key":"19_CR10","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0019-9958(83)80022-9","volume":"57","author":"D.T. Huynh","year":"1983","unstructured":"Huynh, D.T.: Commutative grammars: The complexity of uniform word problems. Information and Control\u00a057(1), 21\u201339 (1983)","journal-title":"Information and Control"},{"key":"19_CR11","unstructured":"Huynh, D.T.: A simple proof for the sum upper bound of the inequivalence problem for semilinear sets. Elektronische Informationsverarbeitung und Kybernetik, 147\u2013156 (1986)"},{"key":"19_CR12","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1145\/800076.802477","volume-title":"Proceedings of the Thirteenth Annual ACM Symposium on Theory of Computing, STOC 1981","author":"E.W. Mayr","year":"1981","unstructured":"Mayr, E.W.: An algorithm for the general Petri net reachability problem. In: Proceedings of the Thirteenth Annual ACM Symposium on Theory of Computing, STOC 1981, pp. 238\u2013246. ACM, New York (1981)"},{"issue":"3","key":"19_CR13","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":"19_CR14","doi-asserted-by":"crossref","unstructured":"Mayr, E.W., Weihmann, J.: Completeness Results for Generalized Communication-free Petri Nets with Arbitrary Edge Multiplicities. Technical Report TUM-I1335, Institut f\u00fcr Informatik, TU M\u00fcnchen (Jul 2013)","DOI":"10.1007\/978-3-642-41036-9_19"},{"key":"19_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-642-38697-8_5","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"E.W. Mayr","year":"2013","unstructured":"Mayr, E.W., Weihmann, J.: Results on equivalence, boundedness, liveness, and covering problems of BPP-Petri nets. In: Colom, J.-M., Desel, J. (eds.) PETRI NETS 2013. LNCS, vol.\u00a07927, pp. 70\u201389. Springer, Heidelberg (2013)"},{"key":"19_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/3-540-53904-2_94","volume-title":"Rewriting Techniques and Applications","author":"L. Pottier","year":"1991","unstructured":"Pottier, L.: Minimal solutions of linear diophantine systems: bounds and algorithms. In: Book, R.V. (ed.) RTA 1991. LNCS, vol.\u00a0488, pp. 162\u2013173. Springer, Heidelberg (1991)"},{"key":"19_CR17","doi-asserted-by":"publisher","first-page":"3216","DOI":"10.1093\/ietfec\/e89-a.11.3216","volume":"E89-A","author":"S. Taoka","year":"2006","unstructured":"Taoka, S., Watanabe, T.: Time complexity analysis of the legal firing sequence problem of Petri nets with inhibitor arcs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci.\u00a0E89-A, 3216\u20133226 (2006)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"issue":"1-2","key":"19_CR18","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(1-2), 301\u2013317 (1997)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41036-9_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,3]],"date-time":"2020-08-03T02:13:33Z","timestamp":1596420813000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41036-9_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642410352","9783642410369"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41036-9_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}