New NP-Complete Problems in Performance Evaluation of Concurrent Systems Using Petri Nets

DOI10.1109/TSE.1987.233462MaRDI QIDQ3801079zbMATH OpenOpenAlexWikidataFDO

Authors Jan Magott

Publication date 1987

Published in IEEE Transactions on Software Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tse.1987.233462

zbMATH Keywords

performance evaluationminimal cycle timeconcurrent systemsTimed Petri netsfree choice netsnon-P-invariant Petri nets

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of software (68N99) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Performance evaluation of concurrent systems using Petri nets
• scientific article; zbMATH DE number 4106272
• Performance evaluation of concurrent systems using conflict-free and persistent Petri nets
• Reachability in live and safe free-choice Petri nets is NP-complete
• Generalized M-Timed Petri Nets And Performance Evaluation Of Computer Systems

Cited in

(7)

• M-schemas for macropipelined computation
• The asynchronous committee meeting problem
• Performance evaluation of concurrent systems using conflict-free and persistent Petri nets
• On Computation Complexity of the Concurrently Enabled Transition Set Problem
• scientific article; zbMATH DE number 4106272 (Why is no real title available?)
• Performance evaluation of concurrent systems using Petri nets
• Petri nets for the design and operation of manufacturing systems

This page was built for publication: New NP-Complete Problems in Performance Evaluation of Concurrent Systems Using Petri Nets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3801079)