{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:34Z","timestamp":1761611194075,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":38,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540558224"},{"type":"electronic","value":"9783540472933"}],"license":[{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/bfb0084811","type":"book-chapter","created":{"date-parts":[[2006,11,24]],"date-time":"2006-11-24T13:12:14Z","timestamp":1164373934000},"page":"486-503","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Embeddings among concurrent programming languages"],"prefix":"10.1007","author":[{"given":"Ehud","family":"Shapiro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,9,30]]},"reference":[{"key":"34_CR1","doi-asserted-by":"crossref","unstructured":"de Boer, F.S., and Palamidessi, C., Embedding as a Tools for Language Comparison: On the CSP Hierarchy, Proc. of CONCUR'91, LNCS, Springer, 1991.","DOI":"10.1007\/3-540-54430-5_85"},{"key":"34_CR2","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/BF00263584","volume":"25","author":"L. Boug\u00e9","year":"1988","unstructured":"Boug\u00e9, L., On the Existence of Symmetric Algorithms to Find Leaders in Networks of Communicating Sequential Processes, Acta Informatica, 25, pp. 179\u2013201, 1988.","journal-title":"Acta Informatica"},{"key":"34_CR3","doi-asserted-by":"crossref","unstructured":"Brookes, S.D., On the Relationship of CCS and CSP, Proc. of 10th Colloq. on Automata, Languages and Programming, Lecture Notes in Computer Science 154, Springer-Verlag, pp.83\u201396, 1983","DOI":"10.1007\/BFb0036899"},{"issue":"4","key":"34_CR4","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1145\/63334.63337","volume":"32","author":"N. Carriero","year":"1988","unstructured":"Carriero, N., and Gelernter, D., Linda in Context, Comm. ACM, 32(4), pp. 444\u2013458, 1988.","journal-title":"Comm. ACM"},{"key":"34_CR5","doi-asserted-by":"crossref","unstructured":"Chandy, K.M., and Misra, J., Parallel Program Design, Addison-Wesley, 1988.","DOI":"10.1007\/978-1-4613-9668-0_6"},{"key":"34_CR6","doi-asserted-by":"crossref","unstructured":"Gaifman, H., and Shapiro, E., Fully Abstract Compositional Semantics for Logic Programs, Proc. ACM Symposium on Principles of Programming Languages, pp. 134\u2013142, 1989.","DOI":"10.1145\/75277.75289"},{"key":"34_CR7","doi-asserted-by":"crossref","unstructured":"Gaifman, H., Maher, M.J., and Shapiro, E., Replay, Recovery, Replication, and Snapshots of Nondeterministic Concurrent Programs, Proc. PODC'91, ACM,1991.","DOI":"10.1145\/112600.112621"},{"key":"34_CR8","doi-asserted-by":"crossref","unstructured":"Goldman, K.J., and Lynch, N.A., Modelling Shared State in a Shared Action Model, Proc. 5 th Annual Symposium on Logic in Computer Science, pp. 450\u2013463, IEEE, 1990.","DOI":"10.21236\/ADA221279"},{"key":"34_CR9","unstructured":"Hennessy, M., Algebraic Theory of Processes, MIT Press, 1988."},{"key":"34_CR10","unstructured":"Hewitt, C., A Universal, Modular Actor Formalism for Artificial Intelligence, Proc. International Joint Conference on Artificial Intelligence, 1973."},{"key":"34_CR11","unstructured":"Hirata, M., Programming Language Doc and its Self-Description, or, X = X is Considered Harmful, Proc. 3 rd Conference of Japan Society of Software Science and Technology, pp. 69\u201372, 1986."},{"issue":"8","key":"34_CR12","doi-asserted-by":"publisher","first-page":"666","DOI":"10.1145\/359576.359585","volume":"21","author":"C.A.R. Hoare","year":"1978","unstructured":"Hoare, C.A.R., Communicating Sequential Processes, Comm. ACM, 21(8), pp. 666\u2013677, 1978.","journal-title":"Comm. ACM"},{"key":"34_CR13","volume-title":"Communicating Sequential Processes","author":"C.A.R. Hoare","year":"1985","unstructured":"Hoare, C.A.R., Communicating Sequential Processes, Prentice Hall, New Jersey, 1985."},{"key":"34_CR14","volume-title":"OCCAM Programming Manual","author":"INMOS Ltd.","year":"1984","unstructured":"INMOS Ltd., OCCAM Programming Manual, Prentice-Hall, New Jersey, 1984."},{"key":"34_CR15","doi-asserted-by":"crossref","unstructured":"Jonsson, B., A Fully Abstract Trace Model for Dataflow Networks, 16th Annual ACM Symposium on Principles of Programming Languages, pp. 155\u2013165, 1989.","DOI":"10.1145\/75277.75291"},{"key":"34_CR16","unstructured":"Jifeng H., Josephs, M.B., and Hoare, C.A.R., A Theory for Synchrony and Asynchrony, Proc. of IFIP TC 2 Working Conf. on Programming Concenpt and Methods, Sea of Gallilee, Israel, April, 1990."},{"key":"34_CR17","unstructured":"Kahn, G., The Semantics of a Simple Language for Parallel Programming, Information Processing 74, pp. 993\u2013998, North-Holland, 1977."},{"key":"34_CR18","doi-asserted-by":"crossref","unstructured":"Kahn, K., and Saraswat, V.A., Actors as a Special Case of Concurrent Constraint (Logic) Programming, Xerox Technical Report, 1990.","DOI":"10.1145\/97945.97955"},{"key":"34_CR19","doi-asserted-by":"crossref","unstructured":"Kleinman, A., Moscowitz, Y., Pnueli, A., and Shapiro, E., Communication with Directed Logic Variables, Proc. of ACM POPL, 1991.","DOI":"10.1145\/99583.99615"},{"key":"34_CR20","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0304-3975(81)90109-2","volume":"13","author":"N.A. Lynch","year":"1981","unstructured":"Lynch, N.A., and Fischer, M.J., On Describing the Behavior and Implementation of Distributed Systems, TCS, 13, pp. 17\u201343, 1981.","journal-title":"TCS"},{"key":"34_CR21","doi-asserted-by":"crossref","unstructured":"Lynch, N.A., and Tuttle, M.R., Hierarchical Correctness Proofs for Distributed Algorithms, Proc. ACM Symposium PODC'87, 1987.","DOI":"10.1145\/41840.41852"},{"key":"34_CR22","doi-asserted-by":"crossref","unstructured":"Milner, R., A Calculus of Communicating Systems, Lecture Notes in Computer Science 92, Springer-Verlag, 1980.","DOI":"10.1007\/3-540-10235-3"},{"key":"34_CR23","unstructured":"Milner, R., Communication and Concurrency, Prentice-Hall, 1989."},{"key":"34_CR24","unstructured":"Misra, J., Loosely-Coupled Processes, in E.H.L. Aarts, J. van Leeuwen, M. Ram (eds.), Proc. of PARLE'91: Parallel Architectures and Languages Europe, Vol. 2, LNCS 506, Springer, pp.1\u201326, 1989."},{"key":"34_CR25","series-title":"LNCS 526","first-page":"290","volume-title":"On Abstraction and the Expressive Power of Programming Languages","author":"J. Mitchell","year":"1991","unstructured":"Mitchell, J., On Abstraction and the Expressive Power of Programming Languages, Proc. of the Int'l Conference on Theoretical Aspects of Computer Science, Sendai, Japan, LNCS 526, Springer, pp.290\u2013310, 1991."},{"key":"34_CR26","doi-asserted-by":"crossref","unstructured":"Russel, J.R., Full Abstraction for Nondeterministic Dataflow Networks, Proc. 30 th IEEE FOCS, pp.170\u2013175, 1989.","DOI":"10.1109\/SFCS.1989.63474"},{"key":"34_CR27","unstructured":"Safra, S., Partial Evaluation of Concurrent Prolog and its Implications, M.Sc. Thesis, Technical Report CS86-24, Dept. of Computer Science, Weizmann Institute of Science, 1986."},{"key":"34_CR28","series-title":"LNCS 205","first-page":"347","volume-title":"Partial Correctness Semantics for CP[\u2193,-,&]","author":"V.A. Saraswat","year":"1985","unstructured":"Saraswat, V.A., Partial Correctness Semantics for CP[\u2193,-,&], Proc. 5 th Conference on Foundations of Software Technology and Theoretical Computer Science, New-Delhi, LNCS 205, Springer, pp.347\u2013368, 1985."},{"key":"34_CR29","unstructured":"Saraswat, V.A., A Somewhat Logical Formulation of CLP Synchronization Primitives, in Bowen, K., and Kowalski, R.A. (eds.), Proc. 5 th International Conference Symposium on Logic Programming, pp. 1298\u20131314, MIT Press, 1988."},{"key":"34_CR30","unstructured":"Saraswat, V.A., Kahn, K., and Levy, J., Janus: A Step Towards Distributed Constraint Programming, Proc. 1990 North American Conference on Logic Programming, S. Debray and M. Hermenegildo (Eds.), MIT Press, 1990."},{"key":"34_CR31","unstructured":"Shapiro, E. (Editot), Concurrent Prolog: Collected Papers, Vols. 1 & 2, MIT Press, 1987."},{"issue":"3","key":"34_CR32","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1145\/72551.72555","volume":"21","author":"E. Shapiro","year":"1989","unstructured":"Shapiro, E., The Family of Concurrent Logic Programming Languages, ACM Computing Surveys 21(3), pp. 412\u2013510, 1989.","journal-title":"ACM Computing Surveys"},{"key":"34_CR33","volume-title":"Technical Report CS89-07","author":"E. Shapiro","year":"1989","unstructured":"Shapiro, E., Embedding Linda and other joys of concurrent logic programming, Technical Report CS89-07, Department of Computer Science, The Weizmann Institute of Science, Rehovot, 1989."},{"key":"34_CR34","doi-asserted-by":"crossref","unstructured":"Shapiro, E., Separating Concurrent Languages with Categories of Language Embeddings, Proc. STOC'91, ACM, pp.198\u2013208, 1991.","DOI":"10.1145\/103418.103423"},{"key":"34_CR35","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/0304-3975(85)90093-3","volume":"37","author":"R. Simone De","year":"1985","unstructured":"De Simone, R., Higher-Level Synchronizing Devices in MEIJE-SCCS, Theoretical Computer Science, Vol. 37, pp.245\u2013267, 1985.","journal-title":"Theoretical Computer Science"},{"key":"34_CR36","volume-title":"Ph.D. Thesis","author":"K. Ueda","year":"1986","unstructured":"Ueda, K., Guarded Horn Clauses, Ph.D. Thesis, Information Engineering Course, University of Tokyo, Tokyo, 1986."},{"key":"34_CR37","doi-asserted-by":"crossref","unstructured":"Vaandrager, F.W., On the Relationship Between Process Algebra and Input\/Output Automata, Proc. LICS'91, IEEE, pp.387\u2013398, 1991.","DOI":"10.1109\/LICS.1991.151662"},{"key":"34_CR38","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/BF03037201","volume":"7","author":"E. Yardeni","year":"1990","unstructured":"Yardeni, E., Kliger, S., and Shapiro, E., The Languages FCP(:) and FCP(:,?), J. New Generation Computing, 7, pp. 89\u2013107, 1990.","journal-title":"J. New Generation Computing"}],"container-title":["Lecture Notes in Computer Science","CONCUR '92"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0084811","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,12]],"date-time":"2025-01-12T03:55:42Z","timestamp":1736654142000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0084811"}},"subtitle":["Preliminary version"],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540558224","9783540472933"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/bfb0084811","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]},"assertion":[{"value":"30 September 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}