{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T06:05:32Z","timestamp":1725602732839},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642232169"},{"type":"electronic","value":"9783642232176"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-23217-6_25","type":"book-chapter","created":{"date-parts":[[2011,8,25]],"date-time":"2011-08-25T09:14:02Z","timestamp":1314263642000},"page":"373-388","source":"Crossref","is-referenced-by-count":3,"title":["The\u00a0Decidability\u00a0of the\u00a0Reachability\u00a0Problem\u00a0for\u00a0CCS!"],"prefix":"10.1007","author":[{"given":"Chaodong","family":"He","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"25_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)"},{"key":"25_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-642-02930-1_3","volume-title":"Automata, Languages and Programming","author":"L. Acciai","year":"2009","unstructured":"Acciai, L., Boreale, M.: Deciding safety properties in infinite-state pi-calculus via behavioural types. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol.\u00a05556, pp. 31\u201342. Springer, Heidelberg (2009)"},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/978-3-540-76637-7_26","volume-title":"Programming Languages and Systems","author":"J. Aranda","year":"2007","unstructured":"Aranda, J., Di Giusto, C., Nielsen, M., Valencia, F.D.: CCS with replication in the chomsky hierarchy: The expressive power of divergence. In: Shao, Z. (ed.) APLAS 2007. LNCS, vol.\u00a04807, pp. 383\u2013398. Springer, Heidelberg (2007)"},{"key":"25_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/978-3-642-00596-1_18","volume-title":"Foundations of Software Science and Computational Structures","author":"J. Aranda","year":"2009","unstructured":"Aranda, J., Valencia, F.D., 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)"},{"key":"25_CR5","doi-asserted-by":"crossref","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)","DOI":"10.1007\/3-540-45061-0_12"},{"key":"25_CR6","doi-asserted-by":"crossref","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)","DOI":"10.1007\/978-3-540-27836-8_28"},{"issue":"6","key":"25_CR7","doi-asserted-by":"publisher","first-page":"1191","DOI":"10.1017\/S096012950999017X","volume":"19","author":"N. Busi","year":"2009","unstructured":"Busi, N., Gabbrielli, M., Zavattaro, G.: On the expressive power of recursion, replication and iteration in process calculi. Mathematical Structures in Computer Science\u00a019(6), 1191\u20131222 (2009)","journal-title":"Mathematical Structures in Computer Science"},{"key":"25_CR8","series-title":"Lecture Notes in Computer Science","volume-title":"Object-Oriented Programming","author":"N. Busi","year":"1994","unstructured":"Busi, N., Gorrieri, R.: Distributed conflicts in communicating systems. In: Pareschi, R. (ed.) ECOOP 1994. LNCS, vol.\u00a0821, pp. 49\u201365. Springer, Heidelberg (1994)"},{"key":"25_CR9","unstructured":"Fu, Y.: Theory of interaction (2011), Submitted and downloadable at http:\/\/basics.sjtu.edu.cn\/~yuxi\/"},{"issue":"11-13","key":"25_CR10","doi-asserted-by":"publisher","first-page":"1387","DOI":"10.1016\/j.tcs.2009.11.011","volume":"411","author":"Y. Fu","year":"2010","unstructured":"Fu, Y., Lu, H.: On the expressiveness of interaction. Theor. Comput. Sci.\u00a0411(11-13), 1387\u20131451 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Giambiagi, P., Schneider, G., Valencia, F.D.: On the expressiveness of infinite behavior and name scoping in process calculi. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol.\u00a02987, pp. 226\u2013240. Springer, Heidelberg (2004)","DOI":"10.1007\/978-3-540-24727-2_17"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Goltz, U.: CCS and petri nets. In: Semantics of Systems of Concurrent Processes, pp. 334\u2013357 (1990)","DOI":"10.1007\/3-540-53479-2_14"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"He, C.: The decidability of the reachability problem for CCS! (2011), Downloadable at http:\/\/basics.sjtu.edu.cn\/~chaodong\/","DOI":"10.1007\/978-3-642-23217-6_25"},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"He, C., Fu, Y., Fu, H.: Decidability of behavioral equivalences in process calculi with name scoping. In: FSEN (2011)","DOI":"10.1007\/978-3-642-29320-7_19"},{"key":"25_CR15","series-title":"Lecture Notes in Computer Science","volume-title":"CONCUR \u201995 Concurrency Theory","author":"P. Jancar","year":"1995","unstructured":"Jancar, P., Moller, F.: Checking regular properties of petri nets. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol.\u00a0962, pp. 348\u2013362. Springer, Heidelberg (1995)"},{"key":"25_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/978-3-540-28644-8_23","volume-title":"CONCUR 2004 - Concurrency Theory","author":"M. K\u0159et\u00ednsk\u00fd","year":"2004","unstructured":"K\u0159et\u00ednsk\u00fd, M., \u0158eh\u00e1k, V., Strej\u010dek, J.: Extended process rewrite systems: Expressiveness and reachability. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol.\u00a03170, pp. 355\u2013370. Springer, Heidelberg (2004)"},{"key":"25_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/11590156_17","volume-title":"FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science","author":"M. K\u0159et\u00ednsk\u00fd","year":"2005","unstructured":"K\u0159et\u00ednsk\u00fd, M., \u0158eh\u00e1k, V., Strej\u010dek, J.: Reachability of hennessy-milner properties for weakly extended PRS. In: Sarukkai, S., Sen, S. (eds.) FSTTCS 2005. LNCS, vol.\u00a03821, pp. 213\u2013224. Springer, Heidelberg (2005)"},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"Mayr, E.W.: An algorithm for the general petri net reachability problem. In: STOC, pp. 238\u2013246 (1981)","DOI":"10.1145\/800076.802477"},{"issue":"1-2","key":"25_CR19","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1006\/inco.1999.2826","volume":"156","author":"R. Mayr","year":"2000","unstructured":"Mayr, R.: Process rewrite systems. Inf. Comput.\u00a0156(1-2), 264\u2013286 (2000)","journal-title":"Inf. Comput."},{"key":"25_CR20","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall, Inc., Upper Saddle River (1989)"},{"key":"25_CR21","unstructured":"Milner, R.: Communicating and Mobile Systems: the \u03c0-calculus. Cambridge University Press, Cambridge (1999)"},{"key":"25_CR22","doi-asserted-by":"crossref","unstructured":"Park, D.M.R.: Concurrency and automata on infinite sequences. Theoretical Computer Science, 167\u2013183 (1981)","DOI":"10.1007\/BFb0017309"},{"key":"25_CR23","doi-asserted-by":"crossref","unstructured":"Taubner, D.: Finite Representations of CCS and TCSP Programs by Automata and Petri Nets. LNCS, vol.\u00a0369. Springer, Heidelberg (1989)","DOI":"10.1007\/3-540-51525-9"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2011 \u2013 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23217-6_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T07:45:18Z","timestamp":1560498318000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23217-6_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642232169","9783642232176"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23217-6_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}