{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T12:32:47Z","timestamp":1754483567971,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540616047"},{"type":"electronic","value":"9783540706250"}],"license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"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":[[1996]]},"DOI":"10.1007\/3-540-61604-7_65","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:03:15Z","timestamp":1330293795000},"page":"373-388","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Truly concurrent constraint programming"],"prefix":"10.1007","author":[{"given":"Vineet","family":"Gupta","sequence":"first","affiliation":[]},{"given":"Radha","family":"Jagadeesan","sequence":"additional","affiliation":[]},{"given":"Vijay","family":"Saraswat","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0168-0072(91)90065-T","volume":"51","author":"S. Abramsky","year":"1991","unstructured":"S. Abramsky. Domain theory in logical form. Annals of Pure and Applied Logic, 51:1\u201377, 1991.","journal-title":"Annals of Pure and Applied Logic"},{"doi-asserted-by":"crossref","unstructured":"L. Aceto and M. Hennessy. Towards action-refinement in process algebras. In Proceedings, Fourth Annual Symposium on Logic in Computer Science, pages 138\u2013145. IEEE Computer Society Press, 1989.","key":"22_CR2","DOI":"10.1109\/LICS.1989.39168"},{"key":"22_CR3","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1007\/BFb0084786","volume":"630","author":"G. Boudol","year":"1992","unstructured":"G. Boudol, I. Castellani, Matthew C. Hennessy, and A. Kiehn. A theory of processes with localities. In Proceedings of International Conference on Concurrency Theory, Volume 630 of Lecture Notes in Computer Science, pages 108\u2013122, 1992.","journal-title":"Lecture Notes in Computer Science"},{"doi-asserted-by":"crossref","unstructured":"F. S. de Boer, M. Gabrielli, Elena Marchiori, and Catuscia Palamidessi. Proving concurrent programs correct. In Proceedings of the 21st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 98\u2013108, 1994.","key":"22_CR4","DOI":"10.1145\/174675.176925"},{"key":"22_CR5","first-page":"296","volume":"493","author":"F. S. Boer de","year":"1991","unstructured":"F. S. de Boer and Catuscia Palamidessi. A fully abstract model for concurrent constraint programming. In Proceedings of TAPSOFT\/CAAP, pages 296\u2013319, LNCS 493, 1991.","journal-title":"LNCS"},{"unstructured":"F. S. de Boer, Catuscia Palamidessi, and Eike Best. Concurrent constraint programming with information removal. In Proceedings of the Concurrent Constraint Programming Workshop, pages 1\u201313, Venice, 1995.","key":"22_CR6"},{"key":"22_CR7","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0004-3702(86)90080-9","volume":"28","author":"J. deKleer","year":"1986","unstructured":"J. deKleer. An assumption based TMS. Artifical Intelligence, 28:127\u2013162, 1986.","journal-title":"Artifical Intelligence"},{"key":"22_CR8","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"34","author":"R. Nicola de","year":"1984","unstructured":"R. de Nicola and M.C.B. Hennessy. Testing equivalences for processes. Theoretical Computer Science, 34:83\u2013133, 1984.","journal-title":"Theoretical Computer Science"},{"doi-asserted-by":"crossref","unstructured":"Markus Fromherz and Vijay Saraswat. Model-based computing: Using concurrent constraint programming for modeling and model compilation. In Principles and Practices of Constraint Programming, volume 976 of LNCS, pages 629\u2013635. Springer Verlag, 1995.","key":"22_CR9","DOI":"10.1007\/3-540-60299-2_39"},{"unstructured":"Roberto Gorrieri. Refinement, Atomicity, and Transactions for Process Description Languages. PhD thesis, University of Pisa, 1991.","key":"22_CR10"},{"unstructured":"N. Heintze. Set-Based Program analysis. PhD thesis, Carnegie Mellon University, 1992.","key":"22_CR11"},{"unstructured":"Ugo Montanari and Francesca Rossi. True concurrency semantics for concurrent constraint programminmg. In V. Saraswat and K. Ueda, editors, Proc. of the 1991 International Logic Programming Symposium, 1991.","key":"22_CR12"},{"unstructured":"Ugo Montanari and Francesca Rossi. A concurrent semantics for concurrent constraint programs via contextual nets. In Principles and Pranctices of Constraint Programming, pages 3\u201327, 1995.","key":"22_CR13"},{"issue":"3","key":"22_CR14","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1137\/0205035","volume":"5","author":"G.D. Plotkin","year":"1976","unstructured":"G.D. Plotkin. A powerdomain construction. SIAM J. of Computing, 5(3):452\u2013487, September 1976.","journal-title":"SIAM J. of Computing"},{"issue":"1","key":"22_CR15","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/BF01379149","volume":"15","author":"V.R. Pratt","year":"1986","unstructured":"V.R. Pratt. Modeling concurrency with partial orders. Int. J. of Parallel Programming, 15(1):33\u201371, February 1986.","journal-title":"Int. J. of Parallel Programming"},{"unstructured":"Vijay A. Saraswat. The Category of Constraint Systems is Cartesian-closed. In Proc. 7th IEEE Symp. on Logic in Computer Science, Santa Cruz, 1992.","key":"22_CR16"},{"doi-asserted-by":"crossref","unstructured":"Vijay A. Saraswat. Concurrent constraint programming. Doctoral Dissertation Award and Logic Programming Series. MIT Press, 1993.","key":"22_CR17","DOI":"10.7551\/mitpress\/2086.001.0001"},{"key":"22_CR18","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0022-0000(78)90048-X","volume":"16","author":"M. B. Smyth","year":"1978","unstructured":"M. B. Smyth. Powerdomains. Journal of Computer and System Sciences, 16:23\u201336, February 1978.","journal-title":"Journal of Computer and System Sciences"},{"doi-asserted-by":"crossref","unstructured":"Vijay A. Saraswat and Martin Rinard. Concurrent constraint programming. In Proceedings of Seventeenth ACM Symposium on Principles of Programming Languages, San Fransisco, January 1990.","key":"22_CR19","DOI":"10.1145\/96709.96733"},{"doi-asserted-by":"crossref","unstructured":"V. A. Saraswat, M. Rinard, and P. Panangaden. Semantic foundations of concurrent constraint programming. In Proceedings of Eighteenth ACM Symposium on Principles of Programming Languages, Orlando, January 1991.","key":"22_CR20","DOI":"10.1145\/99583.99627"},{"key":"22_CR21","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1007\/3-540-17945-3_13","volume":"259","author":"R. Glabbeek van","year":"1987","unstructured":"Rob van Glabbeek and Frits Vaandrager. Petri net models for algebraic theories of concurrency. In Proceedings of PARLE, Volume 259 of the Lecture Notes in Computer Science, pages 224\u2013242, 1987.","journal-title":"Lecture Notes in Computer Science"},{"doi-asserted-by":"crossref","unstructured":"Walter Vogler. Modular Construction and Partial Order Semantics of Petri Nets, volume 625 of LNCS. Springer-Verlag, 1992. 252 pp.","key":"22_CR22","DOI":"10.1007\/3-540-55767-9"},{"doi-asserted-by":"crossref","unstructured":"Glynn Winskel. Event structures. In Petri Nets: Applications and Relationships to Other Models of Concurrency, Volume 255 of Lecture Notes in Computer Science, pages 325\u2013392, 1987.","key":"22_CR23","DOI":"10.1007\/3-540-17906-2_31"}],"container-title":["Lecture Notes in Computer Science","CONCUR '96: Concurrency Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61604-7_65","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:22:33Z","timestamp":1742599353000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61604-7_65"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540616047","9783540706250"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-61604-7_65","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]},"assertion":[{"value":"2 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}