{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T22:29:12Z","timestamp":1648852152332},"reference-count":7,"publisher":"Cambridge University Press (CUP)","issue":"2","license":[{"start":{"date-parts":[[2013,6,17]],"date-time":"2013-06-17T00:00:00Z","timestamp":1371427200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Struct. Comp. Sci."],"published-print":{"date-parts":[[2014,4]]},"abstract":"<jats:p>Raussen (2010) gave the trace space, which corresponds to the executions of parallel non-looped, non-branching processes as a prod-simplicial complex derived from a poset. The connected components represent equivalent executions. For looped processes, the state space is a torus and the trace space is a disjoint union of trace spaces of deloopings. In the current paper, we develop the index poset for the trace space of the deloopings from the once delooped case. When just one process is looped, the index poset is generated as words in a regular language. We also construct a corresponding automaton.<\/jats:p>","DOI":"10.1017\/s0960129513000169","type":"journal-article","created":{"date-parts":[[2013,6,17]],"date-time":"2013-06-17T08:10:02Z","timestamp":1371456602000},"source":"Crossref","is-referenced-by-count":0,"title":["Trace spaces of directed tori with rectangular holes"],"prefix":"10.1017","volume":"24","author":[{"given":"LISBETH","family":"FAJSTRUP","sequence":"first","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2013,6,17]]},"reference":[{"key":"S0960129513000169_ref7","doi-asserted-by":"publisher","DOI":"10.2140\/agt.2010.10.1683"},{"key":"S0960129513000169_ref2","doi-asserted-by":"publisher","DOI":"10.4310\/HHA.2003.v5.n2.a1"},{"key":"S0960129513000169_ref5","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"Hopcroft","year":"1979"},{"key":"S0960129513000169_ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s10485-007-9085-4"},{"key":"S0960129513000169_ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3472-0_2"},{"key":"S0960129513000169_ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.03.022"},{"key":"S0960129513000169_ref3","first-page":"274","volume-title":"Programming Languages and Systems. 21st European Symposium on Programming, ESOP 2012","author":"Fajstrup","year":"2012"}],"container-title":["Mathematical Structures in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0960129513000169","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T17:27:08Z","timestamp":1555954028000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0960129513000169\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,17]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,4]]}},"alternative-id":["S0960129513000169"],"URL":"https:\/\/doi.org\/10.1017\/s0960129513000169","relation":{},"ISSN":["0960-1295","1469-8072"],"issn-type":[{"value":"0960-1295","type":"print"},{"value":"1469-8072","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,6,17]]},"article-number":"e240202"}}