Compositionality of Systems and Partially Ordered Runs
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910019757277184 |
|---|---|
| author | Fettke, Peter Reisig, Wolfgang |
| author_facet | Fettke, Peter Reisig, Wolfgang |
| contents | In the late 1970s, C.A. Petri introduced partially ordered event occurrences (runs), then called \emph{processes}, as the appropriate model to describe the individual evolutions of distributed systems. Here, we present a unified framework for handling Petri nets and their runs, specifically to compose and decompose them. It is shown that, for nets $M$ and $N$, the set of runs of the composed net $M \bullet N$ equals the composition of the runs of $M$ and $N$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_11203 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Compositionality of Systems and Partially Ordered Runs Fettke, Peter Reisig, Wolfgang Logic in Computer Science Software Engineering In the late 1970s, C.A. Petri introduced partially ordered event occurrences (runs), then called \emph{processes}, as the appropriate model to describe the individual evolutions of distributed systems. Here, we present a unified framework for handling Petri nets and their runs, specifically to compose and decompose them. It is shown that, for nets $M$ and $N$, the set of runs of the composed net $M \bullet N$ equals the composition of the runs of $M$ and $N$. |
| title | Compositionality of Systems and Partially Ordered Runs |
| topic | Logic in Computer Science Software Engineering |
| url | https://arxiv.org/abs/2602.11203 |