Presenting Interval Pomsets with Interfaces
Formal Languages and Automata Theory
2024-07-19 v2
Abstract
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.
Cite
@article{arxiv.2403.16626,
title = {Presenting Interval Pomsets with Interfaces},
author = {Amazigh Amrane and Hugo Bazille and Emily Clement and Uli Fahrenberg and Krzysztof Ziemiański},
journal= {arXiv preprint arXiv:2403.16626},
year = {2024}
}