{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:20:53Z","timestamp":1742973653374,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642153488"},{"type":"electronic","value":"9783642153495"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15349-5_11","type":"book-chapter","created":{"date-parts":[[2010,8,21]],"date-time":"2010-08-21T03:39:27Z","timestamp":1282361967000},"page":"161-175","source":"Crossref","is-referenced-by-count":1,"title":["Depth Boundedness in Multiset Rewriting Systems with Name Binding"],"prefix":"10.1007","author":[{"given":"Fernando","family":"Rosa-Velardo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"11_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1998.2740","volume":"148","author":"M. Abadi","year":"1999","unstructured":"Abadi, M., Gordon, A.D.: A Calculus for Cryptographic Protocols: The spi Calculus. Inf. Comput.\u00a0148(1), 1\u201370 (1999)","journal-title":"Inf. Comput."},{"issue":"1-2","key":"11_CR2","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1006\/inco.1999.2843","volume":"160","author":"P.A. Abdulla","year":"2000","unstructured":"Abdulla, P.A., Cerans, K., Jonsson, B., Tsay, Y.K.: Algorithmic analysis of programs with well quasi-ordered domains. Inf. Comput.\u00a0160(1-2), 109\u2013127 (2000)","journal-title":"Inf. Comput."},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-642-04081-8_8","volume-title":"CONCUR 2009","author":"P. Baldan","year":"2009","unstructured":"Baldan, P., Bonchi, F., Gadducci, F.: Encoding asynchronous interactions using open Petri nets. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol.\u00a05710, pp. 99\u2013114. Springer, Heidelberg (2009)"},{"issue":"3","key":"11_CR4","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/j.jlap.2008.08.002","volume":"78","author":"N. Busi","year":"2009","unstructured":"Busi, N., Gorrieri, R.: Distributed semantics for the pi-calculus based on Petri nets with inhibitor arcs. J. Log. Algebr. Program.\u00a078(3), 138\u2013162 (2009)","journal-title":"J. Log. Algebr. Program."},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/3-540-45116-1_18","volume-title":"Information Assurance in Computer Networks. Methods, Models and Architectures for Network Security","author":"I. Cervesato","year":"2001","unstructured":"Cervesato, I.: Typed MSR: Syntax and Examples. In: Gorodetski, V.I., Skormin, V.A., Popyack, L.J. (eds.) MMM-ACNS 2001. LNCS, vol.\u00a02052, pp. 159\u2013177. Springer, Heidelberg (2001)"},{"key":"11_CR6","unstructured":"Cervesato, I., Durgin, N.A., Lincoln, P., Mitchell, J.C., Scedrov, A.: A meta-notation for protocol analysis. In: CSFW, pp. 55\u201369 (1999)"},{"key":"11_CR7","first-page":"249","volume-title":"IEEE SCC","author":"G. Decker","year":"2008","unstructured":"Decker, G., Weske, M.: Instance isolation analysis for service-oriented architectures. In: IEEE SCC, vol.\u00a0(1), pp. 249\u2013256. IEEE Computer Society, Los Alamitos (2008)"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Delzanno, G.: An overview of MSR(C): A CLP-based framework for the symbolic verification of parameterized concurrent systems. Electr. Notes Theor. Comput. Sci, vol.\u00a076 (2002)","DOI":"10.1016\/S1571-0661(04)80786-2"},{"key":"11_CR9","unstructured":"Delzanno, G.: Constraint multiset rewriting. Technical Report DISI-TR-05-08, University of Genova (2005)"},{"issue":"1-2","key":"11_CR10","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-2), 63\u201392 (2001)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"11_CR11","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1016\/j.jcss.2005.09.001","volume":"72","author":"G. Geeraerts","year":"2006","unstructured":"Geeraerts, G., Raskin, J.F., Begin, L.V.: Expand, enlarge and check: New algorithms for the coverability problem of wsts. J. Comput. Syst. Sci.\u00a072(1), 180\u2013203 (2006)","journal-title":"J. Comput. Syst. Sci."},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/3-540-45608-2_5","volume-title":"Foundations of Security Analysis and Design","author":"A.D. Gordon","year":"2001","unstructured":"Gordon, A.D.: Notes on nominal calculi for security and mobility. In: Focardi, R., Gorrieri, R. (eds.) FOSAD 2000. LNCS, vol.\u00a02171, pp. 262\u2013330. Springer, Heidelberg (2001)"},{"key":"11_CR13","series-title":"IFIP","first-page":"477","volume-title":"IFIP TCS","author":"R. Meyer","year":"2008","unstructured":"Meyer, R.: On boundedness in Depth in the pi-calculus. In: Ausiello, G., Karhum\u00e4ki, J., Mauri, G., Ong, C.H.L. (eds.) IFIP TCS. IFIP, vol.\u00a0273, pp. 477\u2013489. Springer, Heidelberg (2008)"},{"issue":"2","key":"11_CR14","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s00236-009-0091-x","volume":"46","author":"R. Meyer","year":"2009","unstructured":"Meyer, R.: A theory of structural stationarity in the pi-calculus. Acta Inf.\u00a046(2), 87\u2013137 (2009)","journal-title":"Acta Inf."},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-642-04081-8_31","volume-title":"CONCUR 2009","author":"R. Meyer","year":"2009","unstructured":"Meyer, R., Gorrieri, R.: On the relationship between pi-calculus and finite place\/transition Petri nets. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol.\u00a05710, pp. 463\u2013480. Springer, Heidelberg (2009)"},{"key":"11_CR16","volume-title":"8th International Workshop on Rewriting Logic and its Applications, WRLA 2010","author":"F. Rosa-Velardo","year":"2010","unstructured":"Rosa-Velardo, F.: Multiset rewriting: a semantic framework for concurrency with name binding. In: 8th International Workshop on Rewriting Logic and its Applications, WRLA 2010. Springer, Heidelberg (to appear, 2010)"},{"issue":"3","key":"11_CR17","first-page":"329","volume":"88","author":"F. Rosa-Velardo","year":"2008","unstructured":"Rosa-Velardo, F., de Frutos-Escrig, D.: Name creation vs. replication in Petri net systems\u00a088(3), 329\u2013356 (2008)","journal-title":"replication in Petri net systems"},{"key":"11_CR18","unstructured":"Rosa-Velardo, F., de Frutos-Escrig, D.: Decidability problems in Petri nets with name creation and replication (submitted)"},{"issue":"1","key":"11_CR19","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.entcs.2005.05.048","volume":"180","author":"F. Rosa-Velardo","year":"2007","unstructured":"Rosa-Velardo, F., de Frutos-Escrig, D., Alonso, O.M.: On the expressiveness of Mobile Synchronizing Petri Nets. Electr. Notes Theor. Comput. Sci.\u00a0180(1), 77\u201394 (2007)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"11_CR20","volume-title":"The pi-calculus: a Theory of Mobile Processes","author":"D. Sangiorgi","year":"2001","unstructured":"Sangiorgi, D., Walker, D.: The pi-calculus: a Theory of Mobile Processes. Cambridge University Press, Cambridge (2001)"},{"issue":"1-3","key":"11_CR21","doi-asserted-by":"crossref","first-page":"171","DOI":"10.3233\/FI-2009-0095","volume":"93","author":"K.M. van Hee","year":"2009","unstructured":"van Hee, K.M., Sidorova, N., Voorhoeve, M., van der Werf, J.M.E.M.: Generation of database transactions with petri nets. Fundam. Inform.\u00a093(1-3), 171\u2013184 (2009)","journal-title":"Fundam. Inform."},{"key":"11_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-642-12032-9_8","volume-title":"Foundations of Software Science and Computational Structures","author":"T. Wies","year":"2010","unstructured":"Wies, T., Zufferey, D., Henzinger, T.A.: Forward analysis of depth-bounded processes. In: Ong, L. (ed.) FOSSACS 2010. LNCS, vol.\u00a06014, pp. 94\u2013108. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15349-5_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,16]],"date-time":"2023-02-16T19:21:36Z","timestamp":1676575296000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-15349-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642153488","9783642153495"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15349-5_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}