Vis enkel innførsel

dc.contributor.authorFahrenberg, Uli
dc.contributor.authorJohansen, Christian
dc.contributor.authorStruth, Georg
dc.contributor.authorZiemiański, Krzysztof
dc.date.accessioned2023-03-03T15:33:13Z
dc.date.available2023-03-03T15:33:13Z
dc.date.created2023-01-17T13:48:49Z
dc.date.issued2022
dc.identifier.citationLeibniz International Proceedings in Informatics. 2022, 243 1-18.en_US
dc.identifier.issn1868-8969
dc.identifier.urihttps://hdl.handle.net/11250/3055862
dc.description.abstractWe prove a Kleene theorem for higher-dimensional automata (HDAs). It states that the languages they recognise are precisely the rational subsumption-closed sets of interval pomsets. The rational operations include a gluing composition, for which we equip pomsets with interfaces. For our proof, we introduce HDAs with interfaces as presheaves over labelled precube categories and use tools inspired by algebraic topology, such as cylinders and (co)fibrations. HDAs are a general model of non-interleaving concurrency, which subsumes many other models in this field. Interval orders are used as models for concurrent or distributed systems where events extend in time. Our tools and techniques may therefore yield templates for Kleene theorems in various models and applications.en_US
dc.language.isoengen_US
dc.publisherSchloss Dagstuhl - Leibniz-Zentrum für Informatiken_US
dc.rightsNavngivelse 4.0 Internasjonal*
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/deed.no*
dc.titleA Kleene Theorem for Higher-Dimensional Automataen_US
dc.title.alternativeA Kleene Theorem for Higher-Dimensional Automataen_US
dc.typePeer revieweden_US
dc.typeJournal articleen_US
dc.description.versionpublishedVersionen_US
dc.source.pagenumber1-18en_US
dc.source.volume243en_US
dc.source.journalLeibniz International Proceedings in Informaticsen_US
dc.identifier.doi10.4230/LIPIcs.CONCUR.2022.29
dc.identifier.cristin2108631
cristin.ispublishedtrue
cristin.fulltextoriginal
cristin.qualitycode1


Tilhørende fil(er)

Thumbnail

Denne innførselen finnes i følgende samling(er)

Vis enkel innførsel

Navngivelse 4.0 Internasjonal
Med mindre annet er angitt, så er denne innførselen lisensiert som Navngivelse 4.0 Internasjonal