{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T16:48:07Z","timestamp":1742921287228,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642040801"},{"type":"electronic","value":"9783642040818"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-04081-8_31","type":"book-chapter","created":{"date-parts":[[2009,8,31]],"date-time":"2009-08-31T12:27:08Z","timestamp":1251721628000},"page":"463-480","source":"Crossref","is-referenced-by-count":15,"title":["On the Relationship between \u03c0-Calculus and Finite Place\/Transition Petri Nets"],"prefix":"10.1007","author":[{"given":"Roland","family":"Meyer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Gorrieri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"31_CR1","first-page":"70","volume":"9","author":"R. Amadio","year":"2002","unstructured":"Amadio, R., Meyssonnier, C.: On decidability of the control reachability problem in the asynchronous \u03c0-calculus. Nord. J. Comp.\u00a09(1), 70\u2013101 (2002)","journal-title":"Nord. J. Comp."},{"key":"31_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/3-540-60218-6_11","volume-title":"CONCUR \u201995 Concurrency Theory","author":"N. Busi","year":"1995","unstructured":"Busi, N., Gorrieri, R.: A Petri net semantics for \u03c0-calculus. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol.\u00a0962, pp. 145\u2013159. Springer, Heidelberg (1995)"},{"issue":"1","key":"31_CR3","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 \u03c0-calculus based on Petri nets with inhibitor arcs. J. Log. Alg. Prog.\u00a078(1), 138\u2013162 (2009)","journal-title":"J. Log. Alg. Prog."},{"key":"31_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/3-540-45061-0_12","volume-title":"Automata, Languages and Programming","author":"N. Busi","year":"2003","unstructured":"Busi, N., Gabbrielli, M., Zavattaro, G.: Replication vs. recursive definitions in channel based calculi. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 133\u2013144. Springer, Heidelberg (2003)"},{"key":"31_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-540-27836-8_28","volume-title":"Automata, Languages and Programming","author":"N. Busi","year":"2004","unstructured":"Busi, N., Gabbrielli, M., Zavattaro, G.: Comparing recursion, replication, and iteration in process calculi. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 307\u2013319. Springer, Heidelberg (2004)"},{"issue":"1","key":"31_CR6","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1006\/inco.1996.0072","volume":"129","author":"M. Dam","year":"1996","unstructured":"Dam, M.: Model checking mobile processes. Inf. Comp.\u00a0129(1), 35\u201351 (1996)","journal-title":"Inf. Comp."},{"key":"31_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/BFb0055044","volume-title":"Automata, Languages and Programming","author":"C. Dufourd","year":"1998","unstructured":"Dufourd, C., Finkel, A., Schnoebelen, P.: Reset nets between decidability and undecidability. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol.\u00a01443, pp. 103\u2013115. Springer, Heidelberg (1998)"},{"issue":"4\u20135","key":"31_CR8","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/s00165-008-0079-2","volume":"20","author":"R. Devillers","year":"2008","unstructured":"Devillers, R., Klaudel, H., Koutny, M.: A compositional Petri net translation of general \u03c0-calculus terms. For. Asp. Comp.\u00a020(4\u20135), 429\u2013450 (2008)","journal-title":"For. Asp. Comp."},{"issue":"1-2","key":"31_CR9","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/S0304-3975(97)00179-5","volume":"211","author":"J. Engelfriet","year":"1999","unstructured":"Engelfriet, J., Gelsema, T.: Multisets and structural congruence of the pi-calculus with replication. Theor. Comp. Sci.\u00a0211(1-2), 311\u2013337 (1999)","journal-title":"Theor. Comp. Sci."},{"issue":"6","key":"31_CR10","first-page":"385","volume":"40","author":"J. Engelfriet","year":"2004","unstructured":"Engelfriet, J., Gelsema, T.: A new natural structural congruence in the pi-calculus with replication. Acta Inf.\u00a040(6), 385\u2013430 (2004)","journal-title":"Acta Inf."},{"issue":"1-2","key":"31_CR11","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0304-3975(95)00118-2","volume":"153","author":"J. Engelfriet","year":"1996","unstructured":"Engelfriet, J.: A multiset semantics for the pi-calculus with replication. Theor. Comp. Sci.\u00a0153(1-2), 65\u201394 (1996)","journal-title":"Theor. Comp. Sci."},{"issue":"4","key":"31_CR12","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1145\/990010.990013","volume":"12","author":"G.-L. Ferrari","year":"2003","unstructured":"Ferrari, G.-L., Gnesi, S., Montanari, U., Pistore, M.: A model-checking verification environment for mobile processes. ACM Trans. Softw. Eng. Methodol.\u00a012(4), 440\u2013473 (2003)","journal-title":"ACM Trans. Softw. Eng. Methodol."},{"key":"31_CR13","volume-title":"Modelling Distributed Systems","author":"W. Fokkink","year":"2007","unstructured":"Fokkink, W.: Modelling Distributed Systems. Springer, Heidelberg (2007)"},{"key":"31_CR14","unstructured":"Khomenko, V., Koutny, M., Niaouris, A.: Applying Petri net unfoldings for verification of mobile systems. In: Proc. of MOCA, Bericht FBI-HH-B-267\/06, pp. 161\u2013178. University of Hamburg (2006)"},{"issue":"3","key":"31_CR15","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 J. Comp.\u00a013(3), 441\u2013460 (1984)","journal-title":"SIAM J. Comp."},{"key":"31_CR16","series-title":"IFIP","first-page":"477","volume-title":"Proc. of IFIP TCS","author":"R. Meyer","year":"2008","unstructured":"Meyer, R.: On boundedness in depth in the \u03c0-calculus. In: Proc. of IFIP TCS. IFIP, vol.\u00a0273, pp. 477\u2013489. Springer, Heidelberg (2008)"},{"key":"31_CR17","unstructured":"Meyer, R.: Structural Stationarity in the \u03c0-calculus. PhD thesis, Department of Computing Science, University of Oldenburg (2008)"},{"issue":"2","key":"31_CR18","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 \u03c0-calculus. Acta Inf.\u00a046(2), 87\u2013137 (2009)","journal-title":"Acta Inf."},{"key":"31_CR19","volume-title":"Communication and concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and concurrency. Prentice Hall, Englewood Cliffs (1989)"},{"key":"31_CR20","volume-title":"Communicating and Mobile Systems: the \u03c0-Calculus","author":"R. Milner","year":"1999","unstructured":"Milner, R.: Communicating and Mobile Systems: the \u03c0-Calculus. CUP, Cambridge (1999)"},{"key":"31_CR21","volume-title":"Computation: Finite and Infinite Machines","author":"M. Minsky","year":"1967","unstructured":"Minsky, M.: Computation: Finite and Infinite Machines. Prentice Hall, Englewood Cliffs (1967)"},{"key":"31_CR22","doi-asserted-by":"crossref","unstructured":"Meyer, R., Khomenko, V., Strazny, T.: A practical approach to verification of mobile systems using net unfoldings. Fund. Inf. (to appear 2009)","DOI":"10.1007\/978-3-540-68746-7_22"},{"key":"31_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/3-540-60218-6_4","volume-title":"CONCUR \u201995 Concurrency Theory","author":"U. Montanari","year":"1995","unstructured":"Montanari, U., Pistore, M.: Checking bisimilarity for finitary \u03c0-calculus. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol.\u00a0962, pp. 42\u201356. Springer, Heidelberg (1995)"},{"key":"31_CR24","unstructured":"Petruchio (2008), \n                    \n                      http:\/\/petruchio.informatik.uni-oldenburg.de"},{"key":"31_CR25","unstructured":"Pistore, M.: History Dependent Automata. PhD thesis, Dipartimento di Informatica, Universit\u00e0 di Pisa (1999)"},{"key":"31_CR26","volume-title":"The \u03c0-calculus: a Theory of Mobile Processes","author":"D. Sangiorgi","year":"2001","unstructured":"Sangiorgi, D., Walker, D.: The \u03c0-calculus: a Theory of Mobile Processes. CUP, Cambridge (2001)"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2009 - Concurrency Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04081-8_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:28:27Z","timestamp":1558268907000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04081-8_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642040801","9783642040818"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04081-8_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}