{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:40:59Z","timestamp":1740109259632,"version":"3.37.3"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,3,16]],"date-time":"2018-03-16T00:00:00Z","timestamp":1521158400000},"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":["Distrib. Comput."],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1007\/s00446-018-0328-4","type":"journal-article","created":{"date-parts":[[2018,3,16]],"date-time":"2018-03-16T05:21:07Z","timestamp":1521177667000},"page":"289-316","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Geometric and combinatorial views on asynchronous computability"],"prefix":"10.1007","volume":"31","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3198-1863","authenticated-orcid":false,"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":[[2018,3,16]]},"reference":[{"issue":"4","key":"328_CR1","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1145\/153724.153741","volume":"40","author":"Y Afek","year":"1993","unstructured":"Afek, Y., Attiya, H., Dolev, D., Gafni, E., Merritt, M., Shavit, N.: Atomic snapshots of shared memory. J. ACM 40(4), 873\u2013890 (1993)","journal-title":"J. ACM"},{"doi-asserted-by":"crossref","unstructured":"Anderson, J.H.: Composite registers. In: Conference on Principles of Distributed Computing. ACM, New York (1993)","key":"328_CR2","DOI":"10.1007\/BF02242703"},{"key":"328_CR3","volume-title":"Term Rewriting and All That","author":"F Baader","year":"1999","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1999)"},{"doi-asserted-by":"crossref","unstructured":"Benavides, F., Rajsbaum, S.: The read\/write protocol complex is collapsible. In: Latin American Symposium on Theoretical Informatics, pp. 179\u2013191. Springer (2016)","key":"328_CR4","DOI":"10.1007\/978-3-662-49529-2_14"},{"key":"328_CR5","volume-title":"Term Rewriting Systems","author":"M Bezem","year":"2003","unstructured":"Bezem, M., Klop, J.W., de Vrijer, R.: Term Rewriting Systems. Cambridge University Press, Cambridge (2003)"},{"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)","key":"328_CR6","DOI":"10.1145\/62546.62590"},{"doi-asserted-by":"crossref","unstructured":"Bonichon, R., Canet, G., Correnson, L., Goubault, \u00c9., Haucourt, E., Hirschowitz, M., Labb\u00e9, S., Mimram, S.: Rigorous evidence of freedom from concurrency faults in industrial control software. In: SAFECOMP (2011)","key":"328_CR7","DOI":"10.1007\/978-3-642-24270-0_7"},{"doi-asserted-by":"crossref","unstructured":"Borowsky, E., Gafni, E.: Generalized FLP impossibility result for $$t$$ t -resilient asynchronous computations. In: STOC (1993)","key":"328_CR8","DOI":"10.1145\/167088.167119"},{"doi-asserted-by":"crossref","unstructured":"Casta\u00f1eda, A., Rajsbaum, S., Raynal, M.: Specifying concurrent problems: beyond linearizability and up to tasks. In: International Symposium on Distributed Computing, pp. 420\u2013435. Springer (2015)","key":"328_CR9","DOI":"10.1007\/978-3-662-48653-5_28"},{"doi-asserted-by":"crossref","unstructured":"Fajstrup, L., Goubault, \u00c9., Haucourt, E., Mimram, S., Raussen, M.: Trace spaces: an efficient new technique for state-space reduction. In: ESOP (2012)","key":"328_CR10","DOI":"10.1007\/978-3-642-28869-2_14"},{"key":"328_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-15398-8","volume-title":"Directed Algebraic Topology and Concurrency","author":"L Fajstrup","year":"2016","unstructured":"Fajstrup, L., Goubault, \u00c9., Haucourt, E., Mimram, S., Raussen, M.: Directed Algebraic Topology and Concurrency. Springer, Berlin (2016)"},{"doi-asserted-by":"crossref","unstructured":"Fajstrup, L., Goubault, \u00c9., Raussen, M.: Detecting deadlocks in concurrent systems. In: CONCUR, number 1466 in LNCS. Springer (1998)","key":"328_CR12","DOI":"10.1007\/BFb0055632"},{"issue":"1","key":"328_CR13","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., Raussen, M., Goubault, \u00c9.: Algebraic topology and concurrency. TCS 357(1), 241\u2013278 (2006)","journal-title":"TCS"},{"issue":"2","key":"328_CR14","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. J. ACM (JACM) 32(2), 374\u2013382 (1985)","journal-title":"J. ACM (JACM)"},{"issue":"1","key":"328_CR15","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. J. Math. Psychol. 7(1), 144\u2013149 (1970)","journal-title":"J. Math. Psychol."},{"unstructured":"Gafni, E.: Snapshot for time: the one-shot case (2014). arXiv preprint arXiv:1408.3432","key":"328_CR16"},{"key":"328_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-67678-9","volume-title":"A Compendium of Continuous Lattices","author":"G Gierz","year":"1980","unstructured":"Gierz, G.: A Compendium of Continuous Lattices. Springer, Berlin (1980)"},{"unstructured":"Goubault, \u00c9.: The Geometry of Concurrency. Ph.D. Dissertation, ENS (1995)","key":"328_CR18"},{"key":"328_CR19","doi-asserted-by":"publisher","first-page":"95","DOI":"10.4310\/HHA.2003.v5.n2.a5","volume":"5","author":"\u00c9 Goubault","year":"2003","unstructured":"Goubault, \u00c9.: Some geometric perspectives in concurrency theory. Homol. Homotopy Appl. 5, 95\u2013136 (2003)","journal-title":"Homol. Homotopy Appl."},{"doi-asserted-by":"crossref","unstructured":"Goubault, \u00c9., Haucourt, E.: A practical application of geometric semantics to static analysis of concurrent programs. In: CONCUR 2005. Springer (2005)","key":"328_CR20","DOI":"10.1007\/11539452_38"},{"key":"328_CR21","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/j.entcs.2013.09.013","volume":"298","author":"\u00c9 Goubault","year":"2013","unstructured":"Goubault, \u00c9., Heindel, T., Mimram, S.: A geometric view of partial order reduction. MFPS Electr. Notes Theor. Comput. Sci. 298, 179\u2013195 (2013)","journal-title":"MFPS Electr. Notes Theor. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"Goubault, \u00c9., Jensen, T.P.: Homology of higher-dimensional automata. In: Proceedings of CONCUR (1992)","key":"328_CR22","DOI":"10.1007\/3-540-57208-2_21"},{"key":"328_CR23","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1007\/s10485-014-9383-6","volume":"23","author":"\u00c9 Goubault","year":"2014","unstructured":"Goubault, \u00c9., Mimram, S., Tasson, C.: Iterated chromatic subdivisions are collapsible. Appl. Categ. Struct. 23, 777\u2013818 (2014)","journal-title":"Appl. Categ. Struct."},{"key":"328_CR24","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511657474","volume-title":"Directed Algebraic Topology: Models of Non-reversible Worlds. New Mathematical Monographs","author":"M Grandis","year":"2009","unstructured":"Grandis, M.: Directed Algebraic Topology: Models of Non-reversible Worlds. New Mathematical Monographs, vol. 13. Cambridge University Press, Cambridge (2009)"},{"key":"328_CR25","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":"328_CR26","volume-title":"Distributed Computing Through Combinatorial Topology","author":"M Herlihy","year":"2014","unstructured":"Herlihy, M., Kozlov, D., Rajsbaum, S.: Distributed Computing Through Combinatorial Topology. Elsevier, Amsterdam (2014)"},{"doi-asserted-by":"crossref","unstructured":"Herlihy, M., Shavit, N.: The asynchronous computability theorem for $$t$$ t -resilient tasks. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, pp. 111\u2013120. ACM (1993)","key":"328_CR27","DOI":"10.1145\/167088.167125"},{"issue":"6","key":"328_CR28","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 (JACM) 46(6), 858\u2013923 (1999)","journal-title":"J. ACM (JACM)"},{"issue":"2","key":"328_CR29","doi-asserted-by":"publisher","first-page":"197","DOI":"10.4310\/HHA.2012.v14.n2.a12","volume":"14","author":"D Kozlov","year":"2012","unstructured":"Kozlov, D.: Chromatic subdivision of a simplicial complex. Homol. Homotopy Appl. 14(2), 197\u2013209 (2012)","journal-title":"Homol. Homotopy Appl."},{"unstructured":"Kozlov, D.: Topology of the view complex (2013). arXiv preprint arXiv:1311.7283","key":"328_CR30"},{"key":"328_CR31","volume-title":"Distributed Algorithms","author":"NA Lynch","year":"1996","unstructured":"Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann, Burlington (1996)"},{"key":"328_CR32","volume-title":"Topology and Order. Van Nostrand Mathematical Studies","author":"L Nachbin","year":"1965","unstructured":"Nachbin, L.: Topology and Order. Van Nostrand Mathematical Studies. Van Nostrand, New York (1965)"},{"doi-asserted-by":"crossref","unstructured":"Pratt, V.: Modeling concurrency with geometry. In: POPL. ACM Press (1991)","key":"328_CR33","DOI":"10.1145\/99583.99625"},{"doi-asserted-by":"crossref","unstructured":"Saks, M.\u00a0E., Zaharoglou, F.: Wait-free $$k$$ k -set agreement is impossible: the topology of public knowledge. In: STOC (1993)","key":"328_CR34","DOI":"10.1145\/167088.167122"},{"unstructured":"van Glabbeek, R.: Bisimulation semantics for higher dimensional automata. Technical Report, Stanford (1991)","key":"328_CR35"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-018-0328-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-018-0328-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-018-0328-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,16]],"date-time":"2022-08-16T04:42:05Z","timestamp":1660624925000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-018-0328-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,16]]},"references-count":35,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,8]]}},"alternative-id":["328"],"URL":"https:\/\/doi.org\/10.1007\/s00446-018-0328-4","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"type":"print","value":"0178-2770"},{"type":"electronic","value":"1432-0452"}],"subject":[],"published":{"date-parts":[[2018,3,16]]},"assertion":[{"value":"31 March 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 February 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 March 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}