Continuous reachability for unordered data Petri nets is in PTime (Q2289079)
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: Continuous reachability for unordered data Petri nets is in PTime |
scientific article; zbMATH DE number 7158702
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Continuous reachability for unordered data Petri nets is in PTime |
scientific article; zbMATH DE number 7158702 |
Statements
Continuous reachability for unordered data Petri nets is in PTime (English)
0 references
28 January 2020
0 references
Petri nets
0 references
continuous reachability
0 references
unordered data
0 references
polynomial time
0 references
0.8788679
0 references
0 references
0.86859465
0 references
0.86691177
0 references
0.8664979
0 references
0.8645597
0 references
0 references
0.8623215
0 references
0.86109406
0 references
0.86092067
0 references
