Performance evaluation of concurrent systems using conflict-free and persistent Petri nets (Q1108799)
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: Performance evaluation of concurrent systems using conflict-free and persistent Petri nets |
scientific article; zbMATH DE number 4068293
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Performance evaluation of concurrent systems using conflict-free and persistent Petri nets |
scientific article; zbMATH DE number 4068293 |
Statements
Performance evaluation of concurrent systems using conflict-free and persistent Petri nets (English)
0 references
1987
0 references
For practical reasons, the live and bounded marked Petri nets are considered in this paper. The cycle time problem (CTP) for timed marked Petri nets (TMPNs) is analyzed. For conflict-free TMPNs without self- loops, the polynomial algorithms for CTP are given. For conflict-free and persistent TMPNs, the strong NP-hardness of CTP is proved.
0 references
firing time
0 references
three-partition problem
0 references
performance evaluation
0 references
concurrent systems
0 references
cycle time problem
0 references
timed marked Petri nets
0 references
polynomial algorithms
0 references
NP-hardness
0 references
0 references
0 references
0.8692067861557007
0 references
0.857811689376831
0 references
0.8268022537231445
0 references
0.8092724084854126
0 references
