{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:24:14Z","timestamp":1775053454583,"version":"3.50.1"},"reference-count":28,"publisher":"Cambridge University Press (CUP)","issue":"2","license":[{"start":{"date-parts":[[2009,3,4]],"date-time":"2009-03-04T00:00:00Z","timestamp":1236124800000},"content-version":"unspecified","delay-in-days":6456,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Struct. Comp. Sci."],"published-print":{"date-parts":[[1991,7]]},"abstract":"<jats:p>We combine the principles of the Floyd-Warshall-Kleene algorithm, enriched categories, and Birkhoff arithmetic, to yield a useful class of algebras of transitive vertex-labeled spaces. The motivating application is a uniform theory of abstract or parametrized time in which to any given notion of time there corresponds an algebra of concurrent behaviors and their operations, always the same operations but interpreted automatically and appropriately for that notion of time. An interesting side application is a language for succinctly naming a wide range of datatypes.<\/jats:p>","DOI":"10.1017\/s0960129500001286","type":"journal-article","created":{"date-parts":[[2009,3,4]],"date-time":"2009-03-04T04:02:54Z","timestamp":1236139374000},"page":"179-213","source":"Crossref","is-referenced-by-count":22,"title":["Temporal Structures"],"prefix":"10.1017","volume":"1","author":[{"given":"Ross","family":"Casley","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roger F.","family":"Crew","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9","family":"Meseguer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vaughan","family":"Pratt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2009,3,4]]},"reference":[{"key":"S0960129500001286_ref016","volume-title":"Rendiconti del Seminario Matematica e Fisico di Milano, XLIII","author":"Lawvere","year":"1973"},{"key":"S0960129500001286_ref007","volume-title":"Regular Algebra and Finite Machines","author":"Conway","year":"1971"},{"key":"S0960129500001286_ref003","doi-asserted-by":"publisher","DOI":"10.1016\/0022-4049(83)90100-7"},{"key":"S0960129500001286_ref009","doi-asserted-by":"publisher","DOI":"10.1145\/367766.368168"},{"key":"S0960129500001286_ref001","volume-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"S0960129500001286_ref023","doi-asserted-by":"crossref","unstructured":"Pratt V.R. (1991a) Modeling concurrency with geometry. In Proc. 18th Ann. ACM Symposium on Principles of Programming Languages.","DOI":"10.1145\/99583.99625"},{"key":"S0960129500001286_ref004","doi-asserted-by":"publisher","DOI":"10.1215\/S0012-7094-37-00323-5"},{"key":"S0960129500001286_ref019","first-page":"180","volume-title":"Proc. CMU\/SERC Workshop on Analysis of Concurrency, LNCS 197","author":"Pratt","year":"1984"},{"key":"S0960129500001286_ref002","volume-title":"Arrows, Structures, and Functors: The Categorical Imperative","author":"Arbib","year":"1975"},{"key":"S0960129500001286_ref006","first-page":"1","volume-title":"In Proc. Conf. on Category Theory and Computer Science, LNCS 389","volume":"1","author":"Casley","year":"1989"},{"key":"S0960129500001286_ref008","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-99902-4_22"},{"key":"S0960129500001286_ref011","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(87)90045-4"},{"key":"S0960129500001286_ref020","doi-asserted-by":"publisher","DOI":"10.1007\/BF01379149"},{"key":"S0960129500001286_ref022","volume-title":"Submitted to a technical conference","author":"Pratt","year":"1991"},{"key":"S0960129500001286_ref012","first-page":"72","volume-title":"Proc. 2nd Annual IEEE Symp. on Logic in Computer Science","author":"Gaifman","year":"1987"},{"key":"S0960129500001286_ref013","volume-title":"Basic Concepts of Enriched Category Theory: London Math. Soc. Lecture Notes","volume":"64","author":"Kelly","year":"1982"},{"key":"S0960129500001286_ref014","doi-asserted-by":"crossref","unstructured":"Kozen D. (1980) A representation theorem for models of *-free PDL. In Proc. 7th Colloq. on Automata, Languages, and Programming, pages 351\u2013362.","DOI":"10.1007\/3-540-10003-2_83"},{"key":"S0960129500001286_ref017","volume-title":"Proc. 5th Annual IEEE Symp. on Logic in Computer Science","author":"Lewis","year":"1990"},{"key":"S0960129500001286_ref015","first-page":"167","volume-title":"Proc. Workshop on Logics of Programs 1981, LNCS 131","author":"Kozen","year":"1981"},{"key":"S0960129500001286_ref018","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-9839-7"},{"key":"S0960129500001286_ref021","first-page":"177","volume-title":"Proc. First International Conference on Algebraic Methodology and Software Technology","author":"Pratt","year":"1989"},{"key":"S0960129500001286_ref024","first-page":"13","article-title":"G\u00e9n\u00e9ralisation de l'algorithme de Warshall","volume":"2","author":"Robert","year":"1968","journal-title":"Revue francaise d'Informatique et de Recherche Operationnelle"},{"key":"S0960129500001286_ref025","first-page":"216","article-title":"Transitivit\u00e9 et connexit\u00e9","volume":"249","author":"Roy","year":"1959","journal-title":"Comptes Rendues Acad. Sci."},{"key":"S0960129500001286_ref026","first-page":"334","volume-title":"Category Theory and Computer Programming, Lecture Notes in Computer Science","volume":"240","author":"Tarlecki","year":"1985"},{"key":"S0960129500001286_ref027","volume-title":"Topology via Logic","author":"Vickers","year":"1989"},{"key":"S0960129500001286_ref028","doi-asserted-by":"publisher","DOI":"10.1145\/321105.321107"},{"key":"S0960129500001286_ref005","doi-asserted-by":"publisher","DOI":"10.1215\/S0012-7094-42-00921-9"},{"key":"S0960129500001286_ref010","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0013031"}],"container-title":["Mathematical Structures in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0960129500001286","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T17:12:07Z","timestamp":1558113127000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0960129500001286\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,7]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,7]]}},"alternative-id":["S0960129500001286"],"URL":"https:\/\/doi.org\/10.1017\/s0960129500001286","relation":{},"ISSN":["0960-1295","1469-8072"],"issn-type":[{"value":"0960-1295","type":"print"},{"value":"1469-8072","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,7]]}}}