Post #4217634

RE: https://mastoxiv.page/@arXiv_csLO_bot/116911516892048971 It looks as though one of my favourite problems has been solved! It's related to both Petri nets and linear logic. BVAS are more general than VAS – which are more or less the same as Petri nets. The reachability problem for VAS was previously known to be decidable, but with outrageous complexity (Ackermann-complete), so the reachability problem for BVAS must be at least as hard as that. But this work doesn't answer the question of just how much harder it is.