{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T06:33:24Z","timestamp":1794378804258,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642142949","type":"print"},{"value":"9783642142956","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14295-6_19","type":"book-chapter","created":{"date-parts":[[2010,7,8]],"date-time":"2010-07-08T18:36:09Z","timestamp":1278614169000},"page":"175-179","source":"Crossref","is-referenced-by-count":14,"title":["Petruchio: From Dynamic Networks to Nets"],"prefix":"10.1007","author":[{"given":"Roland","family":"Meyer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tim","family":"Strazny","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/978-3-540-70545-1_33","volume-title":"Computer Aided Verification","author":"P.A. Abdulla","year":"2008","unstructured":"Abdulla, P.A., Bouajjani, A., Cederberg, J., Haziza, F., Rezine, A.: Monotonic abstraction for programs with dynamic memory heaps. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol.\u00a05123, pp. 341\u2013354. Springer, Heidelberg (2008)"},{"issue":"1-2","key":"19_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., \u010cerans, K., Jonsson, B., Tsay, Y.-K.: Algorithmic analysis of programs with well quasi-ordered domains. Inf. Comp.\u00a0160(1-2), 109\u2013127 (2000)","journal-title":"Inf. Comp."},{"issue":"1","key":"19_CR3","first-page":"138","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. JLAP\u00a078(1), 138\u2013162 (2009)","journal-title":"JLAP"},{"issue":"4-5","key":"19_CR4","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."},{"issue":"1-2","key":"19_CR5","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! TCS\u00a0256(1-2), 63\u201392 (2001)","journal-title":"TCS"},{"key":"19_CR6","unstructured":"HAL, \n                    \n                      http:\/\/fmt.isti.cnr.it:8080\/hal\/"},{"key":"19_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-540-28644-8_21","volume-title":"CONCUR 2004 - Concurrency Theory","author":"D. Hirschkoff","year":"2004","unstructured":"Hirschkoff, D.: An extensional spatial logic for mobile processes. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol.\u00a03170, pp. 325\u2013339. Springer, Heidelberg (2004)"},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/978-3-540-70545-1_21","volume-title":"Computer Aided Verification","author":"S. Joshi","year":"2008","unstructured":"Joshi, S., K\u00f6nig, B.: Applying the graph minor theorem to the verification of graph transformation systems. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol.\u00a05123, pp. 214\u2013226. Springer, Heidelberg (2008)"},{"key":"19_CR9","unstructured":"Khomenko, V., Koutny, M., Niaouris, A.: Applying Petri net unfoldings for verification of mobile systems. In: MOCA, Bericht FBI-HH-B-267\/06, pp. 161\u2013178. University of Hamburg (2006)"},{"key":"19_CR10","first-page":"70","volume-title":"ACSD","author":"V. Khomenko","year":"2009","unstructured":"Khomenko, V., Meyer, R.: Checking \u03c0-calculus structural congruence is graph isomorphism complete. In: ACSD, pp. 70\u201379. IEEE, Los Alamitos (2009)"},{"key":"19_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/11691372_13","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"B. K\u00f6nig","year":"2006","unstructured":"K\u00f6nig, B., Kozioura, V.: Counterexample-guided abstraction refinement for the analysis of graph transformation systems. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol.\u00a03920, pp. 197\u2013211. Springer, Heidelberg (2006)"},{"issue":"5","key":"19_CR12","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.ipl.2007.04.002","volume":"103","author":"B. K\u00f6nig","year":"2007","unstructured":"K\u00f6nig, B., Kozioura, V.: Incremental construction of coverability graphs. IPL\u00a0103(5), 203\u2013209 (2007)","journal-title":"IPL"},{"key":"19_CR13","unstructured":"Model Checking Kit, \n                    \n                      http:\/\/www.fmi.uni-stuttgart.de\/szs\/tools\/mckit\/"},{"issue":"2","key":"19_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 \u03c0-calculus. Acta Inf.\u00a046(2), 87\u2013137 (2009)","journal-title":"Acta Inf."},{"key":"19_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 \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)"},{"issue":"3-4","key":"19_CR16","first-page":"439","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. Fund. Inf.\u00a094(3-4), 439\u2013471 (2009)","journal-title":"Fund. Inf."},{"key":"19_CR17","unstructured":"NAUTY, \n                    \n                      http:\/\/cs.anu.edu.au\/~bdm\/nauty\/"},{"issue":"6","key":"19_CR18","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":"19_CR19","unstructured":"Petruchio, \n                    \n                      http:\/\/petruchio.informatik.uni-oldenburg.de"},{"key":"19_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/978-3-540-24725-8_28","volume-title":"Programming Languages and Systems","author":"A. Rensink","year":"2004","unstructured":"Rensink, A.: Canonical graph shapes. In: Schmidt, D. (ed.) ESOP 2004. LNCS, vol.\u00a02986, pp. 401\u2013415. Springer, Heidelberg (2004)"},{"issue":"3","key":"19_CR21","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1145\/514188.514190","volume":"24","author":"S. Sagiv","year":"2002","unstructured":"Sagiv, S., Reps, T.W., Wilhelm, R.: Parametric shape analysis via 3-valued logic. ACM TOPLAS\u00a024(3), 217\u2013298 (2002)","journal-title":"ACM TOPLAS"},{"key":"19_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-540-78800-3_3","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"M. Saksena","year":"2008","unstructured":"Saksena, M., Wibling, O., Jonsson, B.: Graph grammar modeling and verification of ad hoc routing protocols. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol.\u00a04963, pp. 18\u201332. Springer, Heidelberg (2008)"},{"key":"19_CR23","unstructured":"Spatial Logic Model Checker, \n                    \n                      http:\/\/ctp.di.fct.unl.pt\/SLMC\/"},{"key":"19_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1007\/978-3-642-12032-9_8","volume-title":"FoSSaCS","author":"T. Wies","year":"2010","unstructured":"Wies, T., Zuffrey, 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","Computer Aided Verification"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14295-6_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T15:51:13Z","timestamp":1558281073000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14295-6_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642142949","9783642142956"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14295-6_19","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-642-14295-6","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}