Some decidability results for nested Petri nets (Q4511269)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1522994
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some decidability results for nested Petri nets |
scientific article; zbMATH DE number 1522994 |
Statements
30 October 2000
0 references
nested Petri nets
0 references
0.8492991328239441
0 references
0.8363754749298096
0 references
0.834954023361206
0 references
0.8149493336677551
0 references
0.8147585988044739
0 references
Some decidability results for nested Petri nets (English)
0 references
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].
0 references
