{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:53:48Z","timestamp":1762458828733},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642141614"},{"type":"electronic","value":"9783642141621"}],"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-14162-1_38","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T05:26:21Z","timestamp":1278307581000},"page":"454-465","source":"Crossref","is-referenced-by-count":1,"title":["On Bisimilarity and Substitution in Presence of Replication"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Hirschkoff","sequence":"first","affiliation":[]},{"given":"Damien","family":"Pous","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"38_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/11601548_18","volume-title":"Processes, Terms and Cycles: Steps on the Road to Infinity","author":"L. Aceto","year":"2005","unstructured":"Aceto, L., Fokkink, W.J., Ingolfsdottir, A., Luttik, B.: Finite equational bases in process algebra: Results and open questions. In: Middeldorp, A., van Oostrom, V., van Raamsdonk, F., de Vrijer, R. (eds.) Processes, Terms and Cycles: Steps on the Road to Infinity. LNCS, vol.\u00a03838, pp. 338\u2013367. Springer, Heidelberg (2005)"},{"key":"38_CR2","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0304-3975(97)00125-4","volume":"198","author":"M. Boreale","year":"1998","unstructured":"Boreale, M., Sangiorgi, D.: Some congruence properties for \u03c0-calculus bisimilarities. Theoretical Computer Science\u00a0198, 159\u2013176 (1998)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"38_CR3","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1093\/comjnl\/37.4.233","volume":"37","author":"S. Christensen","year":"1994","unstructured":"Christensen, S., Hirshfeld, Y., Moller, F.: Decidable subsets of CCS. Computer Journal\u00a037(4), 233\u2013242 (1994)","journal-title":"Computer Journal"},{"issue":"1","key":"38_CR4","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/2455.2460","volume":"32","author":"M. Hennessy","year":"1985","unstructured":"Hennessy, M., Milner, R.: Algebraic laws for nondeterminism and concurrency. Journal of ACM\u00a032(1), 137\u2013161 (1985)","journal-title":"Journal of ACM"},{"unstructured":"Hirschkoff, D., Pous, D.: Extended version of this abstract, \n                    \n                      http:\/\/hal.archives-ouvertes.fr\/hal-00375604\/","key":"38_CR5"},{"doi-asserted-by":"crossref","unstructured":"Hirschkoff, D., Pous, D.: A distribution law for CCS and a new congruence result for the pi-calculus. Logial Methods in Computer Science\u00a04(2) (2008)","key":"38_CR6","DOI":"10.2168\/LMCS-4(2:4)2008"},{"key":"38_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/3-540-48523-6_38","volume-title":"Automata, Languages and Programming","author":"Y. Hirshfeld","year":"1999","unstructured":"Hirshfeld, Y., Jerrum, M.: Bisimulation equivalence is decidable for normed process algebra. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol.\u00a01644, pp. 412\u2013421. Springer, Heidelberg (1999)"},{"key":"38_CR8","first-page":"145","volume-title":"LICS","author":"I. Lanese","year":"2008","unstructured":"Lanese, I., P\u00e9rez, J.A., Sangiorgi, D., Schmitt, A.: On the expressiveness and decidability of higher-order process calculi. In: LICS, pp. 145\u2013155. IEEE, Los Alamitos (2008)"},{"issue":"2","key":"38_CR9","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1017\/S0960129500001407","volume":"2","author":"R. Milner","year":"1992","unstructured":"Milner, R.: Functions as Processes. J. of Mathematical Structures in Computer Science\u00a02(2), 119\u2013141 (1992)","journal-title":"J. of Mathematical Structures in Computer Science"},{"key":"38_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.2000.2868","volume":"163","author":"U. Nestmann","year":"2000","unstructured":"Nestmann, U., Pierce, B.C.: Decoding choice encodings. Information and Computation\u00a0163, 1\u201359 (2000)","journal-title":"Information and Computation"},{"key":"38_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/978-3-540-76637-7_24","volume-title":"Programming Languages and Systems","author":"D. Pous","year":"2007","unstructured":"Pous, D.: Complete lattices and up-to techniques. In: Shao, Z. (ed.) APLAS 2007. LNCS, vol.\u00a04807, pp. 351\u2013366. Springer, Heidelberg (2007)"},{"unstructured":"Pous, D.: Techniques modulo pour les bisimulations. PhD thesis, ENS Lyon (2008)","key":"38_CR12"},{"key":"38_CR13","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1017\/S0960129598002527","volume":"8","author":"D. Sangiorgi","year":"1998","unstructured":"Sangiorgi, D.: On the bisimulation proof method. J. of Mathematical Structures in Computer Science\u00a08, 447\u2013479 (1998)","journal-title":"J. of Mathematical Structures in Computer Science"},{"key":"38_CR14","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. Cambridge University Press, Cambridge (2001)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14162-1_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T15:37:03Z","timestamp":1558280223000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14162-1_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642141614","9783642141621"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14162-1_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}