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.

翻译：我们详细研究了Petri网子类（即最近由Esparza、Raskin和Weil-Kennedy提出的立即观察网（IO网）及其广义变体分支立即多观察网（BIMO网））的结构活性问题（SLP）。我们证明了IO网的SLP是PSPACE难的，而BIMO网的SLP属于PSPACE类。特别地，我们讨论了网库所中决定标识（非）活性的令牌数量的（小）界限。