Vis enkel innførsel

dc.contributor.authorFahrenberg, Uli
dc.contributor.authorJohansen, Christian
dc.contributor.authorTrotter, Christopher A.
dc.contributor.authorZiemiański, Krzysztof
dc.date.accessioned2022-11-02T08:03:40Z
dc.date.available2022-11-02T08:03:40Z
dc.date.created2021-08-10T16:52:13Z
dc.date.issued2021
dc.identifier.citationLogical Methods in Computer Science. 2021, 17 (2), 1-32.en_US
dc.identifier.issn1860-5974
dc.identifier.urihttps://hdl.handle.net/11250/3029483
dc.description.abstractWe give a formalization of Pratt's intuitive sculpting process for higher-dimensional automata (HDA). Intuitively, an HDA is a sculpture if it can be embedded in (i.e., sculpted from) a single higher dimensional cell (hypercube). A first important result of this paper is that not all HDA can be sculpted, exemplified through several natural acyclic HDA, one being the famous "broken box" example of van Glabbeek. Moreover, we show that even the natural operation of unfolding is completely unrelated to sculpting, e.g., there are sculptures whose unfoldings cannot be sculpted. We investigate the expressiveness of sculptures, as a proper subclass of HDA, by showing them to be equivalent to regular ST-structures (an event-based counterpart of HDA) and to (regular) Chu spaces over 3 (in their concurrent interpretation given by Pratt). We believe that our results shed new light on the intuitions behind sculpting as a method of modeling concurrent behavior, showing the precise reaches of its expressiveness. Besides expressiveness, we also develop an algorithm to decide whether an HDA can be sculpted. More importantly, we show that sculptures are equivalent to Euclidean cubical complexes (being the geometrical counterpart of our combinatorial definition), which include the popular PV models used for deadlock detection. This exposes a close connection between geometric and combinatorial models for concurrency which may be of use for both areas.en_US
dc.language.isoengen_US
dc.publisherEPI Sciencesen_US
dc.rightsNavngivelse 4.0 Internasjonal*
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/deed.no*
dc.titleSculptures in concurrencyen_US
dc.title.alternativeSculptures in concurrencyen_US
dc.typePeer revieweden_US
dc.typeJournal articleen_US
dc.description.versionpublishedVersionen_US
dc.source.pagenumber1-32en_US
dc.source.volume17en_US
dc.source.journalLogical Methods in Computer Scienceen_US
dc.source.issue2en_US
dc.identifier.doi10.1186/s12986-021-00587-8
dc.identifier.cristin1925181
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