Structural Liveness of Immediate Observation Petri Nets
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2021
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866913231786737664 |
|---|---|
| author | Jancar, Petr Valusek, Jiri |
| author_facet | Jancar, Petr Valusek, Jiri |
| contents | We look in detail at the structural liveness problem (SLP) for subclasses of Petri nets, namely immediate observation nets (IO nets) and their generalized variant called branching immediate multi-observation nets (BIMO nets), that were recently introduced by Esparza, Raskin, and Weil-Kennedy. We show that SLP is PSPACE-hard for IO nets and in PSPACE for BIMO nets. In particular, we discuss the (small) bounds on the token numbers in net places that are decisive for a marking to be (non)live. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2112_15524 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | Structural Liveness of Immediate Observation Petri Nets Jancar, Petr Valusek, Jiri Logic in Computer Science We look in detail at the structural liveness problem (SLP) for subclasses of Petri nets, namely immediate observation nets (IO nets) and their generalized variant called branching immediate multi-observation nets (BIMO nets), that were recently introduced by Esparza, Raskin, and Weil-Kennedy. We show that SLP is PSPACE-hard for IO nets and in PSPACE for BIMO nets. In particular, we discuss the (small) bounds on the token numbers in net places that are decisive for a marking to be (non)live. |
| title | Structural Liveness of Immediate Observation Petri Nets |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2112.15524 |