{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T09:30:43Z","timestamp":1725701443025},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642329395"},{"type":"electronic","value":"9783642329401"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32940-1_31","type":"book-chapter","created":{"date-parts":[[2012,9,1]],"date-time":"2012-09-01T20:47:02Z","timestamp":1346532422000},"page":"440-455","source":"Crossref","is-referenced-by-count":5,"title":["A Polynomial Translation of \u03c0-Calculus (FCP) to Safe Petri Nets"],"prefix":"10.1007","author":[{"given":"Roland","family":"Meyer","sequence":"first","affiliation":[]},{"given":"Victor","family":"Khomenko","sequence":"additional","affiliation":[]},{"given":"Reiner","family":"H\u00fcchting","sequence":"additional","affiliation":[]}],"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","doi-asserted-by":"crossref","unstructured":"Best, E., Devillers, R., Koutny, M.: Petri Net Algebra. Monographs in Theoretical Computer Science. An EATCS Series. Springer (2001)","DOI":"10.1007\/978-3-662-04457-5"},{"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."},{"issue":"1","key":"31_CR4","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."},{"issue":"4-5","key":"31_CR5","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-5), 429\u2013450 (2008)","journal-title":"For. Asp. Comp."},{"key":"31_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/3-540-65306-6_20","volume-title":"Lectures on Petri Nets I: Basic Models","author":"J. Esparza","year":"1998","unstructured":"Esparza, J.: Decidability and Complexity of Petri Net Problems\u2014An Introduction. In: Reisig, W., Rozenberg, G. (eds.) APN 1998. LNCS, vol.\u00a01491, pp. 374\u2013428. Springer, Heidelberg (1998)"},{"issue":"4","key":"31_CR7","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_CR8","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)"},{"key":"31_CR9","doi-asserted-by":"crossref","unstructured":"Khomenko, V., Meyer, R.: Checking \u03c0-calculus structural congruence is graph isomorphism complete. In: Proc. of ACSD, pp. 70\u201379. IEEE Computer Society Press (2009)","DOI":"10.1109\/ACSD.2009.8"},{"key":"31_CR10","series-title":"IFIP","first-page":"477","volume-title":"IFIP TCS 2008","author":"R. Meyer","year":"2008","unstructured":"Meyer, R.: On Boundedness in Depth in the \u03c0-Calculus. In: Ausiello, G., Karhum\u00e4ki, J., Mauri, G., Ong, L. (eds.) IFIP TCS 2008. IFIP, vol.\u00a0273, pp. 477\u2013489. Springer, Boston (2008)"},{"issue":"2","key":"31_CR11","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_CR12","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 - Concurrency Theory","author":"R. Meyer","year":"2009","unstructured":"Meyer, R., Gorrieri, R.: On the Relationship between \u03c0-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":"31_CR13","doi-asserted-by":"crossref","unstructured":"Meyer, R., Khomenko, V., H\u00fcchting, R.: A polynomial translation of \u03c0-calculus (FCP) to safe Petri nets. Technical Report CS-TR-1323, Newcastle Univ. (2012)","DOI":"10.1007\/978-3-642-32940-1_31"},{"key":"31_CR14","doi-asserted-by":"crossref","first-page":"439","DOI":"10.3233\/FI-2009-138","volume":"94","author":"R. Meyer","year":"2009","unstructured":"Meyer, R., Khomenko, V., Strazny, T.: A practical approach to verification of mobile systems using net unfoldings. Fundam. Inf.\u00a094, 439\u2013471 (2009)","journal-title":"Fundam. Inf."},{"key":"31_CR15","unstructured":"Milner, R.: Communicating and Mobile Systems: the \u03c0-Calculus. CUP (1999)"},{"key":"31_CR16","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)"},{"issue":"6","key":"31_CR17","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/BF01211473","volume":"4","author":"F. Orava","year":"1992","unstructured":"Orava, F., Parrow, J.: An algebraic verification of a mobile network. For. Asp. Comp.\u00a04(6), 497\u2013543 (1992)","journal-title":"For. Asp. Comp."},{"key":"31_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-642-21834-7_12","volume-title":"Applications and Theory of Petri Nets","author":"F. Peschanski","year":"2011","unstructured":"Peschanski, F., Klaudel, H., Devillers, R.: A Petri Net Interpretation of Open Reconfigurable Systems. In: Kristensen, L.M., Petrucci, L. (eds.) PETRI NETS 2011. LNCS, vol.\u00a06709, pp. 208\u2013227. Springer, Heidelberg (2011)"},{"key":"31_CR19","unstructured":"Pistore, M.: History Dependent Automata. PhD thesis, Dipartimento di Informatica, Universit\u00e0 di Pisa (1999)"},{"key":"31_CR20","unstructured":"Sangiorgi, D., Walker, D.: The \u03c0-calculus: a Theory of Mobile Processes. CUP (2001)"},{"key":"31_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1007\/3-540-58179-0_73","volume-title":"Computer Aided Verification","author":"B. Victor","year":"1994","unstructured":"Victor, B., Moller, F.: The Mobility Workbench: A Tool for the \u03c0-Calculus. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol.\u00a0818, pp. 428\u2013440. Springer, Heidelberg (1994)"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2012 \u2013 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32940-1_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:49:39Z","timestamp":1620128979000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32940-1_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642329395","9783642329401"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32940-1_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}