{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:19:40Z","timestamp":1743135580328,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319340982"},{"type":"electronic","value":"9783319340999"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-34099-9_23","type":"book-chapter","created":{"date-parts":[[2016,4,27]],"date-time":"2016-04-27T14:40:35Z","timestamp":1461768035000},"page":"293-300","source":"Crossref","is-referenced-by-count":0,"title":["Distributed Computing in Monotone Topological Spaces"],"prefix":"10.1007","author":[{"given":"Susmit","family":"Bagchi","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,4,28]]},"reference":[{"key":"23_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-1793-8","volume-title":"Basic Topology","author":"MA Armstrong","year":"1983","unstructured":"Armstrong, M.A.: Basic Topology. Springer, Berlin (1983)"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Borowsky, E., Gafni, E.: Generalized FLP impossibility result for t-resilient asynchronous computations. In: The 25th Annual ACM Symposium on Theory of Computing. ACM (1993)","DOI":"10.1145\/167088.167119"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Borowsky, E., Gafni, E.: A simple algorithmically reasoned characterization of wait-free computation. In: The Sixteenth Annual ACM Symposium on Principles of Distributed Computing, pp. 189\u2013198 (1997)","DOI":"10.1145\/259380.259439"},{"issue":"1","key":"23_CR4","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1145\/9758.9759","volume":"9","author":"SD Carson","year":"1987","unstructured":"Carson, S.D., Reynolds, J.P.F.: The geometry of semaphore programs. ACM Trans. Program. Lang. Syst. 9(1), 25\u201353 (1987)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.entcs.2012.05.004","volume":"283","author":"R Conde","year":"2012","unstructured":"Conde, R., Rajsbaum, S.: An introduction to topological theory of distributed computing with safe-consensus. Electron. Notes Theoret. Comput. Sci. 283, 29\u201351 (2012)","journal-title":"Electron. Notes Theoret. Comput. Sci."},{"key":"23_CR6","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/j.tcs.2006.03.022","volume":"357","author":"L Fajstrup","year":"2006","unstructured":"Fajstrup, L., Rauben, M., Goubault, E.: Algebraic topology and concurrency. Theoret. Comput. Sci. 357, 241\u2013278 (2006)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"23_CR7","first-page":"129","volume":"27","author":"SR Ghosh","year":"2004","unstructured":"Ghosh, S.R., Dasgupta, H.: Connectedness in monotone spaces. Bull. Malays. Math. Sci. Soc. 27(2), 129\u2013148 (2004)","journal-title":"Bull. Malays. Math. Sci. Soc."},{"issue":"2","key":"23_CR8","doi-asserted-by":"publisher","first-page":"95","DOI":"10.4310\/HHA.2003.v5.n2.a5","volume":"5","author":"E Goubault","year":"2003","unstructured":"Goubault, E.: Some geometric perspectives in concurrency theory. Homology Homotopy Appl. 5(2), 95\u2013136 (2003)","journal-title":"Homology Homotopy Appl."},{"key":"23_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/BFb0084796","volume-title":"CONCUR \u201992","author":"E Goubault","year":"1992","unstructured":"Goubault, E., Jensen, T.P.: Homology of higher dimensional automata. In: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol. 630, pp. 254\u2013268. Springer, Heidelberg (1992)"},{"key":"23_CR10","first-page":"184","volume":"54","author":"J Gunawardena","year":"1994","unstructured":"Gunawardena, J.: Homotopy and concurrency. Bull. EATCS 54, 184\u2013193 (1994)","journal-title":"Bull. EATCS"},{"key":"23_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/3-540-48340-3_16","volume-title":"Mathematical Foundations of Computer Science 1999","author":"M Herlihy","year":"1999","unstructured":"Herlihy, M., Rajsbaum, S.: New perspectives in distributed computing. In: Kuty\u0142owski, M., Wierzbicki, T.M., Pacholski, L. (eds.) MFCS 1999. LNCS, vol. 1672, pp. 170\u2013186. Springer, Heidelberg (1999)"},{"key":"23_CR12","doi-asserted-by":"publisher","first-page":"858","DOI":"10.1145\/331524.331529","volume":"46","author":"M Herlihy","year":"1999","unstructured":"Herlihy, M., Shavit, N.: The topological structure of asynchronous computability. J. ACM 46, 858\u2013923 (1999)","journal-title":"J. ACM"},{"issue":"2","key":"23_CR13","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1137\/S0097539701397412","volume":"36","author":"G Hoest","year":"2006","unstructured":"Hoest, G., Shavit, N.: Toward a topological characterization of asynchronous complexity. SIAM J. Comput. 36(2), 457\u2013497 (2006)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"23_CR14","doi-asserted-by":"publisher","first-page":"1449","DOI":"10.1137\/S0097539796307698","volume":"29","author":"M Saks","year":"2000","unstructured":"Saks, M., Zaharoglou, F.: Wait-free k-set agreement is impossible: the topology of public knowledge. SIAM J. Comput. 29(5), 1449\u20131483 (2000)","journal-title":"SIAM J. Comput."}],"container-title":["Communications in Computer and Information Science","Beyond Databases, Architectures and Structures. Advanced Technologies for Data Mining and Knowledge Discovery"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-34099-9_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T22:04:22Z","timestamp":1559426662000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-34099-9_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319340982","9783319340999"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-34099-9_23","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2016]]}}}