Persistent Permutability in Choice Petri Nets
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_ | 1866912848664330240 |
|---|---|
| author | Best, Eike Devillers, Raymond |
| author_facet | Best, Eike Devillers, Raymond |
| contents | Persistence is a strong, global, behavioural property of a Petri net, meaning that no activity can disable a different activity. Persistent permutability is a weaker property, pertaining to individual interleavings of a Petri net and stating that a non-persistent sequence can be permuted into a persistent one. We identify Petri net classes for which persistent permutability already suffices to imply overall persistence. These classes generalise free-choice nets and are related to Petri's concept of ``confusion'', while they are distinguished from each other by diverse restrictions on the choice structure of a net. We prove Ochmanski's conjecture to be correct for these classes. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_18004 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Persistent Permutability in Choice Petri Nets Best, Eike Devillers, Raymond Formal Languages and Automata Theory Discrete Mathematics Persistence is a strong, global, behavioural property of a Petri net, meaning that no activity can disable a different activity. Persistent permutability is a weaker property, pertaining to individual interleavings of a Petri net and stating that a non-persistent sequence can be permuted into a persistent one. We identify Petri net classes for which persistent permutability already suffices to imply overall persistence. These classes generalise free-choice nets and are related to Petri's concept of ``confusion'', while they are distinguished from each other by diverse restrictions on the choice structure of a net. We prove Ochmanski's conjecture to be correct for these classes. |
| title | Persistent Permutability in Choice Petri Nets |
| topic | Formal Languages and Automata Theory Discrete Mathematics |
| url | https://arxiv.org/abs/2601.18004 |