Performance evaluation of concurrent systems using conflict-free and persistent Petri nets

DOI10.1016/0020-0190(87)90041-XzbMath0654.68063MaRDI QIDQ1108799

Jan Magott

Publication date: 1987

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

concurrent systems; performance evaluation; polynomial algorithms; NP-hardness; firing time; cycle time problem; three-partition problem; timed marked Petri nets

Mathematics Subject Classification ID

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

Related Items

Petri net extensions for modelling and validating manufacturing systems

Cites Work

• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• Performance evaluation of concurrent systems using Petri nets
• Performance evaluation of systems of cyclic sequential processes with mutual exclusion using Petri nets
• A decidability theorem for a class of vector-addition systems
• Timing Requirements for Time-Driven Systems Using Augmented Petri Nets
• New NP-Complete Problems in Performance Evaluation of Concurrent Systems Using Petri Nets
• Performance Evaluation of Asynchronous Concurrent Systems Using Petri Nets
• Two-Processor Scheduling with Start-Times and Deadlines
• Properties of Conflict-Free and Persistent Petri Nets