On complexity of reachability of transition restricted Petri nets (Q2733997)
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 1633506
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On complexity of reachability of transition restricted Petri nets |
scientific article; zbMATH DE number 1633506 |
Statements
13 August 2001
0 references
Hamiltonian circuit of directed graphs
0 references
reachability
0 references
On complexity of reachability of transition restricted Petri nets (English)
0 references
0.866458535194397
0 references
0.8294978141784668
0 references
0.8204325437545776
0 references
0.8163856863975525
0 references
