Verification of bounded Petri nets using integer programming (Q878111)
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 5146150
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Verification of bounded Petri nets using integer programming |
scientific article; zbMATH DE number 5146150 |
Statements
Verification of bounded Petri nets using integer programming (English)
0 references
26 April 2007
0 references
Verification
0 references
Petri nets
0 references
Integer programming
0 references
Net unfoldings
0 references
Partial order techniques
0 references
0 references
0.9126286
0 references
0.89310765
0 references
0.8926178
0 references
0.88907087
0 references
0.88767534
0 references
0.88728666
0 references
