Presenting Interval Pomsets with Interfaces
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866914876004237312 |
|---|---|
| author | Amrane, Amazigh Bazille, Hugo Clement, Emily Fahrenberg, Uli Ziemiański, Krzysztof |
| author_facet | Amrane, Amazigh Bazille, Hugo Clement, Emily Fahrenberg, Uli Ziemiański, Krzysztof |
| contents | Interval-order partially ordered multisets with interfaces (ipomsets) have shown to be a versatile model for executions of concurrent systems in which both precedence and concurrency need to be taken into account. In this paper, we develop a presentation of ipomsets as generated by a graph of certain discrete ipomsets (starters and terminators) under the relation which composes subsequent starters and subsequent terminators. Using this presentation, we show that also subsumptions are generated by elementary relations. We develop a similar correspondence on the automata side, relating higher-dimensional automata, which generate ipomsets, and ST-automata, which generate step sequences, and their respective languages. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_16626 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Presenting Interval Pomsets with Interfaces Amrane, Amazigh Bazille, Hugo Clement, Emily Fahrenberg, Uli Ziemiański, Krzysztof Formal Languages and Automata Theory Interval-order partially ordered multisets with interfaces (ipomsets) have shown to be a versatile model for executions of concurrent systems in which both precedence and concurrency need to be taken into account. In this paper, we develop a presentation of ipomsets as generated by a graph of certain discrete ipomsets (starters and terminators) under the relation which composes subsequent starters and subsequent terminators. Using this presentation, we show that also subsumptions are generated by elementary relations. We develop a similar correspondence on the automata side, relating higher-dimensional automata, which generate ipomsets, and ST-automata, which generate step sequences, and their respective languages. |
| title | Presenting Interval Pomsets with Interfaces |
| topic | Formal Languages and Automata Theory |
| url | https://arxiv.org/abs/2403.16626 |