{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T14:16:30Z","timestamp":1725804990714},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319108810"},{"type":"electronic","value":"9783319108827"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-10882-7_21","type":"book-chapter","created":{"date-parts":[[2014,9,11]],"date-time":"2014-09-11T02:54:19Z","timestamp":1410404059000},"page":"351-368","source":"Crossref","is-referenced-by-count":1,"title":["A Behavioral Congruence for Concurrent Constraint Programming with Nondeterministic Choice"],"prefix":"10.1007","author":[{"given":"Luis F.","family":"Pino","sequence":"first","affiliation":[]},{"given":"Filippo","family":"Bonchi","sequence":"additional","affiliation":[]},{"given":"Frank D.","family":"Valencia","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Arbab, F., Rutten, J.J.M.M.: A coinductive calculus of component connectors. In: WADT, pp. 34\u201355 (2002)","DOI":"10.1007\/978-3-540-40020-2_2"},{"key":"21_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/978-3-642-19805-2_10","volume-title":"Foundations of Software Science and Computational Structures","author":"A. Aristiz\u00e1bal","year":"2011","unstructured":"Aristiz\u00e1bal, A., Bonchi, F., Palamidessi, C., Pino, L., Valencia, F.: Deriving labels and bisimilarity for concurrent constraint programming. In: Hofmann, M. (ed.) FOSSACS 2011. LNCS, vol.\u00a06604, pp. 138\u2013152. Springer, Heidelberg (2011)"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Aristiz\u00e1bal, A., Bonchi, F., Pino, L., Valencia, F.D.: Partition refinement for bisimilarity in CCP. In: Ossowski, S., Lecca, P. (eds.) 27th Annual ACM Symposium on Applied Computing (SAC 2012), pp. 88\u201393. ACM (2012)","DOI":"10.1145\/2245276.2245296"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Bartoletti, M., Zunino, R.: A calculus of contracting processes. In: 25th Annual IEEE Symposium on Logic in Computer Science (LICS 2010), pp. 332\u2013341. IEEE Computer Society (2010)","DOI":"10.1109\/LICS.2010.25"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Bengtson, J., Johansson, M., Parrow, J., Victor, B.: Psi-calculi: Mobile processes, nominal data, and logic. In: 24th Annual IEEE Symposium on Logic in Computer Science (LICS 2009), pp. 39\u201348. IEEE Computer Society (2009)","DOI":"10.1109\/LICS.2009.20"},{"key":"21_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/978-3-642-00596-1_20","volume-title":"Foundations of Software Science and Computational Structures","author":"F. Bonchi","year":"2009","unstructured":"Bonchi, F., Gadducci, F., Monreale, G.V.: Reactive systems, barbed semantics, and the mobile ambients. In: de Alfaro, L. (ed.) FOSSACS 2009. LNCS, vol.\u00a05504, pp. 272\u2013287. Springer, Heidelberg (2009)"},{"key":"21_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/978-3-642-25318-8_22","volume-title":"Programming Languages and Systems","author":"F. Bonchi","year":"2011","unstructured":"Bonchi, F., Gadducci, F., Monreale, G.V.: Towards a general theory of barbs, contexts and labels. In: Yang, H. (ed.) APLAS 2011. LNCS, vol.\u00a07078, pp. 289\u2013304. Springer, Heidelberg (2011)"},{"key":"21_CR8","unstructured":"Bonchi, F., K\u00f6nig, B., Montanari, U.: Saturated semantics for reactive systems. In: 21th IEEE Symposium on Logic in Computer Science (LICS 2006), pp. 69\u201380. IEEE Computer Society (2006)"},{"key":"21_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/978-3-540-78739-6_20","volume-title":"Programming Languages and Systems","author":"M.G. Buscemi","year":"2008","unstructured":"Buscemi, M.G., Montanari, U.: Open bisimulation for the concurrent constraint pi-calculus. In: Drossopoulou, S. (ed.) ESOP 2008. LNCS, vol.\u00a04960, pp. 254\u2013268. Springer, Heidelberg (2008)"},{"issue":"1","key":"21_CR10","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0304-3975(95)00047-Z","volume":"151","author":"F.S. Boer de","year":"1995","unstructured":"de Boer, F.S., Pierro, A.D., Palamidessi, C.: Nondeterminism and infinite computations in constraint programming. Theoretical Computer Science\u00a0151(1), 37\u201378 (1995)","journal-title":"Theoretical Computer Science"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"De Nicola, R.: Behavioral equivalences. In: Encyclopedia of Parallel Computing, pp. 120\u2013127 (2011)","DOI":"10.1007\/978-0-387-09766-4_517"},{"issue":"2","key":"21_CR12","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/S0304-3975(97)00328-9","volume":"183","author":"M. Falaschi","year":"1997","unstructured":"Falaschi, M., Gabbrielli, M., Marriott, K., Palamidessi, C.: Confluence in concurrent constraint programming. Theoretical Computer Science\u00a0183(2), 281\u2013315 (1997)","journal-title":"Theoretical Computer Science"},{"issue":"3-4","key":"21_CR13","first-page":"287","volume":"87","author":"W. Fokkink","year":"2008","unstructured":"Fokkink, W., Pang, J., Wijs, A.: Is timed branching bisimilarity a congruence indeed? Fundam. Inform.\u00a087(3-4), 287\u2013311 (2008)","journal-title":"Fundam. Inform."},{"key":"21_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-642-32940-1_23","volume-title":"CONCUR 2012 \u2013 Concurrency Theory","author":"S. Knight","year":"2012","unstructured":"Knight, S., Palamidessi, C., Panangaden, P., Valencia, F.D.: Spatial and epistemic modalities in constraint-based process calculi. In: Koutny, M., Ulidowski, I. (eds.) CONCUR 2012. LNCS, vol.\u00a07454, pp. 317\u2013332. Springer, Heidelberg (2012)"},{"key":"21_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/3-540-44618-4_19","volume-title":"CONCUR 2000 - Concurrency Theory","author":"J.J. Leifer","year":"2000","unstructured":"Leifer, J.J., Milner, R.: Deriving bisimulation congruences for reactive systems. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol.\u00a01877, pp. 243\u2013258. Springer, Heidelberg (2000)"},{"issue":"2","key":"21_CR16","first-page":"181","volume":"2","author":"N.P. Mendler","year":"1995","unstructured":"Mendler, N.P., Panangaden, P., Scott, P.J., Seely, R.A.G.: A logical view of concurrent constraint programming. Nordic Journal of Computing\u00a02(2), 181\u2013220 (1995)","journal-title":"Nordic Journal of Computing"},{"key":"21_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-10235-3","volume-title":"A Calculus of Communication Systems","author":"R. Milner","year":"1980","unstructured":"Milner, R.: A Calculus of Communication Systems. LNCS, vol.\u00a092. Springer, Heidelberg (1980)"},{"key":"21_CR18","unstructured":"Milner, R.: Communicating and mobile systems: the \u03c0-calculus. Cambridge University Press (1999)"},{"key":"21_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1007\/3-540-55719-9_114","volume-title":"Automata, Languages and Programming","author":"R. Milner","year":"1992","unstructured":"Milner, R., Sangiorgi, D.: Barbed bisimulation. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol.\u00a0623, pp. 685\u2013695. Springer, Heidelberg (1992)"},{"key":"21_CR20","unstructured":"Monk, J., Henkin, L., Tarski, A.: Cylindric Algebras (Part I). North-Holland (1971)"},{"key":"21_CR21","unstructured":"Palamidessi, C., Saraswat, V.A., Valencia, F.D., Victor, B.: On the expressiveness of linearity vs persistence in the asychronous pi-calculus. In: 21th IEEE Symposium on Logic in Computer Science (LICS 2006), pp. 59\u201368. IEEE Computer Society (2006)"},{"key":"21_CR22","unstructured":"Pino, L.F., Bonchi, F., Valencia, F.D.: A behavioral congruence for concurrent constraint programming with nondeterministic choice (extended version). Technical report, INRIA\/DGA and LIX, \u00c9cole Polytechnique, France (2013), \n \n http:\/\/www.lix.polytechnique.fr\/~luis.pino\/files\/ictac14-extended.pdf"},{"key":"21_CR23","doi-asserted-by":"crossref","unstructured":"Pino, L.F., Bonchi, F., Valencia, F.D.: Efficient computation of program equivalence for confluent concurrent constraint programming. In: Pe\u00f1a, R., Schrijvers, T. (eds.) 15th International Symposium on Principles and Practice of Declarative Programming (PPDP 2013), pp. 263\u2013274. ACM (2013)","DOI":"10.1145\/2505879.2505902"},{"key":"21_CR24","unstructured":"Sangiorgi, D., Walker, D.: The \u03c0-Calculus - a theory of mobile processes. Cambridge University Press (2001)"},{"key":"21_CR25","doi-asserted-by":"crossref","unstructured":"Saraswat, V.A., Rinard, M.C.: Concurrent constraint programming. In: Allen, F.E. (ed.) 17th Annual ACM Symposium on Principles of Programming Languages (POPL 1991), pp. 232\u2013245. ACM Press (1990)","DOI":"10.1145\/96709.96733"},{"key":"21_CR26","doi-asserted-by":"crossref","unstructured":"Saraswat, V.A., Rinard, M.C., Panangaden, P.: Semantic foundations of concurrent constraint programming. In: Wise, D.S. (ed.) 18th Annual ACM Symposium on Principles of Programming Languages (POPL 1991), pp. 333\u2013352. ACM Press (1991)","DOI":"10.1145\/99583.99627"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-10882-7_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T17:27:37Z","timestamp":1558978057000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-10882-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319108810","9783319108827"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-10882-7_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}