{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T18:04:02Z","timestamp":1725732242301},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642386961"},{"type":"electronic","value":"9783642386978"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38697-8_5","type":"book-chapter","created":{"date-parts":[[2013,6,19]],"date-time":"2013-06-19T01:48:46Z","timestamp":1371606526000},"page":"70-89","source":"Crossref","is-referenced-by-count":3,"title":["Results on Equivalence, Boundedness, Liveness, and Covering Problems of BPP-Petri Nets"],"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":"5_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":"5_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":"5_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"},{"key":"5_CR4","first-page":"169","volume":"72","author":"J. Esparza","year":"2000","unstructured":"Esparza, J., Rossmanith, P., Schwoon, S.: A uniform framework for problems on context-free grammars. EATCS Bulletin\u00a072, 169\u2013177 (2000)","journal-title":"EATCS Bulletin"},{"key":"5_CR5","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":"5_CR6","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":"5_CR7","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)"},{"issue":"2","key":"5_CR8","doi-asserted-by":"publisher","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. Journal of Computer and System Sciences\u00a03(2), 147\u2013195 (1969)","journal-title":"Journal of Computer and System Sciences"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/3-540-62034-6_42","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"A. Ku\u010dera","year":"1996","unstructured":"Ku\u010dera, A.: Regularity is decidable for normed PA processes in polynomial time. In: Chandru, V., Vinay, V. (eds.) FSTTCS 1996. LNCS, vol.\u00a01180, pp. 111\u2013122. Springer, Heidelberg (1996)"},{"key":"5_CR10","doi-asserted-by":"publisher","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. ACM\u00a025, 352\u2013364 (1978)","journal-title":"J. ACM"},{"key":"5_CR11","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)"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Mayr, E.W., Weihmann, J.: Results on equivalence, boundedness, liveness, and covering problems of BPP-Petri nets. Technical Report TUM-I1325, Institut f\u00fcr Informatik, TU M\u00fcnchen (March 2013)","DOI":"10.1007\/978-3-642-38697-8_5"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/BFb0027420","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"R. Mayr","year":"1997","unstructured":"Mayr, R.: Tableau methods for PA-processes. In: Galmiche, D. (ed.) TABLEAUX 1997. LNCS, vol.\u00a01227, pp. 276\u2013290. Springer, Heidelberg (1997)"},{"key":"5_CR14","unstructured":"Mayr, R.: Decidability and Complexity of Model Checking Problems for Infinite-State Systems. PhD thesis, Technische Universitt Mijnchen (1998)"},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/3-540-45022-X_29","volume-title":"Automata, Languages and Programming","author":"R. Mayr","year":"2000","unstructured":"Mayr, R.: On the complexity of bisimulation problems for basic parallel processes. In: Montanari, U., Rolim, J.D.P., Welzl, E. (eds.) ICALP 2000. LNCS, vol.\u00a01853, pp. 329\u2013341. Springer, Heidelberg (2000)"},{"issue":"4","key":"5_CR16","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1109\/5.24143","volume":"77","author":"T. Murata","year":"1989","unstructured":"Murata, T.: Petri nets: Properties, analysis and applications. Proceedings of the IEEE\u00a077(4), 541\u2013580 (1989)","journal-title":"Proceedings of the IEEE"},{"key":"5_CR17","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)"},{"issue":"2","key":"5_CR18","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R. Tarjan","year":"1972","unstructured":"Tarjan, R.: Depth-first search and linear graph algorithms. SIAM Journal on Computing\u00a01(2), 146\u2013160 (1972)","journal-title":"SIAM Journal on Computing"},{"issue":"1-2","key":"5_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(1-2), 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-642-38697-8_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,28]],"date-time":"2020-07-28T18:45:09Z","timestamp":1595961909000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38697-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642386961","9783642386978"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38697-8_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}