Complexity results for problems of communication-free Petri nets and related formalisms (Q2805419)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Complexity results for problems of communication-free Petri nets and related formalisms |
scientific article; zbMATH DE number 6579332
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity results for problems of communication-free Petri nets and related formalisms |
scientific article; zbMATH DE number 6579332 |
Statements
11 May 2016
0 references
0.9138979
0 references
0.9045401
0 references
0.9029727
0 references
0.8938079
0 references
0.88990617
0 references
0.8839118
0 references
0.88175786
0 references
0.88175786
0 references
Complexity results for problems of communication-free Petri nets and related formalisms (English)
0 references
