{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T21:34:32Z","timestamp":1725831272039},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662486528"},{"type":"electronic","value":"9783662486535"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-48653-5_29","type":"book-chapter","created":{"date-parts":[[2015,10,2]],"date-time":"2015-10-02T18:46:01Z","timestamp":1443811561000},"page":"436-451","source":"Crossref","is-referenced-by-count":0,"title":["From Geometric Semantics to Asynchronous Computability"],"prefix":"10.1007","author":[{"given":"\u00c9ric","family":"Goubault","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Samuel","family":"Mimram","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christine","family":"Tasson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,5]]},"reference":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"Afek, Y., Attiya, H., Dolev, D., Gafni, E., Merritt, M., Shavit, N.: Atomic snapshots of shared memory. J. ACM 40(4), September 1993","DOI":"10.1145\/153724.153741"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"Anderson, J.H.: Composite registers. In: Conference on Principles of Distributed Computing. ACM, New York (1993)","DOI":"10.1007\/BF02242703"},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"Biran, O., Moran, S., Zaks, S.: A combinatorial characterization of the distributed tasks which are solvable in the presence of one faulty processor. In: PoDC. ACM (1988)","DOI":"10.1145\/62546.62590"},{"key":"29_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-642-24270-0_7","volume-title":"Computer Safety, Reliability, and Security","author":"R Bonichon","year":"2011","unstructured":"Bonichon, R., Canet, G., Correnson, L., Goubault, E., Haucourt, E., Hirschowitz, M., Labb\u00e9, S., Mimram, S.: Rigorous evidence of freedom from concurrency faults in industrial control software. In: Flammini, F., Bologna, S., Vittorini, V. (eds.) SAFECOMP 2011. LNCS, vol. 6894, pp. 85\u201398. Springer, Heidelberg (2011)"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Borowsky, E., Gafni, E.: Generalized FLP impossibility result for \n                    \n                      \n                    \n                    $$t$$\n                  -resilient synchronous computations. In: STOC (1993)","DOI":"10.1145\/167088.167119"},{"key":"29_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-662-47666-6_14","volume-title":"Automata, Languages, and Programming","author":"J Dubut","year":"2015","unstructured":"Dubut, J., Goubault, \u00c9., Goubault-Larrecq, J.: Natural homology. In: Halld\u00f3rsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol. 9135, pp. 171\u2013183. Springer, Heidelberg (2015)"},{"key":"29_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/978-3-642-28869-2_14","volume-title":"Programming Languages and Systems","author":"L Fajstrup","year":"2012","unstructured":"Fajstrup, L., Goubault, \u00c9., Haucourt, E., Mimram, S., Raussen, M.: Trace spaces: an efficient new technique for state-space reduction. In: Seidl, H. (ed.) Programming Languages and Systems. LNCS, vol. 7211, pp. 274\u2013294. Springer, Heidelberg (2012)"},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"Fajstrup, L., Goubault, \u00c9., Haucourt, E., Mimram, S., Raussen, M.: Directed Algebraic Topology and Concurrency. Springer (to be published) (2015)","DOI":"10.1007\/978-3-319-15398-8"},{"key":"29_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/BFb0055632","volume-title":"CONCUR \u201998 Concurrency Theory","author":"L Fajstrup","year":"1998","unstructured":"Fajstrup, L., Goubault, \u00c9., Rau\u00dfen, M.: Detecting deadlocks in concurrent systems. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol. 1466, pp. 332\u2013347. Springer, Heidelberg (1998)"},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"Fajstrup, L., Raussen, M., Goubault, \u00c9.: Algebraic topology and concurrency. TCS 357(1) (2006)","DOI":"10.1016\/j.tcs.2006.03.022"},{"issue":"2","key":"29_CR11","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"MJ Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. Journal of the ACM (JACM) 32(2), 374\u2013382 (1985)","journal-title":"Journal of the ACM (JACM)"},{"issue":"1","key":"29_CR12","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/0022-2496(70)90062-3","volume":"7","author":"PC Fishburn","year":"1970","unstructured":"Fishburn, P.C.: Intransitive indifference with unequal indifference intervals. Journal of Mathematical Psychology 7(1), 144\u2013149 (1970)","journal-title":"Journal of Mathematical Psychology"},{"key":"29_CR13","doi-asserted-by":"crossref","unstructured":"Gierz, G.: A Compendium of continuous lattices. Springer (1980)","DOI":"10.1007\/978-3-642-67678-9"},{"key":"29_CR14","doi-asserted-by":"crossref","unstructured":"Goubault, \u00c9.: Some geometric perspectives in concurrency theory. Homology, Homotopy and Appl. (2003)","DOI":"10.4310\/HHA.2003.v5.n2.a5"},{"key":"29_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/11539452_38","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"\u00c9 Goubault","year":"2005","unstructured":"Goubault, \u00c9., Haucourt, E.: A practical application of geometric semantics to static analysis of concurrent programs. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, pp. 503\u2013517. Springer, Heidelberg (2005)"},{"key":"29_CR16","doi-asserted-by":"crossref","unstructured":"Goubault, \u00c9., Heindel, T., Mimram, S.: A geometric view of partial order reduction. MFPS, Electr. Notes. Theor. Comput. Sci. 298, (2013)","DOI":"10.1016\/j.entcs.2013.09.013"},{"key":"29_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1007\/BFb0084796","volume-title":"CONCUR 1992","author":"\u00c9 Goubault","year":"1992","unstructured":"Goubault, \u00c9., Jensen, T.P.: Homology of higher-dimensional. In: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol. 630, pp. 254\u2013268. Springer, Heidelberg (1992)"},{"key":"29_CR18","unstructured":"Goubault, \u00c9: The Geometry of Concurrency. Ph.D. dissertation, ENS (1995)"},{"key":"29_CR19","doi-asserted-by":"crossref","unstructured":"Goubault, \u00c9., Mimram, S., Tasson, C.: Iterated chromatic subdivisions are collapsible. Applied Categorical Structures (2014)","DOI":"10.1007\/s10485-014-9383-6"},{"key":"29_CR20","doi-asserted-by":"crossref","unstructured":"Grandis, M.: Directed Algebraic Topology: Models of Non-Reversible Worlds. New Mathematical Monographs, vol. 13. Cambridge University Press (2009)","DOI":"10.1017\/CBO9780511657474"},{"key":"29_CR21","first-page":"184","volume":"54","author":"J Gunawardena","year":"1994","unstructured":"Gunawardena, J.: Homotopy and concurrency. Bulletin of the EATCS 54, 184\u2013193 (1994)","journal-title":"Bulletin of the EATCS"},{"key":"29_CR22","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Kozlov, D., Rajsbaum, S.: Distributed Computing Through Combinatorial Topology. Elsevier (2014)","DOI":"10.1016\/B978-0-12-404578-1.00003-6"},{"key":"29_CR23","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Shavit, N.: The asynchronous computability theorem for \n                    \n                      \n                    \n                    $$t$$\n                  -resilient tasks. In: Proceedings of the Twenty-Fifth Annual ACM Aymposium on Theory of Computing, pp. 111\u2013120. ACM (1993)","DOI":"10.1145\/167088.167125"},{"issue":"6","key":"29_CR24","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. Journal of the ACM (JACM) 46(6), 858\u2013923 (1999)","journal-title":"Journal of the ACM (JACM)"},{"key":"29_CR25","doi-asserted-by":"crossref","unstructured":"Kozlov, D.: Chromatic subdivision of a simplicial complex. Homology, Homotopy and Appl. 14 (2012)","DOI":"10.4310\/HHA.2012.v14.n2.a12"},{"key":"29_CR26","unstructured":"Kozlov, D.: Topology of the view complex. arXiv preprint \n                    arXiv:1311.7283\n                    \n                   (2013)"},{"key":"29_CR27","unstructured":"Loui, M.C., Abu-Amara, H.H.: Memory requirements for agreement among unreliable asynchronous processes. Advances in Computing Research 4 (1987)"},{"key":"29_CR28","unstructured":"Lynch, N.A.: Distributed algorithms. Morgan Kaufmann (1996)"},{"key":"29_CR29","volume-title":"Topology and order","author":"L Nachbin","year":"1965","unstructured":"Nachbin, L.: Topology and order. Van Nostrand, Van Nostrand mathematical studies (1965)"},{"key":"29_CR30","doi-asserted-by":"crossref","unstructured":"Pratt, V.: Modeling concurrency with geometry. In: POPL. ACM Press (1991)","DOI":"10.1145\/99583.99625"},{"key":"29_CR31","doi-asserted-by":"crossref","unstructured":"Saks, M.E., Zaharoglou, F.: Wait-free \n                    \n                      \n                    \n                    $$k$$\n                  -set agreement is impossible: the topology of public knowledge. In: STOC (1993)","DOI":"10.1145\/167088.167122"},{"key":"29_CR32","unstructured":"van Glabbeek, R.: Bisimulation semantics for higher dimensional automata. Technical report, Stanford (1991)"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48653-5_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T23:27:35Z","timestamp":1559258855000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48653-5_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662486528","9783662486535"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48653-5_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}