{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:07:34Z","timestamp":1725466054680},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642370748"},{"type":"electronic","value":"9783642370755"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"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":[[2013]]},"DOI":"10.1007\/978-3-642-37075-5_4","type":"book-chapter","created":{"date-parts":[[2013,2,18]],"date-time":"2013-02-18T19:37:23Z","timestamp":1361216243000},"page":"50-64","source":"Crossref","is-referenced-by-count":3,"title":["On Unique Decomposition of Processes in the Applied \u03c0-Calculus"],"prefix":"10.1007","author":[{"given":"Jannik","family":"Dreier","sequence":"first","affiliation":[]},{"given":"Cristian","family":"Ene","sequence":"additional","affiliation":[]},{"given":"Pascal","family":"Lafourcade","sequence":"additional","affiliation":[]},{"given":"Yassine","family":"Lakhnech","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1145\/360204.360213","volume-title":"Proceedings of the 28th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2001","author":"M. Abadi","year":"2001","unstructured":"Abadi, M., Fournet, C.: Mobile values, new names, and secure communication. In: Proceedings of the 28th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2001, pp. 104\u2013115. ACM, New York (2001)"},{"key":"4_CR2","unstructured":"Christensen, S.: Decidability and Decompostion in Process Algebras. PhD thesis, School of Computer Science, University of Edinburgh (1993)"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-642-33167-1_26","volume-title":"Computer Security \u2013 ESORICS 2012","author":"J. Dreier","year":"2012","unstructured":"Dreier, J., Lafourcade, P., Lakhnech, Y.: Defining Privacy for Weighted Votes, Single and Multi-voter Coercion. In: Foresti, S., Yung, M., Martinelli, F. (eds.) ESORICS 2012. LNCS, vol.\u00a07459, pp. 451\u2013468. Springer, Heidelberg (2012)"},{"key":"4_CR4","unstructured":"Dreier, J., Lafourcade, P., Lakhnech, Y.: On parallel factorization of processes in the applied pi calculus. Technical Report TR-2012-3, Verimag Research Report (March 2012), \n                    \n                      http:\/\/www-verimag.imag.fr\/TR\/TR-2012-3.pdf"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/BFb0084783","volume-title":"CONCUR \u201992","author":"J.F. Groote","year":"1992","unstructured":"Groote, J.F., Moller, F.: Verification of Parallel Systems via Decomposition. In: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol.\u00a0630, pp. 62\u201376. Springer, Heidelberg (1992)"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1007\/978-3-642-14162-1_38","volume-title":"Automata, Languages and Programming","author":"D. Hirschkoff","year":"2010","unstructured":"Hirschkoff, D., Pous, D.: On Bisimilarity and Substitution in Presence of Replication. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol.\u00a06199, pp. 454\u2013465. Springer, Heidelberg (2010)"},{"key":"4_CR7","unstructured":"Liu, J.: A proof of coincidence of labeled bisimilarity and observational equivalence in applied pi calculus. Technical Report ISCAS-SKLCS-11-05 (2011), \n                    \n                      http:\/\/lcs.ios.ac.cn\/~jliu\/"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Luttik, B.: Unique parallel decomposition in branching and weak bisimulation semantics. Technical report (2012), \n                    \n                      http:\/\/arxiv.org\/abs\/1205.2117v1","DOI":"10.1007\/978-3-642-33475-7_18"},{"issue":"2-3","key":"4_CR9","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/j.tcs.2004.11.019","volume":"335","author":"B. Luttik","year":"2005","unstructured":"Luttik, B., van Oostrom, V.: Decomposition orders \u2013 another generalisation of the fundamental theorem of arithmetic. Theoretical Computer Science\u00a0335(2-3), 147\u2013186 (2005)","journal-title":"Theoretical Computer Science"},{"key":"4_CR10","unstructured":"Milner, R.: Communication and Concurrency. International Series in Computer Science. Prentice Hall (1989)"},{"issue":"2","key":"4_CR11","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1016\/0304-3975(93)90176-T","volume":"107","author":"R. Milner","year":"1993","unstructured":"Milner, R., Moller, F.: Unique decomposition of processes. Theoretical Computer Science\u00a0107(2), 357\u2013363 (1993)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"4_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","volume":"100","author":"R. Milner","year":"1992","unstructured":"Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes. Information and Computation\u00a0100(1), 1\u201340 (1992)","journal-title":"Information and Computation"},{"key":"4_CR13","unstructured":"Moller, F.: Axioms for Concurrency. PhD thesis, School of Computer Science, University of Edinburgh (1989)"},{"issue":"1","key":"4_CR14","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), 1\u201359 (2000)","journal-title":"Information and Computation"},{"issue":"23","key":"4_CR15","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1016\/j.tcs.2004.11.020","volume":"335","author":"C. Palamidessi","year":"2005","unstructured":"Palamidessi, C., Herescu, O.M.: A randomized encoding of the pi-calculus with mixed choice. Theoretical Computer Science\u00a0335(23), 373\u2013404 (2005)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-37075-5_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T01:24:37Z","timestamp":1558315477000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-37075-5_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642370748","9783642370755"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37075-5_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}