Some decidability results for nested Petri nets

From MaRDI portal





Nested Petri nets are Petri nets using other Petri nets as tokens, thereby allowing easy description of hierarchical systems. Their nested structure makes some important verification problems undecidable (reachability, boundedness,\dots) while some other problems remain decidable (termination, inevitability,\dots). For the entire collection see [Zbl 0933.00047].











This page was built for publication: Some decidability results for nested Petri nets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4511269)