New NP-complete problems in performance evaluation of concurrent systems using Petri nets
Journal Article
·
· IEEE Trans. Software Eng.; (United States)
Timed Petri nets are useful in performance evaluation of concurrent systems. The maximum computation rate is achieved for minimal cycle time of timed Petri net. It is known that minimal cycle time problem for P-invariant Petri nets is NP-complete. In this paper the authors prove that the minimal cycle time problem, for non-P-invariant Petri nets and for a small subclass of P-invariant Petri nets called free-choice nets having live and safe marking, is NP-complete.
- Research Organization:
- Institute of Engineering Cybernetics, Technical Univ. of Wroclaw, Wybrzeze Wyspianskiego 27, 50-370 Wroclaw
- OSTI ID:
- 6311187
- Journal Information:
- IEEE Trans. Software Eng.; (United States), Journal Name: IEEE Trans. Software Eng.; (United States) Vol. SE-13:5; ISSN IESED
- Country of Publication:
- United States
- Language:
- English
Similar Records
Analysis of distributed system software design based Structured Petri Net Model
Timing requirements for time-driven systems using augmented Petri nets
Petri-net-based modeling and evaluation of pipelined processing of concurrent database queries
Thesis/Dissertation
·
Tue Dec 31 23:00:00 EST 1985
·
OSTI ID:5063183
Timing requirements for time-driven systems using augmented Petri nets
Journal Article
·
Thu Sep 01 00:00:00 EDT 1983
· IEEE Trans. Software Eng.; (United States)
·
OSTI ID:5081810
Petri-net-based modeling and evaluation of pipelined processing of concurrent database queries
Journal Article
·
Mon Oct 31 23:00:00 EST 1988
· IEEE Trans. Software Eng.; (United States)
·
OSTI ID:5818518