{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:10:47Z","timestamp":1761610247082,"version":"build-2065373602"},"reference-count":17,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2002,11,1]],"date-time":"2002-11-01T00:00:00Z","timestamp":1036108800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2002,11,1]],"date-time":"2002-11-01T00:00:00Z","timestamp":1036108800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3923,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2002,11]]},"DOI":"10.1016\/s1571-0661(04)80497-3","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T12:47:47Z","timestamp":1096462067000},"page":"1-11","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"title":["On the Specification of Higher Dimensional Automata"],"prefix":"10.1016","volume":"68","author":[{"given":"Richard","family":"Buckland","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Johnson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dominic","family":"Verity","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80497-3_NEWBIB1","series-title":"Intensional Programming I","first-page":"249","article-title":"Choice as a first class citizen","author":"Buckland","year":"1996"},{"key":"10.1016\/S1571-0661(04)80497-3_NEWBIB2","doi-asserted-by":"crossref","unstructured":"R. Buckland and M. Johnson, ECHIDNA: A system for manipulating explicit choice higher dimensional automata, AMAST'96, Lecture Notes in Computer Science 1101 (1996) 587\u2013591.","DOI":"10.1007\/BFb0014348"},{"key":"10.1016\/S1571-0661(04)80497-3_NEWBIB3","article-title":"\u00bfFrom concurrency to algebraic topology","volume":"39","author":"Gaucher","year":"2000","journal-title":"ENTCS"},{"key":"10.1016\/S1571-0661(04)80497-3_NEWBIB4","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1017\/S0960129500003182","article-title":"Homotopy invariants of higher dimensional categories and concurrency in computer science","volume":"10","author":"Gaucher","year":"2000","journal-title":"Mathematical Structures in Computer Science"},{"key":"10.1016\/S1571-0661(04)80497-3_NEWBIB5","doi-asserted-by":"crossref","first-page":"324","DOI":"10.70930\/tac\/k1rwmh4o","article-title":"Combinatorics of branchings in higher dimensional automata","volume":"8","author":"Gaucher","year":"2001","journal-title":"Theory and Applications of Categories"},{"key":"10.1016\/S1571-0661(04)80497-3_NEWBIB6","doi-asserted-by":"crossref","unstructured":"P. Gaucher, Investigating the algebraic structure of dihomotopy types, ENTCS, 52 number 2, to appear","DOI":"10.1016\/S1571-0661(04)00221-X"},{"key":"10.1016\/S1571-0661(04)80497-3_NEWBIB7","unstructured":"P. Gaucher, About the globular homology of higher dimensional automata, Cahiers de Topologie et Geometrie Differentielle Categorique, (2002), to appear."},{"key":"10.1016\/S1571-0661(04)80497-3_NEWBIB8","unstructured":"E. Goubault, The Geometry of Concurrency, PhD thesis, ENS, 1995."},{"key":"10.1016\/S1571-0661(04)80497-3_NEWBIB9","first-page":"409","volume":"10","year":"2000","journal-title":"Geometry and concurrency, special issue of Mathematical Structures in Computer Science"},{"key":"10.1016\/S1571-0661(04)80497-3_NEWBIB10","doi-asserted-by":"crossref","unstructured":"E. Goubault, L. Fajstrup and M. Raussen, Detecting Deadlocks in Concurrent Systems, CONCUR'98 Lecture Notes in Computer Science 1466 (1998) 332\u2013347.","DOI":"10.1007\/BFb0055632"},{"key":"10.1016\/S1571-0661(04)80497-3_NEWBIB11","doi-asserted-by":"crossref","unstructured":"E. Goubault and M. Raussen, Dihomotopy as a tool in state space analysis, LATIN'02, Lecture notes in Computer Science 2286 (2002) 16\u201337.","DOI":"10.1007\/3-540-45995-2_8"},{"key":"10.1016\/S1571-0661(04)80497-3_NEWBIB12","unstructured":"M. Grandis, Directed homotopy theory I: The fundamental category, preprint, 2001."},{"key":"10.1016\/S1571-0661(04)80497-3_NEWBIB13","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0022-4049(89)90136-9","article-title":"The combinatorics of n-categorical pasting","volume":"62","author":"Johnson","year":"1989","journal-title":"Journal of Pure and Applied Algebra"},{"key":"10.1016\/S1571-0661(04)80497-3_NEWBIB14","doi-asserted-by":"crossref","unstructured":"V. Pratt, Modelling concurrency with geometry, Proceedings of POPL 18, ACM Press, (1991) 311\u2013322.","DOI":"10.1145\/99583.99625"},{"key":"10.1016\/S1571-0661(04)80497-3_NEWBIB15","unstructured":"V. Pratt, Transition and cancellation in concurrency and branching time, Mathematical Structures in Computer Science (2002) to appear."},{"key":"10.1016\/S1571-0661(04)80497-3_NEWBIB16","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1017\/S0960129500003145","article-title":"On the classification of dipaths in geometric models for concurrency","volume":"10","author":"Raussen","year":"2000","journal-title":"Mathematical Structures in Computer Science"},{"key":"10.1016\/S1571-0661(04)80497-3_NEWBIB17","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/0022-4049(87)90137-X","article-title":"The algebra of oriented simplexes","volume":"49","author":"Street","year":"1987","journal-title":"Journal of Pure and Applied Algebra"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104804973?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104804973?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:05:52Z","timestamp":1761609952000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104804973"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,11]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,11]]}},"alternative-id":["S1571066104804973"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80497-3","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2002,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On the Specification of Higher Dimensional Automata","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(04)80497-3","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}