{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:39:17Z","timestamp":1743104357539,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642029295"},{"type":"electronic","value":"9783642029301"}],"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-02930-1_3","type":"book-chapter","created":{"date-parts":[[2009,7,2]],"date-time":"2009-07-02T11:05:04Z","timestamp":1246532704000},"page":"31-42","source":"Crossref","is-referenced-by-count":8,"title":["Deciding Safety Properties in Infinite-State Pi-Calculus via Behavioural Types"],"prefix":"10.1007","author":[{"given":"Lucia","family":"Acciai","sequence":"first","affiliation":[]},{"given":"Michele","family":"Boreale","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/978-3-540-85361-9_30","volume-title":"CONCUR 2008 - Concurrency Theory","author":"L. Acciai","year":"2008","unstructured":"Acciai, L., Boreale, M.: Spatial and behavioral types in the pi-calculus. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol.\u00a05201, pp. 372\u2013386. Springer, Heidelberg (2008) (Full version submitted, 2009)"},{"key":"3_CR2","unstructured":"Acciai, L., Boreale, M.: Deciding safety properties in infinite-state pi-calculus via behavioural types. Extended version, http:\/\/gdn.dsi.unifi.it\/~acciai\/papers\/decFull.pdf"},{"issue":"2","key":"3_CR3","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 pi-calculus. Nordic Journal of Computing\u00a09(2), 70\u2013101 (2002)","journal-title":"Nordic Journal of Computing"},{"key":"3_CR4","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)"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-540-24727-2_7","volume-title":"Foundations of Software Science and Computation Structures","author":"L. Caires","year":"2004","unstructured":"Caires, L.: Behavioural and Spatial Observations in a Logic for the pi-Calculus. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol.\u00a02987, pp. 72\u201389. Springer, Heidelberg (2004)"},{"issue":"2","key":"3_CR6","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/S0890-5401(03)00137-8","volume":"186","author":"L. Caires","year":"2003","unstructured":"Caires, L., Cardelli, L.: A spatial logic for concurrency (part I). Inf. Comput.\u00a0186(2), 194\u2013235 (2003)","journal-title":"Inf. Comput."},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Chaki, S., Rajamani, S.K., Rehof, J.: Types as models: model checking message-passing programs. In: Proc. of POPL 2002, pp. 45\u201357 (2002)","DOI":"10.1145\/503272.503278"},{"issue":"1-2","key":"3_CR8","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! Theoretical Computer Science\u00a0256(1-2), 63\u201392 (2001)","journal-title":"Theoretical Computer Science"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1112\/plms\/s3-2.1.326","volume":"2","author":"G. Higman","year":"1952","unstructured":"Higman, G.: Ordering by divisibility in abstract algebras. Proc. London Math. Soc.\u00a02, 326\u2013366 (1952)","journal-title":"Proc. London Math. Soc."},{"issue":"1-3","key":"3_CR10","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/S0304-3975(03)00325-6","volume":"311","author":"A. Igarashi","year":"2004","unstructured":"Igarashi, A., Kobayashi, N.: A generic type system for the Pi-calculus. Theoretical Computer Science\u00a0311(1-3), 121\u2013163 (2004)","journal-title":"Theoretical Computer Science"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"740","DOI":"10.1007\/978-3-540-73420-8_64","volume-title":"Automata, Languages and Programming","author":"N. Kobayashi","year":"2007","unstructured":"Kobayashi, N., Suto, T.: Undecidability of 2-Label BPP Equivalences and behavioural Type Systems for the Pi-Calculus. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 740\u2013751. Springer, Heidelberg (2007)"},{"key":"3_CR12","first-page":"210","volume":"95","author":"J.B. Kruskal","year":"1960","unstructured":"Kruskal, J.B.: Well-quasi-ordering, the tree theorem, and V\u00e1zsonyi\u2019s conjecture. Trans. American Math. Soc.\u00a095, 210\u2013225 (1960)","journal-title":"Trans. American Math. Soc."},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Milner, R.: The polyadic \u03c0-calculus: a tutorial. In: Logic and Algebra of Spec., pp. 203\u2013246 (1993)","DOI":"10.1007\/978-3-642-58041-3_6"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","first-page":"242","volume-title":"FoSSaCS 2009","author":"F. Valencia","year":"2009","unstructured":"Valencia, F., Aranda, J., Versari, C.: On the Expressive Power of Restriction and Priorities in CCS with Replication. In: de Alfaro, L. (ed.) FoSSaCS 2009. LNCS, vol.\u00a05504, pp. 242\u2013256. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02930-1_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T01:49:29Z","timestamp":1558403369000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02930-1_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642029295","9783642029301"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02930-1_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}